oj.uz

Submission #139441

# Submission time Handle Problem Language Result Execution time Memory
139441 2019-07-31T17:46:44 Z Hassoony The Big Prize (IOI17_prize) C++17
0 / 100
 81 ms 692 KB 
#include <bits/stdc++.h>
#include "prize.h"
//#include "grader.cpp"

using namespace std;
const int MX=2e5+9;
bool vis[MX];
int find_best(int n){
    while(1){
        int x=rand()%n;
        if(vis[x])continue;
        vis[x]=1;
        vector<int>ans = ask(x);
        if(ans[0] + ans[1] == 0){
            return x;
        }
    }
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 53 ms 500 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Incorrect 81 ms 692 KB Incorrect
2 Halted 0 ms 0 KB -