# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
830547 | 2023-08-19T07:54:54 Z | tolbi | 드문 곤충 (IOI22_insects) | C++17 | 1 ms | 208 KB |
#include <bits/stdc++.h> using namespace std; mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count()); #include "insects.h" int min_cardinality(int n) { function<int(int)> f; vector<int> hash(n); iota(hash.begin(), hash.end(), 0); for (int i = n-1; i >= 0; i--){ swap(hash[i],hash[ayahya()%(i+1)]); } f = [&](int x)->int{ int ans = 0; vector<int> crr; for (int i = 0; i < n; i++){ crr.push_back(hash[i]); move_inside(hash[i]); if (press_button()>x){ ans++; crr.pop_back(); move_outside(hash[i]); } } for (int i = 0; i < crr.size(); ++i) { move_outside(crr[i]); } return ans; }; int diff = n-f(1); int l = n/diff, r = n; while (l<r){ int mid = l+(r-l+1)/2; if (f(mid)>n-(mid*diff)){ r=mid-1; } else l = mid; } return l; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 208 KB | Output is correct |
2 | Correct | 0 ms | 208 KB | Output is correct |
3 | Correct | 0 ms | 208 KB | Output is correct |
4 | Correct | 0 ms | 208 KB | Output is correct |
5 | Incorrect | 1 ms | 208 KB | Wrong answer. |
6 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 208 KB | Output is correct |
2 | Correct | 0 ms | 208 KB | Output is correct |
3 | Correct | 0 ms | 208 KB | Output is correct |
4 | Correct | 0 ms | 208 KB | Output is correct |
5 | Incorrect | 1 ms | 208 KB | Wrong answer. |
6 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 208 KB | Wrong answer. |
2 | Halted | 0 ms | 0 KB | - |