oj.uz

Submission #1030326

# Submission time Handle Problem Language Result Execution time Memory
1030326 2024-07-22T02:42:10 Z shiomusubi496 The Big Prize (IOI17_prize) C++17
20 / 100
 1000 ms 5208 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 + 1, ng = n;
        while (ok < ng) {
            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;
    }
}

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 | }
      | ^

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5208 KB Output is correct
2 Correct 4 ms 4952 KB Output is correct
3 Correct 5 ms 5208 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 3 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 4 ms 4952 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 5 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 5 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 4 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 3 ms 4952 KB Output is correct
11 Execution timed out 3049 ms 4964 KB Time limit exceeded
12 Halted 0 ms 0 KB -