oj.uz

Submission #112260

# Submission time Handle Problem Language Result Execution time Memory
112260 2019-05-18T07:50:25 Z someone_aa The Big Prize (IOI17_prize) C++17
20 / 100
 92 ms 2188 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, 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<200;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) {
        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 1144 KB Output is correct
2 Correct 7 ms 1656 KB Output is correct
3 Correct 10 ms 1528 KB Output is correct
4 Correct 12 ms 2040 KB Output is correct
5 Correct 9 ms 1656 KB Output is correct
6 Correct 4 ms 1016 KB Output is correct
7 Correct 5 ms 1680 KB Output is correct
8 Correct 6 ms 1528 KB Output is correct
9 Correct 9 ms 1656 KB Output is correct
10 Correct 11 ms 1656 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1272 KB Output is correct
2 Correct 7 ms 1600 KB Output is correct
3 Correct 8 ms 1528 KB Output is correct
4 Correct 13 ms 2040 KB Output is correct
5 Correct 9 ms 1656 KB Output is correct
6 Correct 5 ms 1144 KB Output is correct
7 Correct 5 ms 1688 KB Output is correct
8 Correct 8 ms 1528 KB Output is correct
9 Correct 11 ms 1528 KB Output is correct
10 Correct 13 ms 1980 KB Output is correct
11 Correct 5 ms 1612 KB Output is correct
12 Correct 5 ms 1144 KB Output is correct
13 Correct 8 ms 2140 KB Output is correct
14 Correct 6 ms 512 KB Output is correct
15 Correct 12 ms 1292 KB Output is correct
16 Correct 29 ms 1784 KB Output is correct
17 Correct 4 ms 1144 KB Output is correct
18 Partially correct 34 ms 2040 KB Partially correct - number of queries: 5221
19 Correct 4 ms 1144 KB Output is correct
20 Correct 16 ms 1016 KB Output is correct
21 Correct 9 ms 1460 KB Output is correct
22 Correct 8 ms 1208 KB Output is correct
23 Correct 7 ms 1280 KB Output is correct
24 Correct 5 ms 1144 KB Output is correct
25 Correct 11 ms 1636 KB Output is correct
26 Correct 24 ms 1656 KB Output is correct
27 Correct 4 ms 1512 KB Output is correct
28 Correct 36 ms 1960 KB Output is correct
29 Correct 29 ms 1864 KB Output is correct
30 Partially correct 41 ms 2112 KB Partially correct - number of queries: 5167
31 Correct 5 ms 1164 KB Output is correct
32 Correct 14 ms 1656 KB Output is correct
33 Correct 3 ms 256 KB Output is correct
34 Correct 12 ms 1528 KB Output is correct
35 Correct 8 ms 1656 KB Output is correct
36 Correct 10 ms 1400 KB Output is correct
37 Correct 7 ms 1288 KB Output is correct
38 Correct 5 ms 1144 KB Output is correct
39 Correct 25 ms 1528 KB Output is correct
40 Correct 47 ms 2028 KB Output is correct
41 Correct 13 ms 1644 KB Output is correct
42 Correct 29 ms 1696 KB Output is correct
43 Correct 26 ms 1528 KB Output is correct
44 Correct 12 ms 1616 KB Output is correct
45 Correct 14 ms 1400 KB Output is correct
46 Correct 3 ms 1160 KB Output is correct
47 Correct 22 ms 1584 KB Output is correct
48 Correct 25 ms 1820 KB Output is correct
49 Correct 4 ms 1244 KB Output is correct
50 Partially correct 36 ms 2040 KB Partially correct - number of queries: 5171
51 Correct 21 ms 1448 KB Output is correct
52 Correct 3 ms 1168 KB Output is correct
53 Correct 16 ms 1912 KB Output is correct
54 Correct 9 ms 1568 KB Output is correct
55 Correct 4 ms 1152 KB Output is correct
56 Partially correct 35 ms 1972 KB Partially correct - number of queries: 5242
57 Correct 14 ms 1948 KB Output is correct
58 Correct 27 ms 1784 KB Output is correct
59 Correct 34 ms 1568 KB Output is correct
60 Correct 27 ms 1696 KB Output is correct
61 Correct 11 ms 1912 KB Output is correct
62 Correct 4 ms 1276 KB Output is correct
63 Correct 6 ms 2012 KB Output is correct
64 Correct 8 ms 1660 KB Output is correct
65 Correct 6 ms 2124 KB Output is correct
66 Correct 12 ms 2040 KB Output is correct
67 Correct 8 ms 2008 KB Output is correct
68 Correct 8 ms 1144 KB Output is correct
69 Correct 21 ms 2040 KB Output is correct
70 Correct 14 ms 2044 KB Output is correct
71 Partially correct 33 ms 2008 KB Partially correct - number of queries: 5308
72 Correct 12 ms 2040 KB Output is correct
73 Partially correct 51 ms 2040 KB Partially correct - number of queries: 5242
74 Partially correct 38 ms 2040 KB Partially correct - number of queries: 5271
75 Correct 9 ms 2044 KB Output is correct
76 Correct 31 ms 2040 KB Output is correct
77 Partially correct 29 ms 2060 KB Partially correct - number of queries: 5306
78 Correct 12 ms 2040 KB Output is correct
79 Correct 13 ms 2184 KB Output is correct
80 Partially correct 33 ms 1980 KB Partially correct - number of queries: 5303
81 Partially correct 52 ms 2032 KB Partially correct - number of queries: 5239
82 Partially correct 53 ms 2040 KB Partially correct - number of queries: 5224
83 Correct 10 ms 1944 KB Output is correct
84 Correct 55 ms 2040 KB Output is correct
85 Partially correct 60 ms 1960 KB Partially correct - number of queries: 5242
86 Correct 20 ms 2040 KB Output is correct
87 Correct 9 ms 1712 KB Output is correct
88 Correct 28 ms 2040 KB Output is correct
89 Correct 12 ms 2188 KB Output is correct
90 Correct 11 ms 1912 KB Output is correct
91 Correct 27 ms 2036 KB Output is correct
92 Correct 6 ms 1536 KB Output is correct
93 Incorrect 92 ms 1488 KB Incorrect
94 Halted 0 ms 0 KB -