oj.uz

Submission #112176

# Submission time Handle Problem Language Result Execution time Memory
112176 2019-05-17T18:13:05 Z someone_aa The Big Prize (IOI17_prize) C++17
0 / 100
 55 ms 592 KB 
#include "prize.h"
#include <bits/stdc++.h>

using namespace std;
const int maxn = 200100;

bool visited[maxn];

int find_best(int n) {
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

    srand(time(NULL));

    if(n <= 10000) {
        for(int i=1;i<=n;i++) {
            vector<int>v = ask(i);
            if(v[0] == v[1]) return i;
        }
    }

    int fst = 0, lst = INT_MAX;
    for(int i=1;i<=4500;i++) {
        int x = uniform_int_distribution<int>(0, n)(rng);

        while(visited[x]) x = uniform_int_distribution<int>(0, n)(rng);

        visited[x] = true;

        vector<int>v = ask(x);

        if(v[0] == v[1]) return x;

        // looking for the last {0, 1}
        // looking for the first {1, 0}
        if(v[0] == 0) fst = max(fst, x);
        else if(v[1] == 0 && x >= fst) lst = min(lst, x);
    }

    for(int i=fst;i<=lst;i++) {
        vector<int>v = ask(i);
        if(v[0] == v[1]) return i;
    }

	return 0;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 508 KB Output is correct
2 Correct 20 ms 592 KB Output is correct
3 Correct 53 ms 512 KB Output is correct
4 Incorrect 15 ms 568 KB Integer 200000 violates the range [0, 199999]
5 Halted 0 ms 0 KB -

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 388 KB Output is correct
2 Correct 19 ms 584 KB Output is correct
3 Correct 19 ms 500 KB Output is correct
4 Correct 37 ms 504 KB Output is correct
5 Correct 39 ms 504 KB Output is correct
6 Correct 40 ms 432 KB Output is correct
7 Correct 26 ms 512 KB Output is correct
8 Correct 40 ms 504 KB Output is correct
9 Correct 43 ms 444 KB Output is correct
10 Correct 27 ms 512 KB Output is correct
11 Incorrect 2 ms 256 KB answer is not correct
12 Halted 0 ms 0 KB -