Submission #648221

# Submission time Handle Problem Language Result Execution time Memory
648221 2022-10-05T17:49:09 Z rafatoa The Big Prize (IOI17_prize) C++17
100 / 100
53 ms 336 KB
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#pragma GCC optimize ("Ofast")

#define double ld
const int inf = 2e9;
const int INF = 4e18;

#define F first
#define S second
#define vi vector<int>
#define vvi vector<vi>
#define pi pair<int, int>
#define vpi vector<pi>
#define vb vector<bool>
#define vvb vector<vb>
#define pb push_back
#define read(a) for(auto &x:a) cin >> x;
#define print(a) for(auto x:a) cout << x << " "; cout << "\n";
#define rs resize
#define as assign
#define vc vector<char>
#define vvc vector<vc>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

#define ppb pop_back
#define MP make_pair

//#define int ll
const int mod = 1e9+7;

vi ask(int i);

int find_best(int n){
    int ans = -1;
    function<void(int, int, vi, vi)> dfs = [&](int l, int r, vi L, vi R){
        if(ans != -1 || l+1 >= r || L == R) return;

        int mid = (l+r)/2;
        vi M = ask(mid);
        if(M[0]+M[1] == 0){
            ans = mid;
            return;
        }

        if(L[0]+L[1] == R[0]+R[1] && L[0]+L[1] > M[0]+M[1] && L[1]-R[1] == 1) return;
        dfs(l, mid, L, M); dfs(mid, r, M, R);
    };

    vi L = ask(0);
    if(L[0]+L[1] == 0) return 0;

    vi R = ask(n-1);
    if(R[0]+R[1] == 0) return n-1;

    dfs(0, n-1, L, R);
    return ans;
}

// signed main(){
//     ios_base::sync_with_stdio(0);
//     cin.tie(0);

//     #ifndef ONLINE_JUDGE
//         freopen("in.txt", "r", stdin);
//         freopen("out.txt", "w", stdout);
//     #endif

//     solve();
//     return 0;
// }

Compilation message

prize.cpp:9:17: warning: overflow in conversion from 'double' to 'int' changes value from '4.0e+18' to '2147483647' [-Woverflow]
    9 | const int INF = 4e18;
      |                 ^~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 288 KB Output is correct
2 Correct 1 ms 288 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 292 KB Output is correct
8 Correct 1 ms 292 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 268 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 292 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 288 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 288 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 2 ms 336 KB Output is correct
14 Correct 1 ms 300 KB Output is correct
15 Correct 7 ms 296 KB Output is correct
16 Correct 34 ms 208 KB Output is correct
17 Correct 1 ms 208 KB Output is correct
18 Correct 48 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 8 ms 288 KB Output is correct
21 Correct 13 ms 272 KB Output is correct
22 Correct 2 ms 300 KB Output is correct
23 Correct 1 ms 208 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 19 ms 208 KB Output is correct
26 Correct 15 ms 208 KB Output is correct
27 Correct 1 ms 208 KB Output is correct
28 Correct 37 ms 288 KB Output is correct
29 Correct 11 ms 300 KB Output is correct
30 Correct 44 ms 208 KB Output is correct
31 Correct 1 ms 208 KB Output is correct
32 Correct 3 ms 208 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 5 ms 336 KB Output is correct
35 Correct 1 ms 292 KB Output is correct
36 Correct 7 ms 208 KB Output is correct
37 Correct 1 ms 208 KB Output is correct
38 Correct 1 ms 208 KB Output is correct
39 Correct 15 ms 208 KB Output is correct
40 Correct 27 ms 292 KB Output is correct
41 Correct 19 ms 292 KB Output is correct
42 Correct 20 ms 208 KB Output is correct
43 Correct 17 ms 208 KB Output is correct
44 Correct 16 ms 292 KB Output is correct
45 Correct 13 ms 292 KB Output is correct
46 Correct 1 ms 268 KB Output is correct
47 Correct 20 ms 276 KB Output is correct
48 Correct 23 ms 208 KB Output is correct
49 Correct 3 ms 272 KB Output is correct
50 Correct 30 ms 208 KB Output is correct
51 Correct 16 ms 296 KB Output is correct
52 Correct 1 ms 296 KB Output is correct
53 Correct 2 ms 208 KB Output is correct
54 Correct 25 ms 208 KB Output is correct
55 Correct 1 ms 292 KB Output is correct
56 Correct 44 ms 208 KB Output is correct
57 Correct 13 ms 276 KB Output is correct
58 Correct 30 ms 208 KB Output is correct
59 Correct 22 ms 292 KB Output is correct
60 Correct 23 ms 208 KB Output is correct
61 Correct 1 ms 288 KB Output is correct
62 Correct 1 ms 288 KB Output is correct
63 Correct 1 ms 280 KB Output is correct
64 Correct 2 ms 208 KB Output is correct
65 Correct 1 ms 208 KB Output is correct
66 Correct 1 ms 208 KB Output is correct
67 Correct 1 ms 208 KB Output is correct
68 Correct 1 ms 208 KB Output is correct
69 Correct 1 ms 208 KB Output is correct
70 Correct 1 ms 208 KB Output is correct
71 Correct 43 ms 208 KB Output is correct
72 Correct 7 ms 208 KB Output is correct
73 Correct 44 ms 292 KB Output is correct
74 Correct 46 ms 208 KB Output is correct
75 Correct 2 ms 208 KB Output is correct
76 Correct 37 ms 208 KB Output is correct
77 Correct 32 ms 208 KB Output is correct
78 Correct 3 ms 292 KB Output is correct
79 Correct 20 ms 208 KB Output is correct
80 Correct 37 ms 208 KB Output is correct
81 Correct 53 ms 208 KB Output is correct
82 Correct 28 ms 208 KB Output is correct
83 Correct 1 ms 296 KB Output is correct
84 Correct 37 ms 292 KB Output is correct
85 Correct 46 ms 288 KB Output is correct
86 Correct 3 ms 292 KB Output is correct
87 Correct 1 ms 208 KB Output is correct
88 Correct 2 ms 208 KB Output is correct
89 Correct 2 ms 296 KB Output is correct
90 Correct 1 ms 208 KB Output is correct
91 Correct 2 ms 208 KB Output is correct
92 Correct 1 ms 208 KB Output is correct
93 Correct 4 ms 208 KB Output is correct
94 Correct 4 ms 208 KB Output is correct
95 Correct 2 ms 208 KB Output is correct
96 Correct 3 ms 336 KB Output is correct
97 Correct 1 ms 208 KB Output is correct