Submission #258254

#TimeUsernameProblemLanguageResultExecution timeMemory
258254kimbj0709ICC (CEOI16_icc)C++14
7 / 100
503 ms564 KiB
//#pragma GCC optimize("O3") #include <bits/stdc++.h> #include "icc.h" using namespace std; #define ve vector typedef long long ll; typedef pair<int, int> pii; void run(int n) { int r, a, b, A[1], B[1]; bool E[15][15] = {}; for (int i = 0; i < n - 1; i++) { a = -1; b = -1; for (int j = 0; j < n; j++) { for (int k = 0; k < j; k++) { A[0] = j + 1; B[0] = k + 1; r = query(1, 1, A, B); if (r == 1 && !E[j][k]) { //assert(a==-1&&b==-1); a = j; b = k; E[j][k] = true; } } } setRoad(a + 1, b + 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...