이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "insects.h"
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define all(a) (a).begin(), (a).end()
#define ll long long
const int mod = 1000002022;
vector<int> state, p;
int n, m;
vector<vector<int>> g;
template<typename T>
int len(T &a){return a.size();}
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
void shuffle(vector<int> &a, int n){
if(n == 1) return;
random_shuffle(a.begin(), a.begin() + n);
for(int i = 0; i < n; i ++){
int aa = rng() % n, bb = rng() % n;
while(bb == aa) bb = rng() % n;
swap(a[aa], a[bb]);
}
}
int min_cardinality(int n) {
int dis = 0;
vector<int> v;
vector<int> done(n);
for(int i = 0; i < n; i ++){
move_inside(i);
if(press_button() == 2){
move_outside(i);
continue;
}
v.push_back(i);
}
dis = len(v);
int lim = sqrt(n) + 1;
if(dis <= lim){
for(auto u : v){
move_outside(u);
done[u] = 1;
}
int ans = n;
for(auto u : v){
int cnt = 1;
move_inside(u);
for(int i = 0; i < n; i ++){
if(done[i]) continue;
move_inside(i);
if(press_button() == 2){
done[i] = 1;
cnt ++;
}
move_outside(i);
}
move_outside(u);
ans = min(ans, cnt);
}
return ans;
}
int ans = 0;
//cout << dis << endl;
while(true){
ans ++;
for(auto u : v){
move_inside(u);
done[u] = 1;
}
v.clear();
for(int i = 0; i < n; i++){
if(done[i]) continue;
move_inside(i);
if(press_button() == 2){
move_outside(i); continue;
}
v.push_back(i);
}
if(len(v) != dis){
break;
}
}
return ans;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |