Submission #342534

#TimeUsernameProblemLanguageResultExecution timeMemory
342534blueICC (CEOI16_icc)C++11
0 / 100
449 ms620 KiB
#include "icc.h" #include <set> using namespace std; void run(int N) { set<int> edge[N+1]; int a[1], b[1]; for(int i = 1; i <= N-1; i++) { for(int p = 1; p <= N; p++) { for(int q = p+1; q <= N; q++) { if(edge[p].find(q) != edge[p].end()) continue; a[0] = p; b[0] = q; if(query(1, 1, a, b) == 0) continue; edge[p].insert(q); edge[q].insert(p); setRoad(p, q); break; } } } }
#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...