| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1332878 | gelastropod | 드문 곤충 (IOI22_insects) | C++20 | 108 ms | 412 KiB |
#include "insects.h"
#include <bits/stdc++.h>
using namespace std;
int min_cardinality(int N) {
int cnt = 1, ans = N;
vector<int> typ(N, 0);
for (int i = 0; i < N; i++) {
if (typ[i] != 0) continue;
int crnt = 1;
typ[i] = cnt++;
move_inside(i);
for (int j = i + 1; j < N; j++) {
move_inside(j);
int res = press_button();
if (res == 2) typ[j] = typ[i], crnt++;
move_outside(j);
}
ans = min(ans, crnt);
move_outside(i);
}
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... | ||||
