# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1058334 | 2024-08-14T09:24:53 Z | aykhn | 드문 곤충 (IOI22_insects) | C++17 | 2 ms | 344 KB |
#include "insects.h" #include <bits/stdc++.h> using namespace std; int min_cardinality(int N) { int uni = 0; vector<int> v; for (int i = 0; i < N; i++) { move_inside(i); if (press_button() > 1) move_outside(i); else uni++, v.push_back(i); } for (int &i : v) move_outside(i); v.clear(); vector<int> in(N, 0); vector<int> alive(N, 1); int l = 1, r = N / uni; int ok = 0; while (l < r) { int mid = (l + r + 1) >> 1; for (int i = 0; i < N; i++) { if (!alive[i]) continue; move_inside(i); v.push_back(i); in[i] = 1; if (press_button() > mid) { in[i] = 0; move_outside(i); v.pop_back(); } } assert(v.size() <= mid * uni); if ((int)v.size() != mid * uni) { for (int i = 0; i < N; i++) { if (!in[i]) alive[i] = 0; } for (int &i : v) move_outside(i), in[i] = 0; v.clear(); r = mid - 1; } else { for (int &i : v) { ok++; alive[i] = 0; in[i] = 0; } v.clear(); l = mid; } } return l; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 0 ms | 344 KB | Output is correct |
4 | Correct | 0 ms | 344 KB | Output is correct |
5 | Correct | 0 ms | 344 KB | Output is correct |
6 | Incorrect | 2 ms | 344 KB | Wrong answer. |
7 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 0 ms | 344 KB | Output is correct |
4 | Correct | 0 ms | 344 KB | Output is correct |
5 | Correct | 0 ms | 344 KB | Output is correct |
6 | Incorrect | 2 ms | 344 KB | Wrong answer. |
7 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 0 ms | 344 KB | Output is correct |
4 | Correct | 0 ms | 344 KB | Output is correct |
5 | Correct | 0 ms | 344 KB | Output is correct |
6 | Incorrect | 1 ms | 344 KB | Wrong answer. |
7 | Halted | 0 ms | 0 KB | - |