Submission #604703

#TimeUsernameProblemLanguageResultExecution timeMemory
604703BERNARB01ICC (CEOI16_icc)C++17
0 / 100
428 ms480 KiB
#include <bits/stdc++.h> #include "icc.h" using namespace std; #ifdef B01 #include "debb.h" #else #define deb(...) #endif const int N = 101; int n; int a[N], b[2]; bitset<N> g[N]; void run(int n_) { n = n_; for (int iter = 0; iter < n - 1; iter++) { for (int u = 0; u < n; u++) { b[0] = u + 1; int sz = 0; for (int v = u + 1; v < n; v++) { if (!g[u][v]) { a[sz++] = v + 1; } } for (int i = 0; i < sz; i++) { if (query(1, 1, a + i, b)) { setRoad(a[i], b[0]); g[a[i] - 1][u] = g[u][a[i] - 1] = 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...