Submission #6065634


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

int main()
{
  int n, k;
  cin >> n >> k;

  int toConnect = (n - 1) * (n - 2) / 2 - k;
  if (toConnect < 0)
  {
    cout << -1 << endl;
    return 0;
  }

  vector < pair<int, int> > ans;
  for (int i = 1; i < n; i++)
    ans.push_back({i, n});

  for (int i = 1; i < n; i++)
    for (int j = i + 1; j < n; j++)
      if (toConnect > 0)
      {
        ans.push_back({i, j});
        toConnect--;
      }

  cout << ans.size() << endl;
  for (auto e : ans)
    cout << e.first << ' ' << e.second << endl;
}

Submission Info

Submission Time
Task E - Friendships
User flashmt
Language C++14 (GCC 5.4.1)
Score 500
Code Size 586 Byte
Status AC
Exec Time 9 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 9 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 2 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 9 ms 384 KB
testcase_16 AC 1 ms 256 KB