제출 #604863

#제출 시각아이디문제언어결과실행 시간메모리
604863promaICC (CEOI16_icc)C++17
7 / 100
358 ms792 KiB
#include "icc.h" #include <bits/stdc++.h> using namespace std; void run(int n) { set<pair<int,int>> edges; for(int i = 0; i < n - 1; i++) { for(int a = 1; a <= n; ++a) { for(int b = a + 1; b <= n; ++b) { int* arr1 = new int[1]; arr1[0] = a; int* arr2 = new int[1]; arr2[0] = b; if(edges.count({a,b}) == 0 && query(1, 1, arr1, arr2) == 1) { edges.insert({a,b}); cerr << a << " " << b << endl; setRoad(a, b); a = n + 1; b = n + 1; } } } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...