Submission #1334721

#TimeUsernameProblemLanguageResultExecution timeMemory
1334721gohchingjaykRarest Insects (IOI22_insects)C++20
0 / 100
1 ms420 KiB
#include "insects.h"
#include <bits/stdc++.h>
using namespace std;

signed min_cardinality(signed N) {
	using ll = long long;
	#define int ll

	int num_unique = 0;
	for (int i = 0; i < N; ++i) {
		move_inside(i);
		int call = press_button();
		if (call > 1) {
			move_outside(i);
		}
		else {
			num_unique++;
		}
	}
	
	int lo = 2; int hi = N / num_unique;
	int ans = 1;
	while (lo <= hi) {
		int tgt = (lo + hi) / 2;
		
		set<int> this_iter;
		for (int j = 0; j < N; ++j) {
			move_inside(j);
			int call = press_button();
			if (call > tgt) {
				move_outside(j); continue;
			}
			
			this_iter.emplace(j);
		}
		
		if (this_iter.size() == (num_unique * (tgt - ans))) {
			ans = tgt;
			lo = tgt + 1;
		}
		else {
			hi = tgt - 1;
			for (int i : this_iter) move_outside(i);
		}
	}

	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...