#include<bits/stdc++.h>
#include "insects.h"
#define pb push_back
using namespace std;
/*
static inline constexpr int kMaxQueries = 40000;
static int N;
// Insect types are compressed to colors in the range [0, N).
static std::vector<int> color;
static std::vector<bool> in_box;
static std::vector<int> color_occurrences;
static std::multiset<int> max_occurrences;
static std::vector<int> op_counter(3, 0);
static inline void protocol_violation(std::string message) {
printf("Protocol Violation: %s\n", message.c_str());
exit(0);
}
void move_inside(int i) {
if (i < 0 || i >= N) {
protocol_violation("invalid parameter");
}
++op_counter[0];
if (op_counter[0] > kMaxQueries) {
protocol_violation("too many calls");
}
if (!in_box[i]) {
in_box[i] = true;
max_occurrences.erase(max_occurrences.find(color_occurrences[color[i]]));
++color_occurrences[color[i]];
max_occurrences.insert(color_occurrences[color[i]]);
}
}
void move_outside(int i) {
if (i < 0 || i >= N) {
protocol_violation("invalid parameter");
}
++op_counter[1];
if (op_counter[1] > kMaxQueries) {
protocol_violation("too many calls");
}
if (in_box[i]) {
in_box[i] = false;
max_occurrences.erase(max_occurrences.find(color_occurrences[color[i]]));
--color_occurrences[color[i]];
max_occurrences.insert(color_occurrences[color[i]]);
}
}
int press_button() {
++op_counter[2];
if (op_counter[2] > kMaxQueries) {
protocol_violation("too many calls");
}
return *(max_occurrences.rbegin());
}
*/
int min_cardinality(int N) {
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
vector<int> cik;
int colcnt = 0;
for(int i = 0; i < N; i++){
move_inside(i);
colcnt++;
int val = press_button();
if(val == 2){
move_outside(i);
colcnt--;
}
else cik.pb(i);
}
for(auto itr: cik){
move_outside(itr);
}
cik.clear();
if(N/colcnt < 512){
vector<int> rem, nrem, allst;
for(int i = 0; i < N; i++){
rem.pb(i);
allst.pb(i);
}
int l = 1, r = N/colcnt;
while(l <= r){
int m = (l + r)/2;
int tot = 0;
for(auto i: rem){
move_inside(i);
tot++;
int val = press_button();
if(val > m){
move_outside(i);
nrem.pb(i);
tot--;
}
else cik.pb(i);
}
if(tot == colcnt * m){
l = m + 1; // all of them >= m so
rem = nrem;
nrem.clear();
}
else{
r = m - 1;
for(auto itr: cik) move_outside(itr);
cik.clear();
rem = allst;
}
}
return r;
}
else{
vector<int> wh, nxtwh;
for(int i = 0; i < N; i++){
wh.pb(i);
}
shuffle(wh.begin(), wh.end(), rng);
int sz = 0, ans = N;
while(wh.size() > 0){
sz = 0;
for(auto itr: wh){
move_inside(itr);
sz++;
int val = press_button();
if(val != sz){
move_outside(itr);
nxtwh.pb(itr);
sz--;
}
else cik.pb(itr);
}
ans = min(ans, sz);
wh = nxtwh;
for(auto itr: cik) move_outside(itr);
cik.clear();
nxtwh.clear();
}
return ans;
}
}
/*
int main() {
assert(1 == scanf("%d", &N));
color.resize(N);
in_box.assign(N, false);
std::map<int, int> type_to_color;
for (int i = 0; i < N; ++i) {
int Ti;
assert(1 == scanf("%d", &Ti));
if (type_to_color.find(Ti) == type_to_color.end()) {
int new_color = type_to_color.size();
type_to_color[Ti] = new_color;
max_occurrences.insert(0);
}
color[i] = type_to_color[Ti];
}
color_occurrences.assign(type_to_color.size(), 0);
int answer = min_cardinality(N);
int Q = *std::max_element(op_counter.begin(), op_counter.end());
printf("%d\n", answer);
printf("%d\n", Q);
return 0;
}
*/
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
344 KB |
Wrong answer. |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
344 KB |
Wrong answer. |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
344 KB |
Wrong answer. |
| 3 |
Halted |
0 ms |
0 KB |
- |
