제출 #57860

#제출 시각아이디문제언어결과실행 시간메모리
57860fredbrICC (CEOI16_icc)C++17
0 / 100
28 ms696 KiB
#include <bits/stdc++.h> #include "icc.h" using namespace std; const int maxn = 110; int roads = 0; void solve(int x, int l, int r) { if (l == r) { setRoad(x, l); roads++; return; } int m = (l+r)/2; vector<int> xc = {x}; vector<int> lc; for (int i = l; i <= m; i++) lc.push_back(i); vector<int> rc; for (int i = m+1; i <= r; i++) rc.push_back(i); int lans = query(1, m-l+1, xc.data(), lc.data()); int rans = query(1, r-m, xc.data(), rc.data()); if (lans) solve(x, l, m); if (rans) solve(x, m+1, r); } void run(int n) { for (int i = 1; i < n and roads < n-1; i++) solve(i, i+1, n); }
#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...