oj.uz

답안 #348341

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
348341 2021-01-14T17:01:10 Z Hideo 커다란 상품 (IOI17_prize) C++17
100 / 100
 74 ms 11372 KB 
#include <bits/stdc++.h>
//#include "grader.cpp"
#include "prize.h"

using namespace std;

#define ll long long
#define mk make_pair

const int N = 2e5 + 7;

vector < int > a[N];
int mx, ans = -1;
int cnt;
int period = 500;

void divide (int l, int r){
    if (a[l][0] == -1)
        a[l] = ask(l);
    if (a[l][0] + a[l][1] == 0){
        ans = l;
        return;
    }
    if (a[r][0] == -1)
        a[r] = ask(r);
    if (a[r][0] + a[r][1] == 0){
        ans = r;
        return;
    }
    if (l + 1 >= r)
        return;
    if (a[l][0] + a[l][1] < mx){
        divide(l + 1, r);
        return;
    }
    if (a[r][0] + a[r][1] < mx){
        divide(l, r - 1);
        return;
    }
    int mid = (l + r) >> 1;
    if (a[mid][0] == -1)
        a[mid] = ask(mid);
    if (a[mid][0] + a[mid][1] == 0){
        ans = mid;
        return;
    }
    if (a[mid][0] + a[mid][1] < mx){
        divide(l, mid - 1);
        divide(mid + 1, r);
        return;
    }
    if (a[mid][1] - a[r][1])
        divide(mid, r);
    if (ans != -1)
        return;
    if (a[l][1] - a[mid][1])
        divide(l, mid);
}

void calc (int l, int r){
    if (a[l][0] + a[l][1] == 0){
        ans = l;
        return;
    }
    while (l < r && a[l][0] + a[l][1] < mx){
        l++;
        if (a[l][0] == -1)
            a[l] = ask(l);
        if (a[l][0] + a[l][1] == 0){
            ans = l;
            return;
        }
    }
    if (a[r][0] + a[r][1] == 0){
        ans = r;
        return;
    }
    while (l < r && a[r][0] + a[r][1] < mx){
        r--;
        if (a[r][0] == -1)
            a[r] = ask(r);
        if (a[r][0] + a[r][1] == 0){
            ans = r;
            return;
        }
    }
    if (l == r)
        return;
    if (a[l][1] - a[r][1])
        divide(l, r);
}

int find_best (int n){
    for (int i = 0; i < n; i++){
        a[i].resize(2);
        a[i][0] = a[i][1] = -1;
    }
    for (int i = 0; i < n; i += period){
        a[i] = ask(i);
        mx = max(mx, a[i][0] + a[i][1]);
        if (a[i][0] + a[i][1] == 0)
            return i;
    }
    a[n - 1] = ask(n - 1);
    mx = max(mx, a[n - 1][0] + a[n - 1][1]);
    if (a[n - 1][0] + a[n - 1][1] == 0)
        return n - 1;
    for (int i = 0; i < n; i += period){
        calc(i, min(n - 1, i + period));
        if (ans != -1)
            break;
    }
    //cout << ans << endl;
	return ans;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 11244 KB Output is correct
2 Correct 19 ms 11244 KB Output is correct
3 Correct 17 ms 11244 KB Output is correct
4 Correct 17 ms 11244 KB Output is correct
5 Correct 19 ms 11244 KB Output is correct
6 Correct 15 ms 11244 KB Output is correct
7 Correct 17 ms 11244 KB Output is correct
8 Correct 17 ms 11244 KB Output is correct
9 Correct 24 ms 11244 KB Output is correct
10 Correct 18 ms 11244 KB Output is correct

Subtask #2
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 11244 KB Output is correct
2 Correct 21 ms 11268 KB Output is correct
3 Correct 17 ms 11244 KB Output is correct
4 Correct 19 ms 11244 KB Output is correct
5 Correct 17 ms 11244 KB Output is correct
6 Correct 15 ms 11244 KB Output is correct
7 Correct 19 ms 11372 KB Output is correct
8 Correct 19 ms 11244 KB Output is correct
9 Correct 20 ms 11244 KB Output is correct
10 Correct 20 ms 11244 KB Output is correct
11 Correct 22 ms 11268 KB Output is correct
12 Correct 20 ms 11244 KB Output is correct
13 Correct 21 ms 11244 KB Output is correct
14 Correct 8 ms 5612 KB Output is correct
15 Correct 28 ms 11244 KB Output is correct
16 Correct 64 ms 11244 KB Output is correct
17 Correct 19 ms 11244 KB Output is correct
18 Correct 46 ms 11244 KB Output is correct
19 Correct 18 ms 11244 KB Output is correct
20 Correct 25 ms 8172 KB Output is correct
21 Correct 27 ms 11244 KB Output is correct
22 Correct 25 ms 11244 KB Output is correct
23 Correct 19 ms 11244 KB Output is correct
24 Correct 22 ms 11244 KB Output is correct
25 Correct 39 ms 11244 KB Output is correct
26 Correct 39 ms 11244 KB Output is correct
27 Correct 21 ms 11244 KB Output is correct
28 Correct 51 ms 11244 KB Output is correct
29 Correct 42 ms 11244 KB Output is correct
30 Correct 59 ms 11244 KB Output is correct
31 Correct 21 ms 11372 KB Output is correct
32 Correct 20 ms 11244 KB Output is correct
33 Correct 4 ms 4972 KB Output is correct
34 Correct 36 ms 11244 KB Output is correct
35 Correct 22 ms 11244 KB Output is correct
36 Correct 32 ms 11244 KB Output is correct
37 Correct 20 ms 11244 KB Output is correct
38 Correct 19 ms 11244 KB Output is correct
39 Correct 41 ms 11372 KB Output is correct
40 Correct 53 ms 11244 KB Output is correct
41 Correct 51 ms 11244 KB Output is correct
42 Correct 45 ms 11244 KB Output is correct
43 Correct 38 ms 11244 KB Output is correct
44 Correct 49 ms 11372 KB Output is correct
45 Correct 36 ms 11244 KB Output is correct
46 Correct 20 ms 11244 KB Output is correct
47 Correct 36 ms 11244 KB Output is correct
48 Correct 46 ms 11244 KB Output is correct
49 Correct 25 ms 11244 KB Output is correct
50 Correct 71 ms 11244 KB Output is correct
51 Correct 42 ms 11244 KB Output is correct
52 Correct 19 ms 11244 KB Output is correct
53 Correct 22 ms 11244 KB Output is correct
54 Correct 34 ms 11244 KB Output is correct
55 Correct 22 ms 11244 KB Output is correct
56 Correct 53 ms 11244 KB Output is correct
57 Correct 41 ms 11244 KB Output is correct
58 Correct 45 ms 11244 KB Output is correct
59 Correct 51 ms 11244 KB Output is correct
60 Correct 38 ms 11244 KB Output is correct
61 Correct 21 ms 11244 KB Output is correct
62 Correct 20 ms 11244 KB Output is correct
63 Correct 21 ms 11244 KB Output is correct
64 Correct 21 ms 11244 KB Output is correct
65 Correct 23 ms 11244 KB Output is correct
66 Correct 18 ms 11244 KB Output is correct
67 Correct 23 ms 11244 KB Output is correct
68 Correct 23 ms 11244 KB Output is correct
69 Correct 21 ms 11244 KB Output is correct
70 Correct 20 ms 11212 KB Output is correct
71 Correct 53 ms 11244 KB Output is correct
72 Correct 22 ms 11244 KB Output is correct
73 Correct 74 ms 11244 KB Output is correct
74 Correct 68 ms 11244 KB Output is correct
75 Correct 20 ms 11244 KB Output is correct
76 Correct 49 ms 11244 KB Output is correct
77 Correct 52 ms 11244 KB Output is correct
78 Correct 22 ms 11244 KB Output is correct
79 Correct 46 ms 11244 KB Output is correct
80 Correct 52 ms 11244 KB Output is correct
81 Correct 56 ms 11244 KB Output is correct
82 Correct 60 ms 11244 KB Output is correct
83 Correct 21 ms 11244 KB Output is correct
84 Correct 58 ms 11372 KB Output is correct
85 Correct 61 ms 11244 KB Output is correct
86 Correct 23 ms 11244 KB Output is correct
87 Correct 19 ms 11244 KB Output is correct
88 Correct 29 ms 11244 KB Output is correct
89 Correct 23 ms 11244 KB Output is correct
90 Correct 19 ms 11244 KB Output is correct
91 Correct 27 ms 11244 KB Output is correct
92 Correct 22 ms 11244 KB Output is correct
93 Correct 23 ms 11244 KB Output is correct
94 Correct 23 ms 11244 KB Output is correct
95 Correct 23 ms 11244 KB Output is correct
96 Correct 22 ms 11244 KB Output is correct
97 Correct 20 ms 11244 KB Output is correct