oj.uz

답안 #108012

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
108012 2019-04-26T18:50:53 Z reda 커다란 상품 (IOI17_prize) C++14
20 / 100
 69 ms 512 KB 
#include<bits/stdc++.h>
#include "prize.h"
 
using namespace std;
int find_best(int n)
{
  int  low , high;
  low =0; high=n-1;
  while(low<=high)
  {
    int mid=(low+high)/2;
    vector<int> arr=ask(mid);
    if(arr[0]==0 && arr[1]==0)return mid;
    else{
      if(arr[0])high=mid;
      else low=mid+1;
  }
  }
    return -1;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 396 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 3 ms 256 KB Output is correct
6 Correct 3 ms 256 KB Output is correct
7 Correct 3 ms 268 KB Output is correct
8 Correct 7 ms 256 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 2 ms 256 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 392 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 392 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Incorrect 69 ms 256 KB Incorrect
12 Halted 0 ms 0 KB -