Submission #6069021


Source Code Expand

Copy
#include<bits/stdc++.h>
#define REP(x,y,z) for(int x=y;x<=z;x++)
#define MSET(x,y) memset(x,y,sizeof(x))
using namespace std;
int n,k;
int main()
{
    while (~scanf("%d %d",&n,&k)) {
        int mx = (n-1)*(n-2)/2;
        vector<pair<int,int>> out;
        if (k>mx) {
            puts("-1");
            continue;
        }


        REP(i,2,n) out.push_back( make_pair(1,i) );
        REP(i,2,n)REP(j,i+1,n) if(mx>k) {
            out.push_back( make_pair(i,j) );
            mx--;
        }
        printf("%d\n", (int)out.size());
        for (auto i:out) printf("%d %d\n",i.first,i.second);
    }

    return 0;
}

Submission Info

Submission Time
Task E - Friendships
User moffa
Language C++14 (GCC 5.4.1)
Score 500
Code Size 648 Byte
Status AC
Exec Time 2 ms
Memory 384 KB

Judge Result

Set Name All Sample
Score / Max Score 500 / 500 0 / 0
Status
AC × 18
AC × 2
Set Name Test Cases
All sample_01, sample_02, testcase_01, testcase_02, testcase_03, testcase_04, testcase_05, testcase_06, testcase_07, testcase_08, testcase_09, testcase_10, testcase_11, testcase_12, testcase_13, testcase_14, testcase_15, testcase_16
Sample sample_01, sample_02
Case Name Status Exec Time Memory
sample_01 AC 1 ms 256 KB
sample_02 AC 1 ms 256 KB
testcase_01 AC 1 ms 256 KB
testcase_02 AC 1 ms 256 KB
testcase_03 AC 1 ms 256 KB
testcase_04 AC 2 ms 384 KB
testcase_05 AC 1 ms 256 KB
testcase_06 AC 1 ms 256 KB
testcase_07 AC 1 ms 256 KB
testcase_08 AC 1 ms 256 KB
testcase_09 AC 1 ms 256 KB
testcase_10 AC 1 ms 256 KB
testcase_11 AC 1 ms 256 KB
testcase_12 AC 1 ms 256 KB
testcase_13 AC 1 ms 256 KB
testcase_14 AC 1 ms 256 KB
testcase_15 AC 2 ms 384 KB
testcase_16 AC 1 ms 256 KB