# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
709981 | 2023-03-15T02:23:19 Z | SanguineChameleon | 사육제 (CEOI14_carnival) | C++17 | 5 ms | 464 KB |
// BEGIN BOILERPLATE CODE #include <bits/stdc++.h> using namespace std; #ifdef KAMIRULEZ const bool kami_loc = true; const long long kami_seed = 69420; #else const bool kami_loc = false; const long long kami_seed = chrono::steady_clock::now().time_since_epoch().count(); #endif const string kami_fi = "kamirulez.inp"; const string kami_fo = "kamirulez.out"; mt19937_64 kami_gen(kami_seed); long long rand_range(long long rmin, long long rmax) { uniform_int_distribution<long long> rdist(rmin, rmax); return rdist(kami_gen); } long double rand_real(long double rmin, long double rmax) { uniform_real_distribution<long double> rdist(rmin, rmax); return rdist(kami_gen); } void file_io(string fi, string fo) { if (fi != "" && (!kami_loc || fi == kami_fi)) { freopen(fi.c_str(), "r", stdin); } if (fo != "" && (!kami_loc || fo == kami_fo)) { freopen(fo.c_str(), "w", stdout); } } void set_up() { if (kami_loc) { file_io(kami_fi, kami_fo); } ios_base::sync_with_stdio(0); cin.tie(0); } void just_do_it(); void just_exec_it() { if (kami_loc) { auto pstart = chrono::steady_clock::now(); just_do_it(); auto pend = chrono::steady_clock::now(); long long ptime = chrono::duration_cast<chrono::milliseconds>(pend - pstart).count(); string bar(50, '='); cout << '\n' << bar << '\n'; cout << "Time: " << ptime << " ms" << '\n'; } else { just_do_it(); } } int main() { set_up(); just_exec_it(); return 0; } // END BOILERPLATE CODE // BEGIN MAIN CODE int res[170]; int query(vector<int> q) { cout << q.size() << " "; for (auto x: q) { cout << x << " "; } cout << endl; int res; cin >> res; return res; } void solve(int pos, vector<int> q) { int sz = q.size(); assert(sz > 0); if (sz == 1) { res[pos] = q[0]; return; } vector<int> lv(q.begin(), q.begin() + sz / 2); vector<int> rv(q.begin() + sz / 2, q.end()); q = lv; q.push_back(pos); if (query(q) == (int)lv.size()) { solve(pos, lv); } else { solve(pos, rv); } } void just_do_it() { int n; cin >> n; vector<int> cur; for (int i = 1; i <= n; i++) { vector<int> q = cur; q.push_back(i); if (query(q) == (int)cur.size() + 1) { res[i] = cur.size() + 1; cur.push_back(i); } else { solve(i, cur); } } cout << 0 << " "; for (int i = 1; i <= n; i++) { assert(res[i] <= 11); cout << res[i] << " "; } cout << endl; } // END MAIN CODE
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 5 ms | 464 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 208 KB | Integer 6 violates the range [1, 5] |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 208 KB | Output is correct |
2 | Runtime error | 5 ms | 464 KB | Execution killed with signal 6 |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 208 KB | Integer 5 violates the range [1, 4] |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 208 KB | Output is correct |
2 | Runtime error | 5 ms | 464 KB | Execution killed with signal 6 |
3 | Halted | 0 ms | 0 KB | - |