# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1013414 | 2024-07-03T14:03:08 Z | NintsiChkhaidze | The Big Prize (IOI17_prize) | C++17 | 8 ms | 10328 KB |
#include <bits/stdc++.h> #define pb push_back #include "prize.h" using namespace std; bool fix[200003]; int Q; vector <int> dp[200003]; vector <int> askk(int x){ Q++; return ask(x); } int find_best(int n){ int block = 500,mx = -1,idx = -1; vector <int> opt; for (int i = 0; i < min(n,block); i++){ vector <int> vec = askk(i); int sum = vec[0] + vec[1]; if (sum == 0) return i; if (sum > mx){ mx = sum; opt = vec; idx = i; } } for (int i = idx; i < n; i++){ vector <int> vec = askk(i); if (vec[0] + vec[1] == 0) { return i; } if (vec[0] + vec[1] != mx) { fix[i] = 1; continue; } opt = vec; int id = i; int l = i, r = n - 1,res = i; for (int j = 18; j >= 0; j--){ int c = i + (1<<j) - 1; if (c >= n) continue; vector <int> vec = askk(c); if (vec == opt) { res += (1<<j); } } for (int j = id; j <= res; j++) fix[j] = 1; i = res; } for (int i = 0; i < n; i++){ if (!fix[i]){ vector <int> vec = askk(i); if (vec[0] + vec[1] == 0) { return i; } } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 8 ms | 10328 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 7 ms | 10260 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |