oj.uz

Submission #104231

# Submission time Handle Problem Language Result Execution time Memory
104231 2019-04-04T10:43:29 Z RockyB The Big Prize (IOI17_prize) C++17
98.15 / 100
 53 ms 2048 KB 
#include "prize.h"
#include <bits/stdc++.h>
#define pii pair<int,int>
#define MAXN 200010
#define SQRT 500
#define fi first
#define se second
using namespace std;
int max_type, N, R, key;
pii dp[MAXN];
vector<int> ask1(int idx) {
    if(dp[idx] != make_pair(0, 0)) {
        vector<int> rez(2);
        rez[0] = dp[idx].fi;
        rez[1] = dp[idx].se;
        return rez;
    }
    vector<int> rez = ask(idx);
    dp[idx] = {rez[0], rez[1]};
    return rez;
}
pii nadji_sled(int l, int r) {
    int rez = N;
    while(l <= r) {
        int mid = (l+r)/2;
        vector<int> r1 = ask1(mid);
        if(r1[0]+r1[1] > max_type) {
            rez = mid;
            r = mid-1;
        }
        else if(r1[0]+r1[1] < max_type) {
                if(r1[0]+r1[1] == 0) return {1, mid};
                rez = mid,
                r = mid-1;
        }
        else if(r1[0] > key) r = mid-1;
        else l = mid+1;
    }
    vector<int> r1 = ask1(rez);
    if(r1[0]+r1[1] > max_type) {
        max_type = r1[0]+r1[1];
        key = r1[0]-1;
    }
    return {0,rez};
}
bool prazno(int L, int R) {
    vector<int> r = ask1(R);
    if(r[0]+r[1] < max_type) return false;
    if(r[0] > key) return false;
    return true;
}
int find_best(int n) {
    int za_max = min(n, 474);
    N = n;
    for(int i = 0; i < za_max; i++) {
        vector<int> r = ask1(i);
        int cur_ask = r[0] + r[1];
        if(cur_ask == 0) return i;
        max_type = max(max_type, cur_ask);
    }
    int tr = -1;
    int posl_tr = -1;
    int L = 0, R = min(n-1, SQRT);
    while(tr < n) {
        if(!prazno(L, R)) {
            pii sled1 = nadji_sled(L, R);
            if(sled1.fi == 1) return sled1.se;
            int sled = sled1.se;
            key++;
            tr = sled;
            L = sled1.se+1;
        }
        else L = R; R = L + SQRT;
        L = min(L, n-1), R = min(R, n-1);
    }
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:73:9: warning: this 'else' clause does not guard... [-Wmisleading-indentation]
         else L = R; R = L + SQRT;
         ^~~~
prize.cpp:73:21: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'else'
         else L = R; R = L + SQRT;
                     ^
prize.cpp:62:9: warning: unused variable 'posl_tr' [-Wunused-variable]
     int posl_tr = -1;
         ^~~~~~~
prize.cpp:76:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 504 KB Output is correct
2 Correct 5 ms 1312 KB Output is correct
3 Correct 9 ms 1024 KB Output is correct
4 Correct 13 ms 1784 KB Output is correct
5 Correct 9 ms 1096 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 7 ms 1144 KB Output is correct
8 Correct 7 ms 1016 KB Output is correct
9 Correct 9 ms 1144 KB Output is correct
10 Correct 11 ms 1932 KB Output is correct

Subtask #2
78.15 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 508 KB Output is correct
2 Correct 7 ms 1312 KB Output is correct
3 Correct 11 ms 1088 KB Output is correct
4 Correct 7 ms 1816 KB Output is correct
5 Correct 6 ms 988 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 5 ms 1064 KB Output is correct
8 Correct 11 ms 1144 KB Output is correct
9 Correct 5 ms 1056 KB Output is correct
10 Correct 12 ms 2040 KB Output is correct
11 Correct 11 ms 1040 KB Output is correct
12 Correct 4 ms 320 KB Output is correct
13 Correct 17 ms 1816 KB Output is correct
14 Correct 8 ms 332 KB Output is correct
15 Correct 12 ms 504 KB Output is correct
16 Correct 35 ms 1528 KB Output is correct
17 Correct 6 ms 256 KB Output is correct
18 Partially correct 23 ms 1852 KB Partially correct - number of queries: 5185
19 Correct 4 ms 404 KB Output is correct
20 Correct 17 ms 504 KB Output is correct
21 Correct 18 ms 760 KB Output is correct
22 Correct 7 ms 664 KB Output is correct
23 Correct 7 ms 504 KB Output is correct
24 Correct 5 ms 404 KB Output is correct
25 Correct 14 ms 1360 KB Output is correct
26 Correct 20 ms 1052 KB Output is correct
27 Correct 5 ms 820 KB Output is correct
28 Partially correct 24 ms 1740 KB Partially correct - number of queries: 5079
29 Correct 18 ms 1684 KB Output is correct
30 Partially correct 44 ms 1832 KB Partially correct - number of queries: 5142
31 Correct 6 ms 376 KB Output is correct
32 Correct 7 ms 1380 KB Output is correct
33 Correct 3 ms 256 KB Output is correct
34 Correct 18 ms 692 KB Output is correct
35 Correct 7 ms 1296 KB Output is correct
36 Correct 16 ms 648 KB Output is correct
37 Correct 8 ms 632 KB Output is correct
38 Correct 6 ms 376 KB Output is correct
39 Correct 26 ms 904 KB Output is correct
40 Correct 27 ms 1756 KB Output is correct
41 Correct 16 ms 1160 KB Output is correct
42 Correct 29 ms 1192 KB Output is correct
43 Correct 19 ms 1120 KB Output is correct
44 Correct 12 ms 932 KB Output is correct
45 Correct 18 ms 760 KB Output is correct
46 Correct 5 ms 256 KB Output is correct
47 Correct 20 ms 888 KB Output is correct
48 Correct 33 ms 1400 KB Output is correct
49 Correct 6 ms 404 KB Output is correct
50 Partially correct 49 ms 1832 KB Partially correct - number of queries: 5183
51 Correct 27 ms 892 KB Output is correct
52 Correct 9 ms 256 KB Output is correct
53 Correct 14 ms 1604 KB Output is correct
54 Correct 20 ms 896 KB Output is correct
55 Correct 6 ms 256 KB Output is correct
56 Partially correct 44 ms 1912 KB Partially correct - number of queries: 5184
57 Correct 20 ms 1332 KB Output is correct
58 Correct 23 ms 1320 KB Output is correct
59 Correct 28 ms 1144 KB Output is correct
60 Correct 15 ms 1104 KB Output is correct
61 Correct 15 ms 1656 KB Output is correct
62 Correct 5 ms 376 KB Output is correct
63 Correct 10 ms 1656 KB Output is correct
64 Correct 6 ms 1304 KB Output is correct
65 Correct 11 ms 1784 KB Output is correct
66 Correct 10 ms 1816 KB Output is correct
67 Correct 7 ms 1944 KB Output is correct
68 Correct 5 ms 384 KB Output is correct
69 Correct 13 ms 1784 KB Output is correct
70 Correct 7 ms 1816 KB Output is correct
71 Partially correct 24 ms 1948 KB Partially correct - number of queries: 5154
72 Correct 17 ms 1784 KB Output is correct
73 Partially correct 43 ms 1864 KB Partially correct - number of queries: 5101
74 Partially correct 45 ms 1784 KB Partially correct - number of queries: 5124
75 Correct 14 ms 1784 KB Output is correct
76 Correct 30 ms 1892 KB Output is correct
77 Partially correct 42 ms 1784 KB Partially correct - number of queries: 5177
78 Correct 10 ms 1952 KB Output is correct
79 Correct 28 ms 1832 KB Output is correct
80 Partially correct 53 ms 1784 KB Partially correct - number of queries: 5178
81 Partially correct 27 ms 2048 KB Partially correct - number of queries: 5178
82 Partially correct 40 ms 1784 KB Partially correct - number of queries: 5130
83 Correct 15 ms 1784 KB Output is correct
84 Correct 36 ms 1788 KB Output is correct
85 Partially correct 38 ms 1764 KB Partially correct - number of queries: 5153
86 Correct 18 ms 1784 KB Output is correct
87 Correct 12 ms 1860 KB Output is correct
88 Correct 18 ms 1864 KB Output is correct
89 Correct 15 ms 1936 KB Output is correct
90 Correct 11 ms 1784 KB Output is correct
91 Correct 12 ms 1784 KB Output is correct
92 Correct 16 ms 1784 KB Output is correct
93 Correct 16 ms 1848 KB Output is correct
94 Correct 15 ms 1912 KB Output is correct
95 Correct 16 ms 1912 KB Output is correct
96 Correct 13 ms 1784 KB Output is correct
97 Correct 12 ms 1780 KB Output is correct