# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1069712 | 2024-08-22T08:28:31 Z | j_vdd16 | Rarest Insects (IOI22_insects) | C++17 | 161 ms | 900 KB |
#include "insects.h" #include <algorithm> #include <bitset> #include <cstdint> #include <cstring> #include <iostream> #include <limits.h> #include <math.h> #include <map> #include <numeric> #include <queue> #include <set> #include <stack> #include <string> #include <vector> //#define int long long #define loop(X, N) for(int X = 0; X < (N); X++) #define all(V) V.begin(), V.end() #define rall(V) V.rbegin(), V.rend() using namespace std; typedef vector<int> vi; typedef vector<vi> vvi; typedef pair<int, int> ii; typedef vector<ii> vii; typedef vector<vector<ii>> vvii; typedef vector<bool> vb; typedef vector<vector<bool>> vvb; typedef uint64_t u64; typedef int64_t i64; int min_cardinality(int N) { vb isDone(N); vb isRemoved(N); loop(i, N) { move_inside(i); int res = press_button(); if (res > 1) { move_outside(i); isRemoved[i] = true; } } int diffCount = 0; loop(i, N) { if (!isRemoved[i]) { diffCount++; move_outside(i); isDone[i] = true; } } int extra = 1; int l = 1, r = N; while (l < r) { int m = (l + r + 1) / 2; int lessThanM = diffCount * extra; isRemoved = vb(N); loop(i, N) { if (isDone[i]) continue; move_inside(i); int res = press_button(); if (res > m - extra) { move_outside(i); isRemoved[i] = true; } else { lessThanM++; } } loop(i, N) { if (isDone[i]) continue; if (!isRemoved[i]) { move_outside(i); } } if (lessThanM == diffCount * m) { l = m; loop(i, N) { if (!isRemoved[i] && !isDone[i]) { isDone[i] = true; } } extra = m; } else { r = m - 1; } } return l; // vb isDone(N); // int diffCount = 0; // vb isNew(N); // loop(i, N) { // move_inside(i); // int res = press_button(); // if (res == 1) { // diffCount++; // isNew[i] = true; // } // else { // move_outside(i); // } // } // loop(i, N) { // if (isNew[i]) { // move_outside(i); // } // } // int total = N; // while (true) { // if (diffCount == 1) { // return total; // } // int maxCount = 0; // int lastIncrease = 0; // loop(i, N) { // if (isDone[i]) continue; // move_inside(i); // int res = press_button(); // if (res > maxCount) { // maxCount = res; // lastIncrease = i; // } // } // if (diffCount == 2) { // return total - maxCount; // } // vi possible; // for (int x = 1; x <= total; x++) { // // if (diffCount == 2 && x + maxCount != total) continue; // // if (diffCount == 1 && (x != maxCount || x != total)) continue; // if ((diffCount - 1) * x + maxCount <= total && total <= (diffCount - 1) * maxCount + x) { // possible.push_back(x); // } // } // if (possible.size() == 1) { // return possible[0]; // } // else if (possible.size() == 0) { // return -1; // } // for (int i = N - 1; i > lastIncrease; i--) { // if (isDone[i]) continue; // move_outside(i); // } // vb isPartOfMax(N); // isPartOfMax[lastIncrease] = true; // for (int i = 0; i < lastIncrease; i++) { // if (isDone[i]) continue; // move_outside(i); // int res = press_button(); // if (res < maxCount) { // move_inside(i); // isPartOfMax[i] = true; // } // } // loop(i, N) { // if (isPartOfMax[i]) { // isDone[i] = true; // move_outside(i); // } // } // diffCount--; // total -= maxCount; // } // return 0; }
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 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 | 1 ms | 344 KB | Output is correct |
6 | Correct | 3 ms | 344 KB | Output is correct |
7 | Correct | 1 ms | 344 KB | Output is correct |
8 | Correct | 6 ms | 344 KB | Output is correct |
9 | Correct | 5 ms | 344 KB | Output is correct |
10 | Correct | 11 ms | 344 KB | Output is correct |
11 | Correct | 5 ms | 344 KB | Output is correct |
12 | Correct | 11 ms | 344 KB | Output is correct |
13 | Correct | 7 ms | 344 KB | Output is correct |
14 | Correct | 5 ms | 344 KB | Output is correct |
15 | Correct | 7 ms | 344 KB | Output is correct |
16 | Correct | 4 ms | 344 KB | Output is correct |
17 | Correct | 6 ms | 344 KB | Output is correct |
18 | Correct | 10 ms | 344 KB | Output is correct |
19 | Correct | 9 ms | 344 KB | Output is correct |
20 | Correct | 8 ms | 344 KB | Output is correct |
21 | Correct | 6 ms | 344 KB | Output is correct |
22 | Correct | 4 ms | 344 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 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 | 1 ms | 344 KB | Output is correct |
6 | Correct | 3 ms | 344 KB | Output is correct |
7 | Correct | 1 ms | 344 KB | Output is correct |
8 | Correct | 6 ms | 344 KB | Output is correct |
9 | Correct | 5 ms | 344 KB | Output is correct |
10 | Correct | 11 ms | 344 KB | Output is correct |
11 | Correct | 5 ms | 344 KB | Output is correct |
12 | Correct | 11 ms | 344 KB | Output is correct |
13 | Correct | 7 ms | 344 KB | Output is correct |
14 | Correct | 5 ms | 344 KB | Output is correct |
15 | Correct | 7 ms | 344 KB | Output is correct |
16 | Correct | 4 ms | 344 KB | Output is correct |
17 | Correct | 6 ms | 344 KB | Output is correct |
18 | Correct | 10 ms | 344 KB | Output is correct |
19 | Correct | 9 ms | 344 KB | Output is correct |
20 | Correct | 8 ms | 344 KB | Output is correct |
21 | Correct | 6 ms | 344 KB | Output is correct |
22 | Correct | 4 ms | 344 KB | Output is correct |
23 | Correct | 10 ms | 596 KB | Output is correct |
24 | Correct | 7 ms | 344 KB | Output is correct |
25 | Correct | 32 ms | 344 KB | Output is correct |
26 | Correct | 57 ms | 344 KB | Output is correct |
27 | Correct | 63 ms | 344 KB | Output is correct |
28 | Correct | 36 ms | 344 KB | Output is correct |
29 | Correct | 74 ms | 596 KB | Output is correct |
30 | Correct | 68 ms | 344 KB | Output is correct |
31 | Correct | 26 ms | 344 KB | Output is correct |
32 | Correct | 27 ms | 344 KB | Output is correct |
33 | Correct | 41 ms | 344 KB | Output is correct |
34 | Correct | 26 ms | 344 KB | Output is correct |
35 | Correct | 51 ms | 344 KB | Output is correct |
36 | Correct | 36 ms | 344 KB | Output is correct |
37 | Correct | 51 ms | 344 KB | Output is correct |
38 | Correct | 63 ms | 344 KB | Output is correct |
39 | Correct | 39 ms | 344 KB | Output is correct |
40 | Correct | 37 ms | 344 KB | Output is correct |
41 | Correct | 30 ms | 344 KB | Output is correct |
# | Verdict | Execution time | Memory | 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 | 388 KB | Output is correct |
6 | Partially correct | 0 ms | 344 KB | Output is partially correct |
7 | Correct | 32 ms | 344 KB | Output is correct |
8 | Correct | 9 ms | 600 KB | Output is correct |
9 | Partially correct | 96 ms | 656 KB | Output is partially correct |
10 | Partially correct | 124 ms | 900 KB | Output is partially correct |
11 | Partially correct | 116 ms | 344 KB | Output is partially correct |
12 | Partially correct | 81 ms | 424 KB | Output is partially correct |
13 | Partially correct | 161 ms | 416 KB | Output is partially correct |
14 | Partially correct | 137 ms | 652 KB | Output is partially correct |
15 | Partially correct | 50 ms | 416 KB | Output is partially correct |
16 | Partially correct | 58 ms | 568 KB | Output is partially correct |
17 | Partially correct | 83 ms | 420 KB | Output is partially correct |
18 | Partially correct | 64 ms | 412 KB | Output is partially correct |
19 | Partially correct | 84 ms | 632 KB | Output is partially correct |
20 | Partially correct | 102 ms | 412 KB | Output is partially correct |
21 | Partially correct | 102 ms | 412 KB | Output is partially correct |
22 | Partially correct | 142 ms | 416 KB | Output is partially correct |
23 | Partially correct | 132 ms | 660 KB | Output is partially correct |
24 | Partially correct | 112 ms | 428 KB | Output is partially correct |
25 | Partially correct | 77 ms | 664 KB | Output is partially correct |
26 | Partially correct | 54 ms | 428 KB | Output is partially correct |
27 | Partially correct | 83 ms | 416 KB | Output is partially correct |
28 | Partially correct | 85 ms | 408 KB | Output is partially correct |
29 | Partially correct | 65 ms | 888 KB | Output is partially correct |
30 | Partially correct | 70 ms | 556 KB | Output is partially correct |
31 | Partially correct | 96 ms | 428 KB | Output is partially correct |
32 | Partially correct | 141 ms | 656 KB | Output is partially correct |
33 | Partially correct | 125 ms | 656 KB | Output is partially correct |
34 | Partially correct | 126 ms | 656 KB | Output is partially correct |
35 | Partially correct | 91 ms | 832 KB | Output is partially correct |
36 | Partially correct | 88 ms | 656 KB | Output is partially correct |
37 | Partially correct | 120 ms | 412 KB | Output is partially correct |
38 | Partially correct | 116 ms | 412 KB | Output is partially correct |
39 | Partially correct | 97 ms | 652 KB | Output is partially correct |
40 | Partially correct | 93 ms | 640 KB | Output is partially correct |
41 | Partially correct | 75 ms | 660 KB | Output is partially correct |
42 | Partially correct | 59 ms | 592 KB | Output is partially correct |
43 | Partially correct | 28 ms | 340 KB | Output is partially correct |
44 | Partially correct | 103 ms | 344 KB | Output is partially correct |
45 | Partially correct | 37 ms | 340 KB | Output is partially correct |
46 | Partially correct | 70 ms | 344 KB | Output is partially correct |
47 | Partially correct | 73 ms | 592 KB | Output is partially correct |
48 | Partially correct | 68 ms | 600 KB | Output is partially correct |