oj.uz

Submission #789093

# Submission time Handle Problem Language Result Execution time Memory
789093 2023-07-21T04:34:05 Z t6twotwo The Big Prize (IOI17_prize) C++17
90 / 100
 50 ms 424 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
int find_best(int N) {
    int lol = -1, ted = -1, cnt = 0;
    vector<vector<int>> a(475);
    for (int i = 0; i < 475; i++) {
        a[i] = ask(i);
        int s = a[i][0] + a[i][1];
        if (s == 0) {
            return i;
        }
        lol = max(lol, s);
    }
    for (int i = 0; i < 475; i++) {
        int s = a[i][0] + a[i][1];
        if (s < lol) {
            cnt++;
            ted = max(ted, s);
        }
    }
    int x = 475;
    while (cnt < 27) {
        vector<int> t = ask(x);
        int s = t[0] + t[1];
        if (s == 0) {
            return x;
        }
        if (s == lol) {
            int lo = x, hi = N - 1;
            while (lo < hi) {
                int mi = (lo + hi + 1) / 2;
                vector<int> v = ask(mi);
                if (v == t) {
                    lo = mi;
                } else {
                    hi = mi - 1;
                }
            }
            x = lo;
        } else {
            cnt++;
            ted = max(ted, s);
        }
        x++;
    }
    while (1) {
        vector<int> t = ask(x);
        int s = t[0] + t[1];
        if (s == 0) {
            return x;
        }
        if (s < ted) {
            x++;
            continue;
        }
        if (s == lol) {
            int lo = x, hi = N - 1;
            while (lo < hi) {
                int mi = (lo + hi + 1) / 2;
                vector<int> v = ask(mi);
                if (v == t) {
                    lo = mi;
                } else {
                    hi = mi - 1;
                }
            }
            x = lo + 1;
        } else {
            int lo = x, hi = N - 1;
            while (lo < hi) {
                int mi = (lo + hi + 1) / 2;
                vector<int> v = ask(mi);
                if (v == t) {
                    lo = mi;
                } else if (v[0] + v[1] == lol) {
                    int l = lo + 1, r = mi;
                    while (l < r) {
                        int m = (l + r) / 2;
                        vector<int> u = ask(m);
                        if (u == v) {
                            r = m;
                        } else {
                            l = m + 1;
                        }
                    }
                    if (ask(l - 1) == t) {
                        lo = mi;
                    } else {
                        hi = mi - 1;
                    }
                } else {
                    hi = mi - 1;
                }
            }
            x = lo + 1;
        }
    }
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 208 KB Output is correct
2 Correct 2 ms 316 KB Output is correct
3 Correct 4 ms 208 KB Output is correct
4 Correct 5 ms 308 KB Output is correct
5 Correct 4 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 4 ms 208 KB Output is correct
8 Correct 4 ms 288 KB Output is correct
9 Correct 5 ms 288 KB Output is correct
10 Correct 4 ms 208 KB Output is correct

Subtask #2
70.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 312 KB Output is correct
2 Correct 2 ms 324 KB Output is correct
3 Correct 3 ms 292 KB Output is correct
4 Correct 4 ms 208 KB Output is correct
5 Correct 4 ms 288 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 3 ms 424 KB Output is correct
8 Correct 3 ms 316 KB Output is correct
9 Correct 2 ms 320 KB Output is correct
10 Correct 5 ms 208 KB Output is correct
11 Correct 6 ms 296 KB Output is correct
12 Correct 5 ms 208 KB Output is correct
13 Correct 4 ms 316 KB Output is correct
14 Correct 8 ms 208 KB Output is correct
15 Correct 8 ms 304 KB Output is correct
16 Correct 45 ms 292 KB Output is correct
17 Correct 3 ms 288 KB Output is correct
18 Partially correct 44 ms 208 KB Partially correct - number of queries: 5338
19 Correct 4 ms 344 KB Output is correct
20 Correct 22 ms 296 KB Output is correct
21 Correct 18 ms 288 KB Output is correct
22 Correct 10 ms 292 KB Output is correct
23 Correct 5 ms 288 KB Output is correct
24 Correct 4 ms 296 KB Output is correct
25 Correct 37 ms 308 KB Output is correct
26 Correct 29 ms 208 KB Output is correct
27 Correct 6 ms 280 KB Output is correct
28 Correct 16 ms 316 KB Output is correct
29 Correct 16 ms 312 KB Output is correct
30 Correct 33 ms 304 KB Output is correct
31 Correct 4 ms 288 KB Output is correct
32 Correct 9 ms 208 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 10 ms 316 KB Output is correct
35 Correct 3 ms 280 KB Output is correct
36 Correct 10 ms 292 KB Output is correct
37 Correct 2 ms 316 KB Output is correct
38 Correct 2 ms 336 KB Output is correct
39 Correct 20 ms 292 KB Output is correct
40 Correct 9 ms 312 KB Output is correct
41 Correct 20 ms 316 KB Output is correct
42 Correct 35 ms 208 KB Output is correct
43 Correct 12 ms 316 KB Output is correct
44 Correct 20 ms 284 KB Output is correct
45 Correct 24 ms 284 KB Output is correct
46 Correct 4 ms 208 KB Output is correct
47 Correct 29 ms 292 KB Output is correct
48 Correct 21 ms 288 KB Output is correct
49 Correct 13 ms 296 KB Output is correct
50 Partially correct 50 ms 208 KB Partially correct - number of queries: 5699
51 Correct 14 ms 312 KB Output is correct
52 Correct 5 ms 208 KB Output is correct
53 Correct 4 ms 292 KB Output is correct
54 Correct 18 ms 316 KB Output is correct
55 Correct 2 ms 312 KB Output is correct
56 Partially correct 41 ms 296 KB Partially correct - number of queries: 5209
57 Correct 29 ms 208 KB Output is correct
58 Correct 41 ms 284 KB Output is correct
59 Correct 26 ms 336 KB Output is correct
60 Correct 23 ms 208 KB Output is correct
61 Correct 4 ms 288 KB Output is correct
62 Correct 4 ms 288 KB Output is correct
63 Correct 5 ms 208 KB Output is correct
64 Correct 5 ms 272 KB Output is correct
65 Correct 5 ms 296 KB Output is correct
66 Correct 3 ms 336 KB Output is correct
67 Correct 2 ms 284 KB Output is correct
68 Correct 3 ms 280 KB Output is correct
69 Correct 6 ms 300 KB Output is correct
70 Correct 2 ms 364 KB Output is correct
71 Partially correct 44 ms 208 KB Partially correct - number of queries: 6063
72 Correct 8 ms 208 KB Output is correct
73 Partially correct 35 ms 208 KB Partially correct - number of queries: 5532
74 Partially correct 26 ms 316 KB Partially correct - number of queries: 5337
75 Correct 6 ms 312 KB Output is correct
76 Correct 33 ms 208 KB Output is correct
77 Partially correct 38 ms 208 KB Partially correct - number of queries: 5836
78 Correct 5 ms 320 KB Output is correct
79 Correct 20 ms 336 KB Output is correct
80 Partially correct 34 ms 208 KB Partially correct - number of queries: 5877
81 Partially correct 20 ms 312 KB Partially correct - number of queries: 6059
82 Correct 17 ms 356 KB Output is correct
83 Correct 3 ms 208 KB Output is correct
84 Correct 39 ms 208 KB Output is correct
85 Partially correct 32 ms 208 KB Partially correct - number of queries: 5194
86 Correct 3 ms 208 KB Output is correct
87 Correct 4 ms 208 KB Output is correct
88 Correct 3 ms 208 KB Output is correct
89 Correct 4 ms 208 KB Output is correct
90 Correct 5 ms 208 KB Output is correct
91 Correct 3 ms 292 KB Output is correct
92 Correct 2 ms 308 KB Output is correct
93 Correct 8 ms 208 KB Output is correct
94 Correct 10 ms 208 KB Output is correct
95 Correct 9 ms 208 KB Output is correct
96 Correct 5 ms 208 KB Output is correct
97 Correct 5 ms 320 KB Output is correct