oj.uz

Submission #72818

# Submission time Handle Problem Language Result Execution time Memory
72818 2018-08-27T03:10:22 Z funcsr The Big Prize (IOI17_prize) C++17
20 / 100
 4 ms 556 KB 
#include "prize.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <cassert>
using namespace std;
#define rep(i,n)for (int i=0; i<(n); i++)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define _1 first
#define _2 second
#define INF 1145141919
typedef pair<int, int> P;

int find_best(int N) {
  int lo = 0, hi = N-1;
  while (hi-lo>=1) {
    int mid = (lo+hi)/2;
    vector<int> ret = ask(mid);
    if (ret[0]+ret[1] == 0) return mid;
    if (ret[0]>0) hi = mid-1;
    else lo = mid+1;
  }
  return lo;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 288 KB Output is correct
2 Correct 3 ms 436 KB Output is correct
3 Correct 2 ms 436 KB Output is correct
4 Correct 2 ms 436 KB Output is correct
5 Correct 4 ms 436 KB Output is correct
6 Correct 3 ms 488 KB Output is correct
7 Correct 2 ms 516 KB Output is correct
8 Correct 2 ms 552 KB Output is correct
9 Correct 2 ms 552 KB Output is correct
10 Correct 3 ms 552 KB Output is correct

Subtask #2
0 / 80.0

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