oj.uz

Submission #1001127

# Submission time Handle Problem Language Result Execution time Memory
1001127 2024-06-18T15:16:29 Z c2zi6 The Big Prize (IOI17_prize) C++14
20 / 100
 43 ms 5392 KB 
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "prize.h"

VVI qr;
VI myask(int ind) {
    if (qr[ind].size()) return qr[ind];
    return qr[ind] = ask(ind);
}
int sum(int ind) {
    return qr[ind][0] + qr[ind][1];
}

int dfs(int l, int r) {
    /*cout << "NOW PROCESSING " << l+1 << " " << r+1 << endl;*/
    myask(l);
    if (sum(l) == 0) return l;
    myask(r);
    if (sum(r) == 0) return r;
    if (l > r) return -1;
    if (sum(l) > sum(r)) return dfs(l, r-1);
    if (sum(l) < sum(r)) return dfs(l+1, r);
    if (qr[l][0] == qr[r][0]) return -1;
    int m = (l + r)/2;
    myask(m);
    if (sum(m) == 0) return m;
    int ret;
    ret = dfs(l, m);
    if (ret != -1) return ret;
    ret = dfs(m, r);
    if (ret != -1) return ret;
    return -1;
}

int find_best(int n) {
    qr = VVI(n);
    int sz = 475;
    VPI ranges;
    int l = 0;
    int r = sz;
    while (true) {
        int ret = dfs(l, r);
        if (ret != -1) return ret;
        l = r+1;
        r = l + sz;
        if (l >= n) break;
        if (r >= n) r = n-1;
    }
    return -1;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5208 KB Output is correct
2 Correct 5 ms 4952 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 6 ms 4952 KB Output is correct
5 Correct 3 ms 4952 KB Output is correct
6 Correct 1 ms 5032 KB Output is correct
7 Correct 4 ms 5152 KB Output is correct
8 Correct 3 ms 4952 KB Output is correct
9 Correct 5 ms 5140 KB Output is correct
10 Correct 5 ms 4948 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 3 ms 4952 KB Output is correct
3 Correct 3 ms 5036 KB Output is correct
4 Correct 6 ms 4952 KB Output is correct
5 Correct 4 ms 4948 KB Output is correct
6 Correct 1 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 3 ms 5036 KB Output is correct
10 Correct 4 ms 5208 KB Output is correct
11 Correct 5 ms 4952 KB Output is correct
12 Correct 1 ms 4952 KB Output is correct
13 Correct 6 ms 4952 KB Output is correct
14 Correct 2 ms 856 KB Output is correct
15 Correct 4 ms 5156 KB Output is correct
16 Correct 20 ms 5208 KB Output is correct
17 Correct 2 ms 4952 KB Output is correct
18 Correct 16 ms 5260 KB Output is correct
19 Correct 2 ms 4952 KB Output is correct
20 Correct 7 ms 2900 KB Output is correct
21 Correct 10 ms 5392 KB Output is correct
22 Correct 3 ms 4952 KB Output is correct
23 Correct 2 ms 5204 KB Output is correct
24 Correct 1 ms 4952 KB Output is correct
25 Correct 13 ms 5208 KB Output is correct
26 Correct 12 ms 4948 KB Output is correct
27 Correct 2 ms 4952 KB Output is correct
28 Correct 26 ms 5200 KB Output is correct
29 Correct 15 ms 5208 KB Output is correct
30 Correct 43 ms 5176 KB Output is correct
31 Correct 2 ms 4952 KB Output is correct
32 Correct 7 ms 4948 KB Output is correct
33 Incorrect 0 ms 344 KB Integer 475 violates the range [0, 99]
34 Halted 0 ms 0 KB -