oj.uz

답안 #112262

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
112262 2019-05-18T07:52:40 Z someone_aa 커다란 상품 (IOI17_prize) C++17
100 / 100
 47 ms 2212 KB 
#include "prize.h"
#include <bits/stdc++.h>
#define P pair<int,int>
using namespace std;
const int maxn = 200100;
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);

    int suml = ql.first + ql.second;
    int sumr = qr.first + qr.second;

    if(suml == 0) {
        ind = l;
        return;
    }

    if(sumr == 0) {
        ind = r;
        return;
    }

    if(ql.second == 0 || qr.first == 0) return;

    if(l == r) return;

    if(suml != max_sum) {
        solve(l+1, r);
        return;
    }

    if(sumr != 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, r);
}

int find_best(int n) {
    ind = -1;

    int b = sqrt(n) + 1;
    b = min(n, b);

    mt19937 g(chrono::high_resolution_clock::now().time_since_epoch().count());
    uniform_int_distribution<int> uid(0, n - 1);

    for(int i=0;i-b<n;i+=b) {
        int x = min(i, n-1);
        if(sum(x) == 0) return x;
        max_sum = max(max_sum, sum(x));
    } //max_sum = 1;

    /*for(int i=0;i<100;i++) {
        int pos = uid(g);
        if(sum(pos) == 0) return pos;
        max_sum = max(max_sum, sum(pos));
    }*/

    int l = 0, r = b;
    while(l < n) {
        solve(l, r);
        l += b; r += b;
        if(r >= n) r = n - 1;
    }
    return ind;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2064 KB Output is correct
2 Correct 4 ms 2060 KB Output is correct
3 Correct 4 ms 2036 KB Output is correct
4 Correct 6 ms 2040 KB Output is correct
5 Correct 5 ms 2172 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 8 ms 2040 KB Output is correct
8 Correct 4 ms 2044 KB Output is correct
9 Correct 7 ms 2040 KB Output is correct
10 Correct 9 ms 2048 KB Output is correct

Subtask #2
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1980 KB Output is correct
2 Correct 4 ms 2044 KB Output is correct
3 Correct 7 ms 1988 KB Output is correct
4 Correct 8 ms 2048 KB Output is correct
5 Correct 6 ms 2040 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 5 ms 1972 KB Output is correct
8 Correct 9 ms 2048 KB Output is correct
9 Correct 9 ms 2048 KB Output is correct
10 Correct 9 ms 2048 KB Output is correct
11 Correct 8 ms 2040 KB Output is correct
12 Correct 5 ms 2164 KB Output is correct
13 Correct 10 ms 2040 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 6 ms 2060 KB Output is correct
16 Correct 31 ms 2040 KB Output is correct
17 Correct 7 ms 2040 KB Output is correct
18 Correct 18 ms 2036 KB Output is correct
19 Correct 6 ms 2068 KB Output is correct
20 Correct 11 ms 1152 KB Output is correct
21 Correct 14 ms 2048 KB Output is correct
22 Correct 8 ms 2060 KB Output is correct
23 Correct 8 ms 2040 KB Output is correct
24 Correct 7 ms 2056 KB Output is correct
25 Correct 30 ms 2040 KB Output is correct
26 Correct 28 ms 2048 KB Output is correct
27 Correct 5 ms 2044 KB Output is correct
28 Correct 43 ms 2048 KB Output is correct
29 Correct 14 ms 2036 KB Output is correct
30 Correct 33 ms 2040 KB Output is correct
31 Correct 7 ms 2040 KB Output is correct
32 Correct 10 ms 2040 KB Output is correct
33 Correct 2 ms 336 KB Output is correct
34 Correct 8 ms 2044 KB Output is correct
35 Correct 6 ms 2040 KB Output is correct
36 Correct 12 ms 1960 KB Output is correct
37 Correct 5 ms 1976 KB Output is correct
38 Correct 5 ms 2168 KB Output is correct
39 Correct 16 ms 2040 KB Output is correct
40 Correct 40 ms 1960 KB Output is correct
41 Correct 22 ms 2040 KB Output is correct
42 Correct 17 ms 2040 KB Output is correct
43 Correct 25 ms 2040 KB Output is correct
44 Correct 9 ms 2036 KB Output is correct
45 Correct 9 ms 2040 KB Output is correct
46 Correct 7 ms 2040 KB Output is correct
47 Correct 14 ms 2040 KB Output is correct
48 Correct 33 ms 2048 KB Output is correct
49 Correct 7 ms 2044 KB Output is correct
50 Correct 28 ms 2040 KB Output is correct
51 Correct 18 ms 2040 KB Output is correct
52 Correct 8 ms 2040 KB Output is correct
53 Correct 5 ms 2036 KB Output is correct
54 Correct 21 ms 2040 KB Output is correct
55 Correct 7 ms 1956 KB Output is correct
56 Correct 39 ms 2060 KB Output is correct
57 Correct 13 ms 2036 KB Output is correct
58 Correct 22 ms 1980 KB Output is correct
59 Correct 18 ms 2040 KB Output is correct
60 Correct 26 ms 2040 KB Output is correct
61 Correct 5 ms 1980 KB Output is correct
62 Correct 5 ms 2164 KB Output is correct
63 Correct 4 ms 2036 KB Output is correct
64 Correct 8 ms 2040 KB Output is correct
65 Correct 5 ms 2212 KB Output is correct
66 Correct 5 ms 2036 KB Output is correct
67 Correct 9 ms 2040 KB Output is correct
68 Correct 10 ms 2048 KB Output is correct
69 Correct 12 ms 2040 KB Output is correct
70 Correct 4 ms 2056 KB Output is correct
71 Correct 37 ms 2048 KB Output is correct
72 Correct 9 ms 2048 KB Output is correct
73 Correct 28 ms 2048 KB Output is correct
74 Correct 47 ms 2048 KB Output is correct
75 Correct 9 ms 2048 KB Output is correct
76 Correct 35 ms 2048 KB Output is correct
77 Correct 35 ms 2048 KB Output is correct
78 Correct 13 ms 1968 KB Output is correct
79 Correct 16 ms 2176 KB Output is correct
80 Correct 30 ms 2040 KB Output is correct
81 Correct 18 ms 2080 KB Output is correct
82 Correct 38 ms 2060 KB Output is correct
83 Correct 5 ms 2084 KB Output is correct
84 Correct 16 ms 2188 KB Output is correct
85 Correct 25 ms 2040 KB Output is correct
86 Correct 7 ms 2040 KB Output is correct
87 Correct 6 ms 2048 KB Output is correct
88 Correct 7 ms 2168 KB Output is correct
89 Correct 6 ms 2040 KB Output is correct
90 Correct 4 ms 1992 KB Output is correct
91 Correct 8 ms 2052 KB Output is correct
92 Correct 7 ms 2048 KB Output is correct
93 Correct 17 ms 2048 KB Output is correct
94 Correct 12 ms 2048 KB Output is correct
95 Correct 13 ms 2048 KB Output is correct
96 Correct 8 ms 2084 KB Output is correct
97 Correct 9 ms 2048 KB Output is correct