oj.uz

Submission #80289

# Submission time Handle Problem Language Result Execution time Memory
80289 2018-10-19T19:13:18 Z MoNsTeR_CuBe The Big Prize (IOI17_prize) C++17
20 / 100
 2 ms 580 KB 
#include "prize.h"
#include <bits/stdc++.h>
 
using namespace std;
 
int find_best(int n) {
   int left = 0;
   int right = n-1;
   while(left < right){
        int mid = (left+right)/2;
        vector<int> tab = ask(mid);
       if(tab[0]==1){
            right = mid-1;
       }else if(tab[1] == 1){
            left = mid+1;
       }else{
            right = mid;
            break;
       }
   }
   return right;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 388 KB Output is correct
2 Correct 2 ms 388 KB Output is correct
3 Correct 2 ms 400 KB Output is correct
4 Correct 2 ms 400 KB Output is correct
5 Correct 2 ms 400 KB Output is correct
6 Correct 2 ms 408 KB Output is correct
7 Correct 2 ms 452 KB Output is correct
8 Correct 2 ms 580 KB Output is correct
9 Correct 2 ms 580 KB Output is correct
10 Correct 2 ms 580 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 580 KB Output is correct
2 Correct 2 ms 580 KB Output is correct
3 Correct 2 ms 580 KB Output is correct
4 Correct 2 ms 580 KB Output is correct
5 Correct 2 ms 580 KB Output is correct
6 Correct 2 ms 580 KB Output is correct
7 Correct 2 ms 580 KB Output is correct
8 Correct 2 ms 580 KB Output is correct
9 Correct 2 ms 580 KB Output is correct
10 Correct 2 ms 580 KB Output is correct
11 Incorrect 2 ms 580 KB answer is not correct
12 Halted 0 ms 0 KB -