oj.uz

Submission #104232

# Submission time Handle Problem Language Result Execution time Memory
104232 2019-04-04T10:44:30 Z RockyB The Big Prize (IOI17_prize) C++17
94.13 / 100
 55 ms 2056 KB 
#include "prize.h"
#include <bits/stdc++.h>
#define pii pair<int,int>
#define MAXN 200010
#define SQRT 300
#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 8 ms 504 KB Output is correct
2 Correct 9 ms 1272 KB Output is correct
3 Correct 6 ms 1248 KB Output is correct
4 Correct 16 ms 1820 KB Output is correct
5 Correct 55 ms 1016 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 10 ms 1144 KB Output is correct
8 Correct 5 ms 1136 KB Output is correct
9 Correct 10 ms 1144 KB Output is correct
10 Correct 12 ms 1812 KB Output is correct

Subtask #2
74.13 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 448 KB Output is correct
2 Correct 10 ms 1268 KB Output is correct
3 Correct 10 ms 1176 KB Output is correct
4 Correct 18 ms 1912 KB Output is correct
5 Correct 10 ms 1056 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 13 ms 1016 KB Output is correct
8 Correct 11 ms 1084 KB Output is correct
9 Correct 11 ms 1016 KB Output is correct
10 Correct 13 ms 1912 KB Output is correct
11 Correct 12 ms 936 KB Output is correct
12 Correct 7 ms 384 KB Output is correct
13 Correct 9 ms 1712 KB Output is correct
14 Correct 6 ms 256 KB Output is correct
15 Correct 14 ms 504 KB Output is correct
16 Correct 22 ms 1672 KB Output is correct
17 Correct 7 ms 384 KB Output is correct
18 Partially correct 52 ms 1784 KB Partially correct - number of queries: 5452
19 Correct 5 ms 512 KB Output is correct
20 Correct 11 ms 604 KB Output is correct
21 Correct 13 ms 1040 KB Output is correct
22 Correct 11 ms 376 KB Output is correct
23 Correct 8 ms 376 KB Output is correct
24 Correct 4 ms 404 KB Output is correct
25 Correct 29 ms 1144 KB Output is correct
26 Correct 31 ms 1116 KB Output is correct
27 Correct 9 ms 764 KB Output is correct
28 Partially correct 43 ms 1784 KB Partially correct - number of queries: 5036
29 Correct 39 ms 1660 KB Output is correct
30 Partially correct 44 ms 1836 KB Partially correct - number of queries: 5587
31 Correct 7 ms 256 KB Output is correct
32 Correct 17 ms 1296 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 21 ms 760 KB Output is correct
35 Correct 7 ms 1504 KB Output is correct
36 Correct 10 ms 660 KB Output is correct
37 Correct 9 ms 632 KB Output is correct
38 Correct 4 ms 480 KB Output is correct
39 Correct 22 ms 948 KB Output is correct
40 Correct 31 ms 1936 KB Output is correct
41 Correct 27 ms 1144 KB Output is correct
42 Correct 32 ms 1108 KB Output is correct
43 Correct 15 ms 1116 KB Output is correct
44 Correct 18 ms 808 KB Output is correct
45 Correct 12 ms 860 KB Output is correct
46 Correct 6 ms 384 KB Output is correct
47 Correct 15 ms 1012 KB Output is correct
48 Correct 31 ms 1388 KB Output is correct
49 Correct 5 ms 352 KB Output is correct
50 Partially correct 43 ms 1832 KB Partially correct - number of queries: 5422
51 Correct 23 ms 1016 KB Output is correct
52 Correct 6 ms 256 KB Output is correct
53 Correct 8 ms 1636 KB Output is correct
54 Correct 12 ms 960 KB Output is correct
55 Correct 3 ms 432 KB Output is correct
56 Partially correct 43 ms 1784 KB Partially correct - number of queries: 5443
57 Correct 37 ms 1360 KB Output is correct
58 Correct 21 ms 1376 KB Output is correct
59 Correct 20 ms 1204 KB Output is correct
60 Correct 32 ms 1028 KB Output is correct
61 Correct 11 ms 1652 KB Output is correct
62 Correct 6 ms 508 KB Output is correct
63 Correct 8 ms 1712 KB Output is correct
64 Correct 7 ms 1376 KB Output is correct
65 Correct 14 ms 1784 KB Output is correct
66 Correct 11 ms 1852 KB Output is correct
67 Correct 15 ms 1912 KB Output is correct
68 Correct 8 ms 384 KB Output is correct
69 Correct 10 ms 1872 KB Output is correct
70 Correct 13 ms 1856 KB Output is correct
71 Partially correct 45 ms 1784 KB Partially correct - number of queries: 5445
72 Correct 13 ms 1784 KB Output is correct
73 Partially correct 39 ms 1844 KB Partially correct - number of queries: 5382
74 Partially correct 43 ms 1940 KB Partially correct - number of queries: 5409
75 Correct 10 ms 1916 KB Output is correct
76 Correct 32 ms 1788 KB Output is correct
77 Partially correct 46 ms 1980 KB Partially correct - number of queries: 5213
78 Correct 16 ms 1784 KB Output is correct
79 Correct 34 ms 1856 KB Output is correct
80 Partially correct 50 ms 1788 KB Partially correct - number of queries: 5221
81 Partially correct 52 ms 1832 KB Partially correct - number of queries: 5213
82 Partially correct 49 ms 1832 KB Partially correct - number of queries: 5154
83 Correct 14 ms 1784 KB Output is correct
84 Correct 41 ms 1852 KB Output is correct
85 Partially correct 41 ms 1812 KB Partially correct - number of queries: 5197
86 Correct 17 ms 1784 KB Output is correct
87 Correct 14 ms 1784 KB Output is correct
88 Correct 16 ms 1784 KB Output is correct
89 Correct 17 ms 1912 KB Output is correct
90 Correct 13 ms 1936 KB Output is correct
91 Correct 8 ms 2056 KB Output is correct
92 Correct 17 ms 1848 KB Output is correct
93 Correct 17 ms 1788 KB Output is correct
94 Correct 20 ms 1784 KB Output is correct
95 Correct 19 ms 1960 KB Output is correct
96 Correct 22 ms 1912 KB Output is correct
97 Correct 17 ms 1656 KB Output is correct