oj.uz

답안 #38966

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
38966 2018-01-08T14:10:17 Z faustaadp 커다란 상품 (IOI17_prize) C++14
20 / 100
 46 ms 2016 KB 
#include "prize.h"
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll l,r,c,ma;
vector<int> v;
int find_best(int n) {
	for(int i = 0; i < n; i++) {
		std::vector<int> res = ask(i);
		if(res[0] + res[1] == 0)
			return i;
		ma=max((ll)ma,(ll)(res[0]+res[1]));
		if(res[0]+res[1]!=ma)
			continue;
		l=i+1;
		r=n-1;
		while(l<r)
		{
			c=(l+r)/2;
			v=ask(c);
			if(v[0]==res[0]&&v[1]==res[1])
			{
				i=c;
				l=c+1;
			}
			else
				r=c-1;
		}
	}
	return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2016 KB Output is correct
2 Correct 0 ms 2016 KB Output is correct
3 Correct 0 ms 2016 KB Output is correct
4 Correct 0 ms 2016 KB Output is correct
5 Correct 0 ms 2016 KB Output is correct
6 Correct 0 ms 2016 KB Output is correct
7 Correct 0 ms 2016 KB Output is correct
8 Correct 0 ms 2016 KB Output is correct
9 Correct 0 ms 2016 KB Output is correct
10 Correct 0 ms 2016 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2016 KB Output is correct
2 Correct 0 ms 2016 KB Output is correct
3 Correct 0 ms 2016 KB Output is correct
4 Correct 0 ms 2016 KB Output is correct
5 Correct 0 ms 2016 KB Output is correct
6 Correct 0 ms 2016 KB Output is correct
7 Correct 0 ms 2016 KB Output is correct
8 Correct 0 ms 2016 KB Output is correct
9 Correct 0 ms 2016 KB Output is correct
10 Correct 0 ms 2016 KB Output is correct
11 Correct 3 ms 2016 KB Output is correct
12 Correct 0 ms 2016 KB Output is correct
13 Correct 6 ms 2016 KB Output is correct
14 Correct 0 ms 2016 KB Output is correct
15 Correct 6 ms 2016 KB Output is correct
16 Partially correct 46 ms 2016 KB Partially correct - number of queries: 9768
17 Correct 0 ms 2016 KB Output is correct
18 Incorrect 46 ms 2016 KB Incorrect
19 Halted 0 ms 0 KB -