제출 #101262

#제출 시각아이디문제언어결과실행 시간메모리
101262dwscICC (CEOI16_icc)C++14
7 / 100
352 ms584 KiB
#include "icc.h" #include <bits/stdc++.h> using namespace std; typedef pair<int,int> ii; void run(int n) { set<ii> s; int a[1],b[1]; for (int k = 0; k < n-1; k++){ int done = 0; for (int i =1; i <= n; i++){ if (done) break; for (int j = i+1; j <= n; j++){ if (s.find(ii(i,j)) != s.end()) continue; a[0] = i,b[0] = j; if (query(1,1,a,b)){ setRoad(i,j); s.insert(ii(i,j)); done = 1; 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...