oj.uz

Submission #1067365

# Submission time Handle Problem Language Result Execution time Memory
1067365 2024-08-20T15:42:37 Z Ignut The Big Prize (IOI17_prize) C++17
20 / 100
 45 ms 428 KB 
// Ignut

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

vector<int> ask(int i);

int find_best(int n) {
	map<int, int> mp;
	int L = -1;
	while (true) {
		int lo = L + 1, hi = n - 1;
		while (lo < hi) {
			int mid = lo + (hi - lo) / 2;
			vector<int> vec = ask(mid);
			if (vec[0] + vec[1] == 0)
				return mid;
			int lvl = vec[0] + vec[1];
			int comp = 0;
			for (auto [a, b] : mp) if (a < lvl) comp += b;
			if (vec[0] > comp)
				hi = mid - 1;
			else {
				lo = mid + 1;
				mp[lvl] ++;
			}
		}
		vector<int> vec = ask(lo);
		if (vec[0] + vec[1] == 0)
			return lo;
		int lvl = vec[0] + vec[1];
		mp[lvl] ++;
		L = lo;
	}
}

/*
8
3 2 3 1 3 3 2 3
*/

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 428 KB Output is correct
6 Correct 0 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 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Incorrect 45 ms 344 KB Incorrect
14 Halted 0 ms 0 KB -