oj.uz

답안 #1063157

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1063157 2024-08-17T14:43:53 Z ArthuroWich 커다란 상품 (IOI17_prize) C++17
20 / 100
 66 ms 11352 KB 
#include"prize.h"
#include<bits/stdc++.h>
using namespace std;
vector<vector<int>> seg(200005, {-1, -1});
int ans = -1, mx = 0;
void check(int i) {
    if (seg[i][0] == seg[i][1] && seg[i][0] == 0) {
        ans = i;
    }
}
void Ask(int i) {
    if (seg[i][0] == -1) {
        seg[i] = ask(i);
        mx = max(mx, seg[i][0]+seg[i][1]);
        check(i);
    }
}
void calc(int l, int r, int xl, int xr) {
    if (ans != -1) {
        return;
    }
    if (l == r) {
        ask(l);
        return;
    }
    if (xl+xr >= mx) {
        return;
    }
    int m1 = (l+r)/2, m2 = (l+r)/2;
    Ask(l);
    for (; m1 > l; m1--) {
        Ask(m1);
        if (ans != -1) {
            return;
        }
        if (seg[m1][0]+seg[m1][1] == mx) {
            break;
        }
    }
    calc(l, m1, xl, seg[m1][1]);
    if (ans != -1) {
        return;
    }
    Ask(r);
    for (; m2 < r; m2++) {
        Ask(m2);
        if (ans != -1) {
            return;
        }
        if (seg[m2][0]+seg[m2][1] == mx) {
            break;
        }
    }
    calc(m2, r, seg[m2][0], xr);
}
int find_best(int n) {
    for (int i = 0; i < min(n, 250); i++) {
        Ask(i);
    }
    calc(0, n-1, 0, 0);
    return ans;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 11352 KB Output is correct
2 Correct 10 ms 11348 KB Output is correct
3 Correct 9 ms 11352 KB Output is correct
4 Correct 9 ms 11352 KB Output is correct
5 Correct 10 ms 11352 KB Output is correct
6 Correct 12 ms 11352 KB Output is correct
7 Correct 10 ms 11352 KB Output is correct
8 Correct 9 ms 11352 KB Output is correct
9 Correct 12 ms 11352 KB Output is correct
10 Correct 12 ms 11352 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 11352 KB Output is correct
2 Correct 11 ms 11272 KB Output is correct
3 Correct 16 ms 11352 KB Output is correct
4 Correct 11 ms 11352 KB Output is correct
5 Correct 10 ms 11352 KB Output is correct
6 Correct 9 ms 11352 KB Output is correct
7 Correct 10 ms 11352 KB Output is correct
8 Correct 10 ms 11352 KB Output is correct
9 Correct 9 ms 11352 KB Output is correct
10 Correct 12 ms 11152 KB Output is correct
11 Correct 13 ms 11352 KB Output is correct
12 Correct 10 ms 11352 KB Output is correct
13 Correct 10 ms 11352 KB Output is correct
14 Correct 11 ms 11352 KB Output is correct
15 Correct 16 ms 11352 KB Output is correct
16 Correct 27 ms 11352 KB Output is correct
17 Correct 9 ms 11352 KB Output is correct
18 Partially correct 36 ms 11352 KB Partially correct - number of queries: 5353
19 Correct 10 ms 11352 KB Output is correct
20 Correct 16 ms 11352 KB Output is correct
21 Correct 18 ms 11352 KB Output is correct
22 Correct 11 ms 11352 KB Output is correct
23 Correct 9 ms 11352 KB Output is correct
24 Correct 10 ms 11352 KB Output is correct
25 Correct 17 ms 11352 KB Output is correct
26 Correct 26 ms 11352 KB Output is correct
27 Correct 14 ms 11352 KB Output is correct
28 Correct 35 ms 11352 KB Output is correct
29 Correct 25 ms 11352 KB Output is correct
30 Partially correct 38 ms 11352 KB Partially correct - number of queries: 5323
31 Correct 10 ms 11352 KB Output is correct
32 Correct 15 ms 11352 KB Output is correct
33 Correct 11 ms 11352 KB Output is correct
34 Correct 16 ms 11320 KB Output is correct
35 Correct 10 ms 11352 KB Output is correct
36 Correct 12 ms 11352 KB Output is correct
37 Correct 12 ms 11352 KB Output is correct
38 Correct 9 ms 11352 KB Output is correct
39 Correct 20 ms 11352 KB Output is correct
40 Correct 27 ms 11348 KB Output is correct
41 Correct 18 ms 11352 KB Output is correct
42 Correct 20 ms 11352 KB Output is correct
43 Correct 25 ms 11352 KB Output is correct
44 Correct 17 ms 11352 KB Output is correct
45 Correct 16 ms 11352 KB Output is correct
46 Correct 11 ms 11352 KB Output is correct
47 Correct 25 ms 11352 KB Output is correct
48 Correct 31 ms 11352 KB Output is correct
49 Correct 11 ms 11352 KB Output is correct
50 Partially correct 33 ms 11352 KB Partially correct - number of queries: 5347
51 Correct 22 ms 11352 KB Output is correct
52 Correct 9 ms 11352 KB Output is correct
53 Correct 11 ms 11352 KB Output is correct
54 Correct 20 ms 11352 KB Output is correct
55 Correct 10 ms 11352 KB Output is correct
56 Partially correct 38 ms 11352 KB Partially correct - number of queries: 5340
57 Correct 33 ms 11352 KB Output is correct
58 Correct 29 ms 11352 KB Output is correct
59 Correct 20 ms 11352 KB Output is correct
60 Correct 17 ms 11352 KB Output is correct
61 Correct 12 ms 11352 KB Output is correct
62 Correct 9 ms 11352 KB Output is correct
63 Correct 11 ms 11352 KB Output is correct
64 Correct 9 ms 11352 KB Output is correct
65 Correct 12 ms 11352 KB Output is correct
66 Correct 12 ms 11352 KB Output is correct
67 Correct 14 ms 11352 KB Output is correct
68 Correct 11 ms 11352 KB Output is correct
69 Correct 12 ms 11352 KB Output is correct
70 Correct 14 ms 11352 KB Output is correct
71 Partially correct 38 ms 11352 KB Partially correct - number of queries: 5952
72 Correct 12 ms 11352 KB Output is correct
73 Partially correct 31 ms 11352 KB Partially correct - number of queries: 5875
74 Partially correct 34 ms 11352 KB Partially correct - number of queries: 5908
75 Correct 9 ms 11352 KB Output is correct
76 Partially correct 38 ms 11352 KB Partially correct - number of queries: 5160
77 Partially correct 33 ms 11352 KB Partially correct - number of queries: 5450
78 Correct 10 ms 11352 KB Output is correct
79 Correct 18 ms 11352 KB Output is correct
80 Partially correct 36 ms 11352 KB Partially correct - number of queries: 5434
81 Partially correct 38 ms 11352 KB Partially correct - number of queries: 5393
82 Partially correct 30 ms 11352 KB Partially correct - number of queries: 5350
83 Correct 12 ms 11352 KB Output is correct
84 Correct 26 ms 11352 KB Output is correct
85 Partially correct 28 ms 11352 KB Partially correct - number of queries: 5415
86 Incorrect 66 ms 11352 KB Incorrect
87 Halted 0 ms 0 KB -