답안 #1030335

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1030335 2024-07-22T02:52:34 Z shiomusubi496 커다란 상품 (IOI17_prize) C++17
90 / 100
59 ms 5972 KB
#include "prize.h"

#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define rrep2(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); --i)

#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)

using namespace std;

using ll = long long;

template<class T, class U> bool chmin(T& a, const U& b) { return a > b ? a = b, true : false; }
template<class T, class U> bool chmax(T& a, const U& b) { return a < b ? a = b, true : false; }

vector<vector<int>> memo;
vector<int> Ask(int n) {
    if (memo[n].empty()) memo[n] = ask(n);
    return memo[n];
}

int find_best(int n) {
    memo.resize(n);
    int cnt = 0;
    rep (i, 500) {
        auto res = Ask(i);
        chmax(cnt, res[0] + res[1]);
        if (res[0] + res[1] == 0) return i;
    }
    int x = 500;
    while (x < n) {
        int y = 0;
        while (x < n) {
            auto res = Ask(x);
            if (res[0] + res[1] == 0) return x;
            if (res[0] + res[1] == cnt) {
                y = res[0];
                break;
            }
            ++x;
        }
        int ok = x, ng = n;
        while (ng - ok > 1) {
            int mid = (ok + ng) / 2;
            auto res = Ask(mid);
            if (res[0] + res[1] == 0) return mid;
            if (res[0] + res[1] < cnt) ng = mid;
            else if (res[0] > y) ng = mid;
            else ok = mid;
        }
        x = ok + 1;
    }
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:57:1: warning: control reaches end of non-void function [-Wreturn-type]
   57 | }
      | ^
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4952 KB Output is correct
2 Correct 4 ms 4952 KB Output is correct
3 Correct 4 ms 4952 KB Output is correct
4 Correct 4 ms 5148 KB Output is correct
5 Correct 5 ms 5208 KB Output is correct
6 Correct 3 ms 4952 KB Output is correct
7 Correct 4 ms 4952 KB Output is correct
8 Correct 6 ms 5144 KB Output is correct
9 Correct 5 ms 4952 KB Output is correct
10 Correct 5 ms 4952 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4948 KB Output is correct
2 Correct 4 ms 4952 KB Output is correct
3 Correct 5 ms 4952 KB Output is correct
4 Correct 6 ms 4952 KB Output is correct
5 Correct 6 ms 4952 KB Output is correct
6 Correct 3 ms 4952 KB Output is correct
7 Correct 5 ms 4952 KB Output is correct
8 Correct 4 ms 4952 KB Output is correct
9 Correct 5 ms 4952 KB Output is correct
10 Correct 6 ms 5208 KB Output is correct
11 Correct 6 ms 5164 KB Output is correct
12 Correct 5 ms 4952 KB Output is correct
13 Correct 7 ms 4952 KB Output is correct
14 Correct 4 ms 856 KB Output is correct
15 Correct 10 ms 5176 KB Output is correct
16 Partially correct 43 ms 5196 KB Partially correct - number of queries: 7230
17 Correct 5 ms 5208 KB Output is correct
18 Partially correct 56 ms 5516 KB Partially correct - number of queries: 8371
19 Correct 5 ms 4952 KB Output is correct
20 Correct 14 ms 2648 KB Output is correct
21 Correct 23 ms 5204 KB Output is correct
22 Correct 8 ms 4952 KB Output is correct
23 Correct 4 ms 4952 KB Output is correct
24 Correct 5 ms 4952 KB Output is correct
25 Correct 25 ms 5200 KB Output is correct
26 Correct 27 ms 5160 KB Output is correct
27 Correct 5 ms 4952 KB Output is correct
28 Partially correct 59 ms 5664 KB Partially correct - number of queries: 7910
29 Partially correct 31 ms 5160 KB Partially correct - number of queries: 6117
30 Partially correct 42 ms 5452 KB Partially correct - number of queries: 8324
31 Correct 5 ms 4952 KB Output is correct
32 Correct 7 ms 4952 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 18 ms 5208 KB Output is correct
35 Correct 6 ms 5148 KB Output is correct
36 Correct 14 ms 5392 KB Output is correct
37 Correct 6 ms 5208 KB Output is correct
38 Correct 5 ms 4952 KB Output is correct
39 Correct 25 ms 5496 KB Output is correct
40 Partially correct 55 ms 5160 KB Partially correct - number of queries: 7213
41 Partially correct 28 ms 5312 KB Partially correct - number of queries: 5208
42 Partially correct 30 ms 5516 KB Partially correct - number of queries: 5208
43 Correct 20 ms 5680 KB Output is correct
44 Correct 18 ms 5208 KB Output is correct
45 Correct 17 ms 5208 KB Output is correct
46 Correct 4 ms 4952 KB Output is correct
47 Correct 35 ms 5208 KB Output is correct
48 Partially correct 43 ms 5460 KB Partially correct - number of queries: 6335
49 Correct 7 ms 4952 KB Output is correct
50 Partially correct 59 ms 5516 KB Partially correct - number of queries: 8373
51 Correct 17 ms 5148 KB Output is correct
52 Correct 5 ms 4952 KB Output is correct
53 Correct 5 ms 4952 KB Output is correct
54 Correct 21 ms 5208 KB Output is correct
55 Correct 5 ms 4952 KB Output is correct
56 Partially correct 52 ms 5452 KB Partially correct - number of queries: 8373
57 Partially correct 34 ms 5260 KB Partially correct - number of queries: 6248
58 Partially correct 42 ms 5452 KB Partially correct - number of queries: 6321
59 Partially correct 17 ms 5208 KB Partially correct - number of queries: 5204
60 Correct 30 ms 5456 KB Output is correct
61 Correct 5 ms 4952 KB Output is correct
62 Correct 4 ms 4952 KB Output is correct
63 Correct 5 ms 4952 KB Output is correct
64 Correct 6 ms 4952 KB Output is correct
65 Correct 4 ms 4952 KB Output is correct
66 Correct 7 ms 5148 KB Output is correct
67 Correct 5 ms 4952 KB Output is correct
68 Correct 4 ms 4952 KB Output is correct
69 Correct 8 ms 4952 KB Output is correct
70 Correct 4 ms 4952 KB Output is correct
71 Partially correct 55 ms 5436 KB Partially correct - number of queries: 8239
72 Correct 6 ms 4952 KB Output is correct
73 Partially correct 39 ms 5496 KB Partially correct - number of queries: 8153
74 Partially correct 53 ms 5460 KB Partially correct - number of queries: 8197
75 Correct 6 ms 4952 KB Output is correct
76 Partially correct 35 ms 5500 KB Partially correct - number of queries: 7142
77 Partially correct 53 ms 5972 KB Partially correct - number of queries: 8400
78 Correct 8 ms 4952 KB Output is correct
79 Correct 23 ms 5468 KB Output is correct
80 Partially correct 45 ms 5200 KB Partially correct - number of queries: 8443
81 Partially correct 38 ms 5712 KB Partially correct - number of queries: 8406
82 Partially correct 31 ms 5744 KB Partially correct - number of queries: 8323
83 Correct 5 ms 4952 KB Output is correct
84 Partially correct 34 ms 5760 KB Partially correct - number of queries: 6940
85 Partially correct 49 ms 5284 KB Partially correct - number of queries: 8416
86 Correct 5 ms 4952 KB Output is correct
87 Correct 4 ms 4952 KB Output is correct
88 Correct 4 ms 4952 KB Output is correct
89 Correct 6 ms 4952 KB Output is correct
90 Correct 6 ms 5208 KB Output is correct
91 Correct 6 ms 4952 KB Output is correct
92 Correct 4 ms 4952 KB Output is correct
93 Correct 6 ms 4952 KB Output is correct
94 Correct 10 ms 5408 KB Output is correct
95 Correct 8 ms 4952 KB Output is correct
96 Correct 7 ms 4952 KB Output is correct
97 Correct 4 ms 4952 KB Output is correct