Submission #1117153

#TimeUsernameProblemLanguageResultExecution timeMemory
1117153SofiatpcICC (CEOI16_icc)C++14
7 / 100
201 ms624 KiB
#include <bits/stdc++.h> #include <icc.h> using namespace std; set<pair<int,int>>st; void run(int n){ for(int k = 1; k < n; k++){ int u = 0, v = 0; for(int i = 1; i <= n; i++){ if(u)break; for(int j = i+1; j <= n; j++){ if(st.find({i,j}) != st.end())continue; int a[1],b[1]; a[0] = i; b[0] = j; int x = query(1,1,a,b); if(x){u = i; v = j; break;} } } st.insert({u,v}); setRoad(u,v); } }
#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...