oj.uz

답안 #1030435

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1030435 2024-07-22T05:04:25 Z shiomusubi496 커다란 상품 (IOI17_prize) C++17
99.72 / 100
 36 ms 5716 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, xx = 500;
    rep (i, 500) {
        auto res = Ask(i);
        chmax(cnt, res[0] + res[1]);
        if (res[0] + res[1] == 0) return i;
        if (cnt >= 30) {
            xx = i + 1;
            break;
        }
    }
    int x = xx;
    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 = xx, ng = n;
        while (ng - ok > 1) {
            int mid = (ok + ng) / 2;
            if (mid <= x) ok = mid;
            else {
                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:64:1: warning: control reaches end of non-void function [-Wreturn-type]
   64 | }
      | ^

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 4952 KB Output is correct
2 Correct 5 ms 4952 KB Output is correct
3 Correct 4 ms 4952 KB Output is correct
4 Correct 6 ms 4952 KB Output is correct
5 Correct 5 ms 4952 KB Output is correct
6 Correct 2 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 6 ms 5144 KB Output is correct
10 Correct 5 ms 4952 KB Output is correct

Subtask #2
79.72 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4952 KB Output is correct
2 Correct 5 ms 4952 KB Output is correct
3 Correct 6 ms 4952 KB Output is correct
4 Correct 4 ms 4952 KB Output is correct
5 Correct 4 ms 4952 KB Output is correct
6 Correct 2 ms 4952 KB Output is correct
7 Correct 5 ms 5156 KB Output is correct
8 Correct 4 ms 4952 KB Output is correct
9 Correct 4 ms 4952 KB Output is correct
10 Correct 5 ms 4952 KB Output is correct
11 Correct 3 ms 4952 KB Output is correct
12 Correct 3 ms 4952 KB Output is correct
13 Correct 4 ms 4952 KB Output is correct
14 Correct 3 ms 856 KB Output is correct
15 Correct 8 ms 5036 KB Output is correct
16 Correct 24 ms 5232 KB Output is correct
17 Correct 2 ms 4952 KB Output is correct
18 Correct 27 ms 5456 KB Output is correct
19 Correct 2 ms 4952 KB Output is correct
20 Correct 9 ms 2796 KB Output is correct
21 Correct 8 ms 5200 KB Output is correct
22 Correct 4 ms 4952 KB Output is correct
23 Correct 4 ms 4952 KB Output is correct
24 Correct 2 ms 4952 KB Output is correct
25 Correct 12 ms 4952 KB Output is correct
26 Correct 15 ms 5160 KB Output is correct
27 Correct 5 ms 4952 KB Output is correct
28 Correct 31 ms 5492 KB Output is correct
29 Correct 20 ms 5464 KB Output is correct
30 Correct 29 ms 5716 KB Output is correct
31 Correct 3 ms 4952 KB Output is correct
32 Correct 4 ms 4952 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 9 ms 5144 KB Output is correct
35 Correct 5 ms 4952 KB Output is correct
36 Correct 7 ms 5140 KB Output is correct
37 Correct 3 ms 4952 KB Output is correct
38 Correct 5 ms 4952 KB Output is correct
39 Correct 15 ms 5156 KB Output is correct
40 Correct 31 ms 5708 KB Output is correct
41 Correct 16 ms 5200 KB Output is correct
42 Correct 14 ms 5228 KB Output is correct
43 Correct 18 ms 5416 KB Output is correct
44 Correct 11 ms 4952 KB Output is correct
45 Correct 10 ms 4952 KB Output is correct
46 Correct 2 ms 4952 KB Output is correct
47 Correct 12 ms 5208 KB Output is correct
48 Correct 19 ms 5456 KB Output is correct
49 Correct 4 ms 4952 KB Output is correct
50 Correct 26 ms 5240 KB Output is correct
51 Correct 12 ms 5208 KB Output is correct
52 Correct 3 ms 4952 KB Output is correct
53 Correct 5 ms 4952 KB Output is correct
54 Correct 13 ms 5400 KB Output is correct
55 Correct 3 ms 4952 KB Output is correct
56 Correct 30 ms 5272 KB Output is correct
57 Correct 21 ms 5216 KB Output is correct
58 Correct 15 ms 5248 KB Output is correct
59 Correct 13 ms 5200 KB Output is correct
60 Correct 21 ms 5208 KB Output is correct
61 Correct 6 ms 5164 KB Output is correct
62 Correct 6 ms 4952 KB Output is correct
63 Correct 5 ms 4952 KB Output is correct
64 Correct 5 ms 4952 KB Output is correct
65 Correct 2 ms 4952 KB Output is correct
66 Correct 5 ms 4952 KB Output is correct
67 Correct 2 ms 4952 KB Output is correct
68 Correct 4 ms 4952 KB Output is correct
69 Correct 4 ms 4952 KB Output is correct
70 Correct 2 ms 5040 KB Output is correct
71 Correct 19 ms 5208 KB Output is correct
72 Correct 5 ms 5208 KB Output is correct
73 Correct 21 ms 5464 KB Output is correct
74 Correct 24 ms 5208 KB Output is correct
75 Correct 6 ms 4952 KB Output is correct
76 Correct 16 ms 5460 KB Output is correct
77 Partially correct 28 ms 5480 KB Partially correct - number of queries: 5004
78 Correct 4 ms 4952 KB Output is correct
79 Correct 13 ms 5200 KB Output is correct
80 Correct 31 ms 5204 KB Output is correct
81 Partially correct 23 ms 5480 KB Partially correct - number of queries: 5028
82 Correct 36 ms 5428 KB Output is correct
83 Correct 4 ms 4952 KB Output is correct
84 Correct 27 ms 5436 KB Output is correct
85 Correct 27 ms 5200 KB Output is correct
86 Correct 4 ms 4952 KB Output is correct
87 Correct 3 ms 4952 KB Output is correct
88 Correct 4 ms 5152 KB Output is correct
89 Correct 4 ms 4952 KB Output is correct
90 Correct 4 ms 4952 KB Output is correct
91 Correct 4 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 6 ms 4952 KB Output is correct
95 Correct 6 ms 4952 KB Output is correct
96 Correct 7 ms 4952 KB Output is correct
97 Correct 6 ms 4952 KB Output is correct