Submission #1132864

#TimeUsernameProblemLanguageResultExecution timeMemory
1132864alterioSphinx's Riddle (IOI24_sphinx)C++20
1.50 / 100
2 ms412 KiB
#include <bits/stdc++.h>
#include "sphinx.h"

using namespace std;

vector<int> find_colours(int N, vector<int> X, vector<int> Y) {
    vector<int> G(N, 0);
	for (int i = 0; i < N; i++) {
		int l = 0, r = N;
		while (l + 1 < r) {
			int mid = (l + r) / 2;
			vector<int> E(N, -1);
			int cnt = l;
			int unique = 1;
			for (int j = 0; j < N; j++) {
				if (i == j) continue;
				E[j] = cnt;
				cnt++;
				if (cnt > mid) cnt = mid;
				else unique++;
			}
			int x = perform_experiment(E);
			if (x == unique) r = mid;
			else l = mid;
		}
		G[i] = l;
	}
    return G;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...