This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "insects.h"
#ifdef NYAOWO
#include "stub.cpp"
#endif
#include <bits/stdc++.h>
#define For(i, a, b) for(int i = a; i <= b; i++)
#define Forr(i, a, b) for(int i = a; i >= b; i--)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define eb emplace_back
// #define int LL
using namespace std;
using i32 = int32_t;
using LL = long long;
using pii = pair<int, int>;
int find_types(vector<int> &sus) {
vector<int> rep;
vector<int> uwu;
for(auto &i:sus) {
move_inside(i);
if(press_button() == 1) {
rep.eb(i);
} else {
move_outside(i);
uwu.eb(i);
}
}
sus = uwu;
// for(auto &i:rep) move_outside(i);
return sz(rep);
}
// # of all types >= k ?
bool check(int k, int m, vector<int> &sus) {
if(sz(sus) < k * m) return false;
vector<int> owo;
vector<int> uwu;
for(auto &i:sus) {
move_inside(i);
if(press_button() > k) {
uwu.eb(i);
move_outside(i);
} else {
owo.eb(i);
}
}
if(m * k == sz(owo)) {
sus = uwu;
return true;
}
sus = owo;
return false;
}
int min_cardinality(int n) {
vector<int> sus;
For(i, 0, n - 1) sus.eb(i);
random_shuffle(all(sus));
int m = find_types(sus);
cerr << m << "\n";
int ans = 1;
while(sz(sus)) {
int lo = 1;
while(true) {
if(check(lo, m, sus)) lo *= 2;
else break;
}
ans += lo / 2;
}
return ans;
}
/*
6
5 8 9 5 9 9
1
7
*/
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |