oj.uz

Submission #112256

# Submission time Handle Problem Language Result Execution time Memory
112256 2019-05-18T07:41:15 Z someone_aa The Big Prize (IOI17_prize) C++17
90 / 100
 82 ms 2268 KB 
#include "prize.h"
#include <bits/stdc++.h>
#define P pair<int,int>
using namespace std;
const int maxn = 200100;
bool visited[maxn];
int q[maxn][2];
int max_sum, ind;
P query(int i) {
    if(visited[i]) return {q[i][0], q[i][1]};
    visited[i] = true;
    vector<int>curr = ask(i);
    q[i][0] = curr[0];
    q[i][1] = curr[1];
    return {q[i][0], q[i][1]};
}

int sum(int i) {
    query(i);
    return q[i][0] + q[i][1];
}

void solve(int l, int r) {
    //cout<<l<<" "<<r<<"\n";
    if(l > r || ind != -1) return;

    P ql = query(l);
    P qr = query(r);

    int suml = ql.first + ql.second;
    int sumr = qr.first + qr.second;

    if(suml == 0) {
        ind = l;
        return;
    }

    if(sumr == 0) {
        ind = r;
        return;
    }

    if(ql.second == 0 || qr.first == 0) return;

    if(l == r) return;

    if(suml != max_sum) {
        solve(l+1, r);
        return;
    }

    if(sumr != max_sum) {
        solve(l, r-1);
        return;
    }

    int between  = qr.first - ql.first;
    if(between == 0) return;

    int mid = (l + r) / 2;

    solve(l, mid);
    solve(mid+1, r);
}

int find_best(int n) {
    ind = -1;

    int b = sqrt(n) + 1;
    b = min(n, b);

    mt19937 g(chrono::high_resolution_clock::now().time_since_epoch().count());
    uniform_int_distribution<int> uid(0, n - 1);

    for(int i=0;i-b<n;i+=b) {
        int x = min(i, n-1);
        if(sum(x) == 0) return x;
        max_sum = max(max_sum, sum(x));
    } //max_sum = 1;

    for(int i=0;i<100;i++) {
        int pos = uid(g);
        if(sum(pos) == 0) return pos;
        max_sum = max(max_sum, sum(pos));
    }

    for(int l=0;l<n;l+=b) {
        if(ind != -1) return ind;
        int r = min(n-1, l+b-1);
        solve(l, r);
    }
    return ind;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2040 KB Output is correct
2 Correct 13 ms 1976 KB Output is correct
3 Correct 7 ms 2040 KB Output is correct
4 Correct 7 ms 2040 KB Output is correct
5 Correct 5 ms 2044 KB Output is correct
6 Correct 2 ms 404 KB Output is correct
7 Correct 12 ms 2040 KB Output is correct
8 Correct 9 ms 2052 KB Output is correct
9 Correct 6 ms 2176 KB Output is correct
10 Correct 14 ms 2048 KB Output is correct

Subtask #2
70.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 2040 KB Output is correct
2 Correct 9 ms 2040 KB Output is correct
3 Correct 14 ms 2040 KB Output is correct
4 Correct 4 ms 2164 KB Output is correct
5 Correct 5 ms 2076 KB Output is correct
6 Correct 2 ms 400 KB Output is correct
7 Correct 8 ms 2048 KB Output is correct
8 Correct 12 ms 2040 KB Output is correct
9 Correct 6 ms 2088 KB Output is correct
10 Correct 10 ms 2112 KB Output is correct
11 Correct 10 ms 1960 KB Output is correct
12 Correct 6 ms 1980 KB Output is correct
13 Correct 12 ms 2040 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 19 ms 1976 KB Output is correct
16 Partially correct 44 ms 2072 KB Partially correct - number of queries: 6407
17 Correct 8 ms 2040 KB Output is correct
18 Partially correct 29 ms 2168 KB Partially correct - number of queries: 7609
19 Correct 5 ms 2176 KB Output is correct
20 Correct 22 ms 1280 KB Output is correct
21 Correct 14 ms 2036 KB Output is correct
22 Correct 6 ms 2056 KB Output is correct
23 Correct 5 ms 2040 KB Output is correct
24 Correct 8 ms 2040 KB Output is correct
25 Correct 28 ms 2068 KB Output is correct
26 Correct 29 ms 1976 KB Output is correct
27 Correct 7 ms 2040 KB Output is correct
28 Partially correct 23 ms 2056 KB Partially correct - number of queries: 6628
29 Partially correct 58 ms 2156 KB Partially correct - number of queries: 5198
30 Partially correct 71 ms 2040 KB Partially correct - number of queries: 7587
31 Correct 7 ms 1972 KB Output is correct
32 Correct 7 ms 2036 KB Output is correct
33 Correct 2 ms 420 KB Output is correct
34 Correct 18 ms 1912 KB Output is correct
35 Correct 12 ms 2040 KB Output is correct
36 Correct 10 ms 2096 KB Output is correct
37 Correct 5 ms 2268 KB Output is correct
38 Correct 7 ms 2044 KB Output is correct
39 Correct 22 ms 2060 KB Output is correct
40 Partially correct 55 ms 2040 KB Partially correct - number of queries: 6602
41 Correct 18 ms 1976 KB Output is correct
42 Correct 33 ms 1972 KB Output is correct
43 Correct 41 ms 1960 KB Output is correct
44 Correct 14 ms 2040 KB Output is correct
45 Correct 19 ms 2040 KB Output is correct
46 Correct 8 ms 2040 KB Output is correct
47 Correct 13 ms 2168 KB Output is correct
48 Partially correct 52 ms 2168 KB Partially correct - number of queries: 5571
49 Correct 12 ms 2040 KB Output is correct
50 Partially correct 56 ms 2040 KB Partially correct - number of queries: 7571
51 Correct 45 ms 2040 KB Output is correct
52 Correct 7 ms 2036 KB Output is correct
53 Correct 12 ms 2040 KB Output is correct
54 Correct 39 ms 2040 KB Output is correct
55 Correct 7 ms 2048 KB Output is correct
56 Partially correct 61 ms 2176 KB Partially correct - number of queries: 7630
57 Partially correct 40 ms 2040 KB Partially correct - number of queries: 5578
58 Partially correct 25 ms 2056 KB Partially correct - number of queries: 5605
59 Correct 43 ms 2040 KB Output is correct
60 Correct 23 ms 2040 KB Output is correct
61 Correct 15 ms 1960 KB Output is correct
62 Correct 10 ms 2048 KB Output is correct
63 Correct 6 ms 1976 KB Output is correct
64 Correct 12 ms 2040 KB Output is correct
65 Correct 10 ms 2040 KB Output is correct
66 Correct 6 ms 1972 KB Output is correct
67 Correct 7 ms 2048 KB Output is correct
68 Correct 6 ms 2044 KB Output is correct
69 Correct 7 ms 2036 KB Output is correct
70 Correct 12 ms 2040 KB Output is correct
71 Partially correct 75 ms 2048 KB Partially correct - number of queries: 8019
72 Correct 14 ms 2048 KB Output is correct
73 Partially correct 74 ms 2048 KB Partially correct - number of queries: 7930
74 Partially correct 82 ms 2048 KB Partially correct - number of queries: 7970
75 Correct 19 ms 2040 KB Output is correct
76 Partially correct 80 ms 2048 KB Partially correct - number of queries: 6994
77 Partially correct 73 ms 2040 KB Partially correct - number of queries: 7174
78 Correct 19 ms 2048 KB Output is correct
79 Correct 32 ms 2040 KB Output is correct
80 Partially correct 72 ms 2048 KB Partially correct - number of queries: 7308
81 Partially correct 26 ms 1992 KB Partially correct - number of queries: 7388
82 Partially correct 42 ms 2040 KB Partially correct - number of queries: 7234
83 Correct 10 ms 2040 KB Output is correct
84 Partially correct 59 ms 2040 KB Partially correct - number of queries: 6155
85 Partially correct 45 ms 2048 KB Partially correct - number of queries: 7298
86 Correct 13 ms 2040 KB Output is correct
87 Correct 14 ms 2048 KB Output is correct
88 Correct 23 ms 2040 KB Output is correct
89 Correct 23 ms 2048 KB Output is correct
90 Correct 11 ms 2120 KB Output is correct
91 Correct 19 ms 2048 KB Output is correct
92 Correct 16 ms 1960 KB Output is correct
93 Correct 20 ms 2048 KB Output is correct
94 Correct 21 ms 2048 KB Output is correct
95 Correct 23 ms 2048 KB Output is correct
96 Correct 13 ms 2040 KB Output is correct
97 Correct 18 ms 2048 KB Output is correct