oj.uz

답안 #728122

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
728122 2023-04-22T02:56:30 Z nguyentunglam 커다란 상품 (IOI17_prize) C++17
100 / 100
 71 ms 5308 KB 
#include<bits/stdc++.h>
using namespace std;
#include "prize.h"
//mt19937 rng(172831923);
////mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//int rnd(int l, int r) {
//    return l + rng() % (r - l + 1);
//}

const int N = 2e5 + 10;
vector<int> ans[N];
int worst;
int check(int i, int j) {
    if (ans[i].empty()) ans[i] = ask(i); if (ans[j].empty()) ans[j] = ask(j);
    if (ans[j][0] + ans[j][1] != worst) return 2;
    int tmp = ans[i][1] + ans[j][0] - worst;
    return tmp > 0;
}

int find_best(int n) {

    int T = max(1, n / 785);
    for(int i = 0; i < n; i += T) {
        ans[i] = ask(i);
        worst = max(worst, ans[i][0] + ans[i][1]);
    }

    for(int i = 1; i < n; i++) if (i % T) {
        if (ans[i].empty()) ans[i] = ask(i);
        if (ans[i][0] + ans[i][1] != worst) continue;
        int l = i, r = n - 1;
        for(int j = T; j < n; j += T) if (j > i) {
            if (check(i, j)) {
                r = j;
                break;
            }
            l = j;
        }

        int last = l;
        while (l <= r) {
            int mid = l + r >> 1;
            int tmp = check(i, mid);
            if (!tmp) {
                last = mid;
                l = mid + 1;
            }
            else r = mid - 1;
        }
//        cout << i << " " << last << endl;
        i = last;
    }

    for(int i = 0; i < n; i++) if (!ans[i].empty() && ans[i][0] + ans[i][1] == 0) {
        return i;
    }
    return 0;
}

Compilation message

prize.cpp: In function 'int check(int, int)':
prize.cpp:14:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   14 |     if (ans[i].empty()) ans[i] = ask(i); if (ans[j].empty()) ans[j] = ask(j);
      |     ^~
prize.cpp:14:42: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   14 |     if (ans[i].empty()) ans[i] = ask(i); if (ans[j].empty()) ans[j] = ask(j);
      |                                          ^~
prize.cpp: In function 'int find_best(int)':
prize.cpp:42:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   42 |             int mid = l + r >> 1;
      |                       ~~^~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 4996 KB Output is correct
2 Correct 12 ms 4944 KB Output is correct
3 Correct 6 ms 5008 KB Output is correct
4 Correct 6 ms 5012 KB Output is correct
5 Correct 11 ms 4944 KB Output is correct
6 Correct 11 ms 5116 KB Output is correct
7 Correct 11 ms 5012 KB Output is correct
8 Correct 8 ms 4944 KB Output is correct
9 Correct 6 ms 4996 KB Output is correct
10 Correct 9 ms 5012 KB Output is correct

Subtask #2
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 4944 KB Output is correct
2 Correct 10 ms 4944 KB Output is correct
3 Correct 11 ms 4980 KB Output is correct
4 Correct 6 ms 4992 KB Output is correct
5 Correct 10 ms 5008 KB Output is correct
6 Correct 12 ms 4944 KB Output is correct
7 Correct 10 ms 4980 KB Output is correct
8 Correct 9 ms 4944 KB Output is correct
9 Correct 11 ms 4992 KB Output is correct
10 Correct 7 ms 5008 KB Output is correct
11 Correct 13 ms 4944 KB Output is correct
12 Correct 7 ms 5072 KB Output is correct
13 Correct 8 ms 5104 KB Output is correct
14 Correct 19 ms 4944 KB Output is correct
15 Correct 46 ms 5244 KB Output is correct
16 Correct 23 ms 5136 KB Output is correct
17 Correct 37 ms 5116 KB Output is correct
18 Correct 43 ms 5112 KB Output is correct
19 Correct 38 ms 5064 KB Output is correct
20 Correct 23 ms 5308 KB Output is correct
21 Correct 31 ms 5064 KB Output is correct
22 Correct 35 ms 5064 KB Output is correct
23 Correct 11 ms 5004 KB Output is correct
24 Correct 12 ms 4944 KB Output is correct
25 Correct 42 ms 5104 KB Output is correct
26 Correct 42 ms 5112 KB Output is correct
27 Correct 8 ms 4988 KB Output is correct
28 Correct 42 ms 5148 KB Output is correct
29 Correct 30 ms 5104 KB Output is correct
30 Correct 49 ms 5120 KB Output is correct
31 Correct 45 ms 5128 KB Output is correct
32 Correct 13 ms 5072 KB Output is correct
33 Correct 4 ms 5004 KB Output is correct
34 Correct 52 ms 5096 KB Output is correct
35 Correct 9 ms 4992 KB Output is correct
36 Correct 41 ms 5000 KB Output is correct
37 Correct 13 ms 4984 KB Output is correct
38 Correct 11 ms 4944 KB Output is correct
39 Correct 32 ms 5112 KB Output is correct
40 Correct 36 ms 5164 KB Output is correct
41 Correct 24 ms 5216 KB Output is correct
42 Correct 51 ms 4996 KB Output is correct
43 Correct 42 ms 5112 KB Output is correct
44 Correct 40 ms 5124 KB Output is correct
45 Correct 37 ms 5112 KB Output is correct
46 Correct 36 ms 5124 KB Output is correct
47 Correct 44 ms 5108 KB Output is correct
48 Correct 33 ms 5116 KB Output is correct
49 Correct 41 ms 5112 KB Output is correct
50 Correct 43 ms 5108 KB Output is correct
51 Correct 71 ms 5128 KB Output is correct
52 Correct 44 ms 5112 KB Output is correct
53 Correct 9 ms 4992 KB Output is correct
54 Correct 47 ms 5072 KB Output is correct
55 Correct 49 ms 5092 KB Output is correct
56 Correct 30 ms 5120 KB Output is correct
57 Correct 38 ms 5164 KB Output is correct
58 Correct 31 ms 5120 KB Output is correct
59 Correct 25 ms 5120 KB Output is correct
60 Correct 54 ms 5108 KB Output is correct
61 Correct 10 ms 4944 KB Output is correct
62 Correct 13 ms 5004 KB Output is correct
63 Correct 10 ms 4996 KB Output is correct
64 Correct 11 ms 4944 KB Output is correct
65 Correct 12 ms 4968 KB Output is correct
66 Correct 18 ms 5012 KB Output is correct
67 Correct 8 ms 4984 KB Output is correct
68 Correct 17 ms 5008 KB Output is correct
69 Correct 16 ms 4988 KB Output is correct
70 Correct 15 ms 4944 KB Output is correct
71 Correct 37 ms 5116 KB Output is correct
72 Correct 12 ms 5012 KB Output is correct
73 Correct 47 ms 5168 KB Output is correct
74 Correct 51 ms 5028 KB Output is correct
75 Correct 8 ms 5000 KB Output is correct
76 Correct 33 ms 5092 KB Output is correct
77 Correct 43 ms 5024 KB Output is correct
78 Correct 13 ms 4944 KB Output is correct
79 Correct 28 ms 5024 KB Output is correct
80 Correct 32 ms 5172 KB Output is correct
81 Correct 43 ms 5120 KB Output is correct
82 Correct 40 ms 5028 KB Output is correct
83 Correct 10 ms 4944 KB Output is correct
84 Correct 32 ms 5016 KB Output is correct
85 Correct 41 ms 5092 KB Output is correct
86 Correct 43 ms 5024 KB Output is correct
87 Correct 14 ms 5008 KB Output is correct
88 Correct 45 ms 5104 KB Output is correct
89 Correct 20 ms 5172 KB Output is correct
90 Correct 8 ms 5004 KB Output is correct
91 Correct 28 ms 5016 KB Output is correct
92 Correct 37 ms 5104 KB Output is correct
93 Correct 47 ms 5036 KB Output is correct
94 Correct 46 ms 5048 KB Output is correct
95 Correct 40 ms 5116 KB Output is correct
96 Correct 33 ms 5064 KB Output is correct
97 Correct 43 ms 5096 KB Output is correct