제출 #630403

#제출 시각아이디문제언어결과실행 시간메모리
630403talant117408드문 곤충 (IOI22_insects)C++17
0 / 100
1 ms208 KiB
#include "insects.h" #include <bits/stdc++.h> #ifndef EVAL #include "stub.cpp" #endif using namespace std; typedef long long ll; typedef pair <int, int> pii; typedef pair <ll, ll> pll; #define long unsigned long #define pb push_back #define mp make_pair #define all(v) (v).begin(),(v).end() #define rall(v) (v).rbegin(),(v).rend() #define lb lower_bound #define ub upper_bound #define sz(v) int((v).size()) #define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); #define endl '\n' #define PI 2*acos(0.0) int min_cardinality(int n) { int different = 1; vector <int> inside; move_inside(0); inside.pb(0); for (int i = 1; i < n; i++) { move_inside(i); if (press_button() > 1) { move_outside(i); } else { different++; inside.pb(i); } } for (auto x : inside) { move_outside(x); } for (int i = 0; i < n; i++) { move_inside(i); } int l = 2, r = press_button(); for (int i = 0; i < n; i++) { move_outside(i); } while (l < r) { int mid = (l + r) >> 1; inside.clear(); for (int i = 0; i < n; i++) { move_inside(i); if (press_button() > mid) { move_outside(i); } else { inside.pb(i); } } if (sz(inside) != different * mid) { r = mid; } else { l = mid + 1; } for (auto x : inside) { move_outside(x); } } return l - 1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...