oj.uz

Submission #692477

# Submission time Handle Problem Language Result Execution time Memory
692477 2023-02-01T13:56:38 Z sharaelong The Big Prize (IOI17_prize) C++17
100 / 100
 51 ms 1888 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

const int MAX_N = 2e5 + 1;

int trash = 0;
pii res[MAX_N];

void secure_ask(int x) {
    if (res[x].first == -1) {
        vector<int> tmp = ask(x);
        res[x] = { tmp[0], tmp[1] };
    }
}

void solve(int l, int r) {
    while (l <= r) {
        secure_ask(l);
        if (res[l].first + res[l].second == trash) break;
        l++;
    }
    while (l <= r) {
        secure_ask(r);
        if (res[r].first + res[r].second == trash) break;
        r--;
    }
    if (l >= r) return;

    int m = (l+r) / 2;
    while (m < r) {
        secure_ask(m);
        if (res[m].first + res[m].second == trash) {
            if (res[l].first < res[m].first) solve(l, m);
            if (res[m].first < res[r].first) solve(m, r);
            return;
        }
        m++;
    }
    m = (l+r) / 2;
    while (m > l) {
        secure_ask(m);
        if (res[m].first + res[m].second == trash) {
            if (res[l].first < res[m].first) solve(l, m);
            if (res[m].first < res[r].first) solve(m, r);
            return;
        }
        m--;
    }
}

int find_best(int n) {
    memset(res, -1, sizeof res);
    
    int rtn = sqrt(n);
    for (int i=rtn; i<n; i+=rtn) {
        vector<int> tmp = ask(i);
        if (tmp[0] + tmp[1] == 0) return i;
        trash = max(trash, tmp[0]+tmp[1]); 
        res[i] = { tmp[0], tmp[1] };
    }
    for (int i=rtn; i<n; i+=rtn) solve(i-rtn, i);
    solve(n-1-rtn, n-1);

    for (int i=0; i<n; ++i) {
        if (res[i].first + res[i].second == 0) {
            return i;
        }
    }
    assert(false);
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:55:31: warning: 'void* memset(void*, int, size_t)' writing to an object of type 'pii' {aka 'struct std::pair<int, int>'} with no trivial copy-assignment [-Wclass-memaccess]
   55 |     memset(res, -1, sizeof res);
      |                               ^
In file included from /usr/include/c++/10/bits/stl_algobase.h:64,
                 from /usr/include/c++/10/vector:60,
                 from prize.h:1,
                 from prize.cpp:1:
/usr/include/c++/10/bits/stl_pair.h:211:12: note: 'pii' {aka 'struct std::pair<int, int>'} declared here
  211 |     struct pair
      |            ^~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1744 KB Output is correct
2 Correct 7 ms 1832 KB Output is correct
3 Correct 8 ms 1744 KB Output is correct
4 Correct 6 ms 1744 KB Output is correct
5 Correct 8 ms 1836 KB Output is correct
6 Correct 6 ms 1832 KB Output is correct
7 Correct 8 ms 1744 KB Output is correct
8 Correct 10 ms 1836 KB Output is correct
9 Correct 8 ms 1744 KB Output is correct
10 Correct 7 ms 1744 KB Output is correct

Subtask #2
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1836 KB Output is correct
2 Correct 11 ms 1840 KB Output is correct
3 Correct 9 ms 1744 KB Output is correct
4 Correct 7 ms 1828 KB Output is correct
5 Correct 7 ms 1840 KB Output is correct
6 Correct 10 ms 1840 KB Output is correct
7 Correct 10 ms 1744 KB Output is correct
8 Correct 11 ms 1744 KB Output is correct
9 Correct 11 ms 1744 KB Output is correct
10 Correct 6 ms 1744 KB Output is correct
11 Correct 13 ms 1828 KB Output is correct
12 Correct 12 ms 1840 KB Output is correct
13 Correct 10 ms 1828 KB Output is correct
14 Correct 12 ms 1744 KB Output is correct
15 Correct 18 ms 1844 KB Output is correct
16 Correct 46 ms 1744 KB Output is correct
17 Correct 24 ms 1744 KB Output is correct
18 Correct 33 ms 1828 KB Output is correct
19 Correct 25 ms 1744 KB Output is correct
20 Correct 24 ms 1744 KB Output is correct
21 Correct 51 ms 1744 KB Output is correct
22 Correct 23 ms 1832 KB Output is correct
23 Correct 10 ms 1796 KB Output is correct
24 Correct 5 ms 1864 KB Output is correct
25 Correct 18 ms 1820 KB Output is correct
26 Correct 45 ms 1840 KB Output is correct
27 Correct 8 ms 1744 KB Output is correct
28 Correct 18 ms 1832 KB Output is correct
29 Correct 42 ms 1836 KB Output is correct
30 Correct 48 ms 1836 KB Output is correct
31 Correct 31 ms 1736 KB Output is correct
32 Correct 10 ms 1736 KB Output is correct
33 Correct 1 ms 1744 KB Output is correct
34 Correct 36 ms 1832 KB Output is correct
35 Correct 11 ms 1836 KB Output is correct
36 Correct 45 ms 1832 KB Output is correct
37 Correct 11 ms 1832 KB Output is correct
38 Correct 9 ms 1888 KB Output is correct
39 Correct 19 ms 1824 KB Output is correct
40 Correct 32 ms 1824 KB Output is correct
41 Correct 19 ms 1836 KB Output is correct
42 Correct 45 ms 1744 KB Output is correct
43 Correct 18 ms 1744 KB Output is correct
44 Correct 49 ms 1740 KB Output is correct
45 Correct 40 ms 1820 KB Output is correct
46 Correct 44 ms 1784 KB Output is correct
47 Correct 40 ms 1828 KB Output is correct
48 Correct 29 ms 1840 KB Output is correct
49 Correct 21 ms 1820 KB Output is correct
50 Correct 38 ms 1816 KB Output is correct
51 Correct 49 ms 1840 KB Output is correct
52 Correct 35 ms 1836 KB Output is correct
53 Correct 8 ms 1744 KB Output is correct
54 Correct 50 ms 1744 KB Output is correct
55 Correct 33 ms 1828 KB Output is correct
56 Correct 37 ms 1736 KB Output is correct
57 Correct 24 ms 1872 KB Output is correct
58 Correct 31 ms 1840 KB Output is correct
59 Correct 21 ms 1828 KB Output is correct
60 Correct 38 ms 1844 KB Output is correct
61 Correct 6 ms 1832 KB Output is correct
62 Correct 10 ms 1840 KB Output is correct
63 Correct 10 ms 1840 KB Output is correct
64 Correct 10 ms 1744 KB Output is correct
65 Correct 11 ms 1736 KB Output is correct
66 Correct 6 ms 1832 KB Output is correct
67 Correct 13 ms 1744 KB Output is correct
68 Correct 12 ms 1832 KB Output is correct
69 Correct 6 ms 1864 KB Output is correct
70 Correct 10 ms 1832 KB Output is correct
71 Correct 18 ms 1744 KB Output is correct
72 Correct 16 ms 1744 KB Output is correct
73 Correct 36 ms 1744 KB Output is correct
74 Correct 36 ms 1744 KB Output is correct
75 Correct 10 ms 1744 KB Output is correct
76 Correct 41 ms 1744 KB Output is correct
77 Correct 48 ms 1744 KB Output is correct
78 Correct 9 ms 1744 KB Output is correct
79 Correct 16 ms 1744 KB Output is correct
80 Correct 37 ms 1744 KB Output is correct
81 Correct 49 ms 1744 KB Output is correct
82 Correct 46 ms 1744 KB Output is correct
83 Correct 10 ms 1744 KB Output is correct
84 Correct 36 ms 1872 KB Output is correct
85 Correct 19 ms 1840 KB Output is correct
86 Correct 13 ms 1872 KB Output is correct
87 Correct 5 ms 1744 KB Output is correct
88 Correct 7 ms 1744 KB Output is correct
89 Correct 12 ms 1744 KB Output is correct
90 Correct 5 ms 1836 KB Output is correct
91 Correct 9 ms 1744 KB Output is correct
92 Correct 13 ms 1744 KB Output is correct
93 Correct 15 ms 1744 KB Output is correct
94 Correct 16 ms 1744 KB Output is correct
95 Correct 13 ms 1744 KB Output is correct
96 Correct 17 ms 1744 KB Output is correct
97 Correct 18 ms 1744 KB Output is correct