oj.uz

답안 #1075703

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1075703 2024-08-26T08:43:49 Z NeroZein 커다란 상품 (IOI17_prize) C++17
20 / 100
 1 ms 600 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

//~ const int B = 500;

int find_best(int n) {
	for (int i = 0; i < n; ++i) {
		vector<int> res = ask(i); 
		if (res[0] + res[1] == 0) {
			return i; 
		}
		//~ if (res[0] + res[1] >= B) {
			//~ cerr << "res0, res1; " << res[0] << ' ' << res[1] << endl; 
			int l = i, r = n - 1;
			while (l < r) {
				int mid = (l + r + 1) >> 1;
				vector<int> res2 = ask(mid);
				if (res2[1] < res[1]) {//I skipped a more valuable person
					r = mid - 1;
				} else {
					l = mid; 
				}
			}
			i = l;
		//~ }
	}
	assert(false);	
}

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 424 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 424 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Runtime error 1 ms 600 KB Execution killed with signal 6
12 Halted 0 ms 0 KB -