Submission #438727

#TimeUsernameProblemLanguageResultExecution timeMemory
438727shahriarkhanICC (CEOI16_icc)C++14
7 / 100
480 ms464 KiB
#include<bits/stdc++.h> #include "icc.h" using namespace std ; void run(int N) { set<pair<int,int> > s ; while(1) { int siz = s.size() ; if(siz==(N-1)) break ; for(int i = 1 ; i <= N ; ++i) { int done = 0 ; for(int j = i + 1 ; j <= N ; ++j) { if(s.find({i,j})!=s.end()) continue ; int a[1] , b[1] ; a[0] = i , b[0] = j ; if(query(1,1,a,b)) { setRoad(i,j) ; s.insert({i,j}) ; done = 1 ; break ; } } if(done) 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...