oj.uz

Submission #112249

# Submission time Handle Problem Language Result Execution time Memory
112249 2019-05-18T07:13:44 Z someone_aa The Big Prize (IOI17_prize) C++17
20 / 100
 96 ms 2180 KB 
#include "prize.h"
#include <bits/stdc++.h>
#define P pair<int,int>
using namespace std;
const int maxn = 200100;
const int b = 500;
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);

    if(ql.first + ql.second == 0) {
        ind = l;
        return;
    }

    if(qr.first + qr.second == 0) {
        ind = r;
        return;
    }

    if(ql.first + ql.second != max_sum) {
        solve(l+1, r);
        return;
    }

    if(qr.first + qr.second != 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;
    for(int i=0;i<min(n, 200);i++) {
        if(sum(i) == 0) return i;
        max_sum = max(max_sum, sum(i));
    } //max_sum = 1;

    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 4 ms 640 KB Output is correct
2 Correct 4 ms 1344 KB Output is correct
3 Correct 6 ms 1144 KB Output is correct
4 Correct 12 ms 2040 KB Output is correct
5 Correct 6 ms 1144 KB Output is correct
6 Correct 2 ms 316 KB Output is correct
7 Correct 4 ms 1208 KB Output is correct
8 Correct 8 ms 1200 KB Output is correct
9 Correct 8 ms 1208 KB Output is correct
10 Correct 11 ms 2048 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 504 KB Output is correct
2 Correct 7 ms 1336 KB Output is correct
3 Correct 6 ms 1144 KB Output is correct
4 Correct 31 ms 2040 KB Output is correct
5 Correct 5 ms 1212 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 8 ms 1144 KB Output is correct
8 Correct 4 ms 1208 KB Output is correct
9 Correct 6 ms 1280 KB Output is correct
10 Correct 13 ms 2040 KB Output is correct
11 Correct 11 ms 1016 KB Output is correct
12 Correct 3 ms 520 KB Output is correct
13 Correct 17 ms 1912 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 6 ms 624 KB Output is correct
16 Partially correct 47 ms 1756 KB Partially correct - number of queries: 6400
17 Correct 2 ms 524 KB Output is correct
18 Partially correct 96 ms 1972 KB Partially correct - number of queries: 7669
19 Correct 5 ms 256 KB Output is correct
20 Correct 9 ms 740 KB Output is correct
21 Correct 34 ms 936 KB Output is correct
22 Correct 4 ms 484 KB Output is correct
23 Correct 4 ms 508 KB Output is correct
24 Correct 3 ms 308 KB Output is correct
25 Correct 21 ms 1272 KB Output is correct
26 Correct 31 ms 1196 KB Output is correct
27 Correct 7 ms 676 KB Output is correct
28 Partially correct 32 ms 2104 KB Partially correct - number of queries: 6676
29 Partially correct 29 ms 1820 KB Partially correct - number of queries: 5199
30 Partially correct 27 ms 2008 KB Partially correct - number of queries: 7596
31 Correct 2 ms 416 KB Output is correct
32 Correct 10 ms 1544 KB Output is correct
33 Correct 2 ms 256 KB Output is correct
34 Correct 11 ms 904 KB Output is correct
35 Correct 5 ms 1512 KB Output is correct
36 Correct 8 ms 688 KB Output is correct
37 Correct 3 ms 712 KB Output is correct
38 Correct 5 ms 504 KB Output is correct
39 Correct 32 ms 1044 KB Output is correct
40 Partially correct 39 ms 1988 KB Partially correct - number of queries: 6758
41 Correct 17 ms 1452 KB Output is correct
42 Correct 17 ms 1452 KB Output is correct
43 Correct 41 ms 1192 KB Output is correct
44 Correct 22 ms 936 KB Output is correct
45 Correct 10 ms 812 KB Output is correct
46 Correct 4 ms 256 KB Output is correct
47 Correct 22 ms 1016 KB Output is correct
48 Partially correct 36 ms 1588 KB Partially correct - number of queries: 5528
49 Correct 11 ms 424 KB Output is correct
50 Partially correct 57 ms 2064 KB Partially correct - number of queries: 7650
51 Correct 23 ms 888 KB Output is correct
52 Correct 3 ms 384 KB Output is correct
53 Correct 7 ms 1904 KB Output is correct
54 Correct 28 ms 1020 KB Output is correct
55 Correct 5 ms 384 KB Output is correct
56 Partially correct 28 ms 2128 KB Partially correct - number of queries: 7632
57 Partially correct 31 ms 1660 KB Partially correct - number of queries: 5471
58 Partially correct 20 ms 1576 KB Partially correct - number of queries: 5476
59 Correct 55 ms 1320 KB Output is correct
60 Correct 49 ms 1188 KB Output is correct
61 Correct 11 ms 1928 KB Output is correct
62 Correct 3 ms 520 KB Output is correct
63 Correct 15 ms 1784 KB Output is correct
64 Correct 10 ms 1272 KB Output is correct
65 Correct 13 ms 2040 KB Output is correct
66 Correct 10 ms 2040 KB Output is correct
67 Correct 7 ms 2112 KB Output is correct
68 Correct 5 ms 256 KB Output is correct
69 Correct 12 ms 1972 KB Output is correct
70 Correct 14 ms 2040 KB Output is correct
71 Partially correct 55 ms 1960 KB Partially correct - number of queries: 7935
72 Correct 13 ms 2040 KB Output is correct
73 Partially correct 73 ms 1976 KB Partially correct - number of queries: 7844
74 Partially correct 29 ms 2148 KB Partially correct - number of queries: 7883
75 Correct 14 ms 2072 KB Output is correct
76 Partially correct 55 ms 2092 KB Partially correct - number of queries: 6999
77 Partially correct 28 ms 2052 KB Partially correct - number of queries: 7301
78 Correct 15 ms 2040 KB Output is correct
79 Correct 28 ms 2040 KB Output is correct
80 Partially correct 49 ms 1976 KB Partially correct - number of queries: 7271
81 Partially correct 83 ms 2040 KB Partially correct - number of queries: 7209
82 Partially correct 30 ms 2052 KB Partially correct - number of queries: 7241
83 Correct 7 ms 2180 KB Output is correct
84 Partially correct 60 ms 1980 KB Partially correct - number of queries: 6205
85 Partially correct 55 ms 2040 KB Partially correct - number of queries: 7185
86 Incorrect 83 ms 932 KB Incorrect
87 Halted 0 ms 0 KB -