oj.uz

답안 #1062355

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1062355 2024-08-17T03:50:22 Z ArthuroWich 커다란 상품 (IOI17_prize) C++17
90 / 100
 73 ms 11364 KB 
#include"prize.h"
#include<bits/stdc++.h>
using namespace std;
int ans = -1;
bool check(vector<int> res) {
    return (res[0] == res[1] && res[0] == 0);
}
int give() {
    srand(time(NULL));
    return rand() % 2;
}
vector<vector<int>> seg(200005, {-1, -1});
void calc(int l, int r, bool f) {
    if (l == r || ans != -1) {
        return;
    }
    int m = (l+r)/2;
    if (f) {
        if (seg[l][0] == -1) {
            seg[l] = ask(l);
        }
        if (check(seg[l])) {
            ans = l;
            return;
        }
        if (seg[m][0] == -1) {
            seg[m] = ask(m);
        }
        if (check(seg[m])) {
            ans = m;
            return;
        }
        if (seg[l] != seg[m] || seg[m][0]-seg[l][0] != 0) {
            calc(l, m, give());
        }
        if (ans != -1) {
            return;
        }
        if (seg[m+1][0] == -1) {
            seg[m+1] = ask(m+1);
        }
        if (check(seg[m+1])) {
            ans = m+1;
            return;
        }
        if (seg[r][0] == -1) {
            seg[r] = ask(r);
        }
        if (check(seg[r])) {
            ans = r;
            return;
        }
        if (seg[m+1] != seg[r] || seg[r][0]-seg[m+1][0] != 0) {
            calc(m+1, r, give());
        }
    } else {
        if (seg[m+1][0] == -1) {
            seg[m+1] = ask(m+1);
        }
        if (check(seg[m+1])) {
            ans = m+1;
            return;
        }
        if (seg[r][0] == -1) {
            seg[r] = ask(r);
        }
        if (check(seg[r])) {
            ans = r;
            return;
        }
        if (seg[m+1] != seg[r] || seg[r][0]-seg[m+1][0] != 0) {
            calc(m+1, r, give());
        }
        if (ans != -1) {
            return;
        }
        if (seg[l][0] == -1) {
            seg[l] = ask(l);
        }
        if (check(seg[l])) {
            ans = l;
            return;
        }
        if (seg[m][0] == -1) {
            seg[m] = ask(m);
        }
        if (check(seg[m])) {
            ans = m;
            return;
        }
        if (seg[l] != seg[m] || seg[m][0]-seg[l][0] != 0) {
            calc(l, m, give());
        }
    }
}
int find_best(int n) {
    calc(0, n-1, give());
    return ans;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
70.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 11352 KB Output is correct
2 Correct 9 ms 11352 KB Output is correct
3 Correct 8 ms 11352 KB Output is correct
4 Correct 8 ms 11352 KB Output is correct
5 Correct 8 ms 11352 KB Output is correct
6 Correct 9 ms 11352 KB Output is correct
7 Correct 8 ms 11352 KB Output is correct
8 Correct 13 ms 11352 KB Output is correct
9 Correct 10 ms 11352 KB Output is correct
10 Correct 9 ms 11352 KB Output is correct
11 Correct 10 ms 11352 KB Output is correct
12 Correct 12 ms 11352 KB Output is correct
13 Correct 8 ms 11352 KB Output is correct
14 Correct 16 ms 11352 KB Output is correct
15 Partially correct 51 ms 11292 KB Partially correct - number of queries: 6632
16 Partially correct 53 ms 11352 KB Partially correct - number of queries: 6733
17 Correct 8 ms 11352 KB Output is correct
18 Partially correct 68 ms 11352 KB Partially correct - number of queries: 8132
19 Correct 8 ms 11352 KB Output is correct
20 Correct 25 ms 11352 KB Output is correct
21 Partially correct 35 ms 11352 KB Partially correct - number of queries: 5135
22 Partially correct 49 ms 11352 KB Partially correct - number of queries: 5670
23 Correct 9 ms 11352 KB Output is correct
24 Correct 15 ms 11352 KB Output is correct
25 Correct 24 ms 11352 KB Output is correct
26 Correct 32 ms 11352 KB Output is correct
27 Correct 9 ms 11352 KB Output is correct
28 Correct 10 ms 11352 KB Output is correct
29 Correct 11 ms 11352 KB Output is correct
30 Correct 7 ms 11352 KB Output is correct
31 Partially correct 61 ms 11352 KB Partially correct - number of queries: 8076
32 Correct 12 ms 11348 KB Output is correct
33 Correct 8 ms 11352 KB Output is correct
34 Partially correct 45 ms 11352 KB Partially correct - number of queries: 5672
35 Correct 8 ms 11352 KB Output is correct
36 Partially correct 50 ms 11352 KB Partially correct - number of queries: 6293
37 Correct 9 ms 11352 KB Output is correct
38 Correct 8 ms 11352 KB Output is correct
39 Correct 26 ms 11352 KB Output is correct
40 Partially correct 54 ms 11352 KB Partially correct - number of queries: 7041
41 Correct 46 ms 11352 KB Output is correct
42 Correct 32 ms 11352 KB Output is correct
43 Correct 30 ms 11352 KB Output is correct
44 Correct 26 ms 11352 KB Output is correct
45 Correct 21 ms 11352 KB Output is correct
46 Correct 7 ms 11352 KB Output is correct
47 Correct 27 ms 11352 KB Output is correct
48 Partially correct 39 ms 11352 KB Partially correct - number of queries: 5788
49 Correct 11 ms 11352 KB Output is correct
50 Partially correct 65 ms 11352 KB Partially correct - number of queries: 8123
51 Correct 24 ms 11364 KB Output is correct
52 Correct 9 ms 11352 KB Output is correct
53 Correct 8 ms 11352 KB Output is correct
54 Correct 39 ms 11352 KB Output is correct
55 Partially correct 51 ms 11352 KB Partially correct - number of queries: 8129
56 Correct 11 ms 11352 KB Output is correct
57 Correct 20 ms 11352 KB Output is correct
58 Partially correct 42 ms 11348 KB Partially correct - number of queries: 5802
59 Correct 31 ms 11352 KB Output is correct
60 Correct 36 ms 11352 KB Output is correct
61 Correct 10 ms 11352 KB Output is correct
62 Correct 8 ms 11352 KB Output is correct
63 Correct 8 ms 11352 KB Output is correct
64 Correct 10 ms 11352 KB Output is correct
65 Correct 9 ms 11352 KB Output is correct
66 Correct 8 ms 11352 KB Output is correct
67 Correct 7 ms 11352 KB Output is correct
68 Correct 8 ms 11352 KB Output is correct
69 Correct 9 ms 11352 KB Output is correct
70 Correct 8 ms 11352 KB Output is correct
71 Partially correct 62 ms 11352 KB Partially correct - number of queries: 8576
72 Correct 12 ms 11352 KB Output is correct
73 Partially correct 56 ms 11352 KB Partially correct - number of queries: 8464
74 Partially correct 72 ms 11352 KB Partially correct - number of queries: 8055
75 Correct 9 ms 11352 KB Output is correct
76 Partially correct 58 ms 11352 KB Partially correct - number of queries: 7024
77 Partially correct 66 ms 11352 KB Partially correct - number of queries: 8114
78 Correct 13 ms 11352 KB Output is correct
79 Correct 33 ms 11352 KB Output is correct
80 Partially correct 68 ms 11352 KB Partially correct - number of queries: 8111
81 Partially correct 68 ms 11352 KB Partially correct - number of queries: 8110
82 Partially correct 73 ms 11352 KB Partially correct - number of queries: 8048
83 Correct 9 ms 11348 KB Output is correct
84 Partially correct 59 ms 11352 KB Partially correct - number of queries: 6791
85 Partially correct 62 ms 11352 KB Partially correct - number of queries: 8113
86 Correct 19 ms 11352 KB Output is correct
87 Correct 10 ms 11352 KB Output is correct
88 Correct 12 ms 11352 KB Output is correct
89 Correct 13 ms 11352 KB Output is correct
90 Correct 9 ms 11352 KB Output is correct
91 Correct 11 ms 11352 KB Output is correct
92 Correct 8 ms 11352 KB Output is correct
93 Correct 11 ms 11352 KB Output is correct
94 Correct 13 ms 11352 KB Output is correct
95 Correct 12 ms 11352 KB Output is correct
96 Correct 14 ms 11352 KB Output is correct
97 Correct 10 ms 11352 KB Output is correct