Submission #731995

# Submission time Handle Problem Language Result Execution time Memory
731995 2023-04-28T08:18:13 Z alextodoran Rarest Insects (IOI22_insects) C++17
99.89 / 100
79 ms 412 KB
/**

 /\      /\
 \_\_//_/_/
  / 0  0  \
  \  /   \/
  /____ \/ \
  (o  o)/ \
   \__/\ \

**/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

void move_inside (int i);
void move_outside (int i);
int press_button ();

int min_cardinality (int N) {
    bool in[N];
    int id[N];
    fill(in, in + N, false);
    int dist = 0;
    for (int i = 0; i < N; i++) {
        move_inside(i);
        if (press_button() > 1) {
            move_outside(i);
        } else {
            in[i] = true;
            id[i] = dist++;
        }
    }
    if (dist == N) {
        return 1;
    }
    int A = 1, B = 1;
    bool bad[N];
    fill(bad, bad + N, false);
    int cnt = dist;
    int l = 1, r = N / dist;
    while (l < r) {
        int k = (l * A + r * B + A + B - 1) / (A + B);
        vector <int> v1, v2;
        for (int i = 0; i < N; i++) {
            int suff = 0;
            for (int j = i; j < N; j++) {
                if (in[j] == false && bad[j] == false) {
                    suff++;
                }
            }
            if (cnt + suff < dist * k) {
                break;
            }
            if (in[i] == false && bad[i] == false) {
                move_inside(i);
                if (press_button() > k) {
                    move_outside(i);
                    bad[i] = true;
                    v1.push_back(i);
                } else {
                    in[i] = true;
                    v2.push_back(i);
                    cnt++;
                }
            }
        }
        if (cnt == dist * k) {
            l = k;
            for (int i : v1) {
                bad[i] = false;
            }
        } else {
            r = k - 1;
            for (int i : v2) {
                move_outside(i);
                in[i] = false;
                cnt--;
            }
        }
    }
    return l;
}

Compilation message

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:25:9: warning: variable 'id' set but not used [-Wunused-but-set-variable]
   25 |     int id[N];
      |         ^~
# Verdict Execution time Memory 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 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 4 ms 300 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 6 ms 208 KB Output is correct
9 Correct 6 ms 208 KB Output is correct
10 Correct 8 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 5 ms 296 KB Output is correct
13 Correct 4 ms 296 KB Output is correct
14 Correct 7 ms 300 KB Output is correct
15 Correct 4 ms 300 KB Output is correct
16 Correct 6 ms 208 KB Output is correct
17 Correct 4 ms 296 KB Output is correct
18 Correct 3 ms 296 KB Output is correct
19 Correct 5 ms 208 KB Output is correct
20 Correct 3 ms 208 KB Output is correct
21 Correct 2 ms 208 KB Output is correct
22 Correct 2 ms 272 KB Output is correct
# Verdict Execution time Memory 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 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 4 ms 300 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 6 ms 208 KB Output is correct
9 Correct 6 ms 208 KB Output is correct
10 Correct 8 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 5 ms 296 KB Output is correct
13 Correct 4 ms 296 KB Output is correct
14 Correct 7 ms 300 KB Output is correct
15 Correct 4 ms 300 KB Output is correct
16 Correct 6 ms 208 KB Output is correct
17 Correct 4 ms 296 KB Output is correct
18 Correct 3 ms 296 KB Output is correct
19 Correct 5 ms 208 KB Output is correct
20 Correct 3 ms 208 KB Output is correct
21 Correct 2 ms 208 KB Output is correct
22 Correct 2 ms 272 KB Output is correct
23 Correct 29 ms 208 KB Output is correct
24 Correct 8 ms 208 KB Output is correct
25 Correct 27 ms 208 KB Output is correct
26 Correct 25 ms 304 KB Output is correct
27 Correct 22 ms 304 KB Output is correct
28 Correct 9 ms 208 KB Output is correct
29 Correct 26 ms 304 KB Output is correct
30 Correct 31 ms 208 KB Output is correct
31 Correct 32 ms 304 KB Output is correct
32 Correct 30 ms 208 KB Output is correct
33 Correct 27 ms 288 KB Output is correct
34 Correct 35 ms 288 KB Output is correct
35 Correct 31 ms 208 KB Output is correct
36 Correct 26 ms 208 KB Output is correct
37 Correct 33 ms 292 KB Output is correct
38 Correct 26 ms 208 KB Output is correct
39 Correct 22 ms 288 KB Output is correct
40 Correct 12 ms 208 KB Output is correct
41 Correct 9 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 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 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 65 ms 296 KB Output is correct
8 Correct 17 ms 208 KB Output is correct
9 Correct 71 ms 208 KB Output is correct
10 Correct 62 ms 208 KB Output is correct
11 Correct 50 ms 208 KB Output is correct
12 Correct 17 ms 208 KB Output is correct
13 Correct 60 ms 300 KB Output is correct
14 Correct 64 ms 208 KB Output is correct
15 Correct 63 ms 208 KB Output is correct
16 Correct 62 ms 300 KB Output is correct
17 Correct 61 ms 296 KB Output is correct
18 Correct 74 ms 332 KB Output is correct
19 Partially correct 79 ms 296 KB Output is partially correct
20 Correct 70 ms 208 KB Output is correct
21 Correct 70 ms 296 KB Output is correct
22 Correct 58 ms 208 KB Output is correct
23 Correct 45 ms 288 KB Output is correct
24 Correct 47 ms 300 KB Output is correct
25 Correct 24 ms 208 KB Output is correct
26 Correct 23 ms 208 KB Output is correct
27 Correct 61 ms 284 KB Output is correct
28 Correct 58 ms 328 KB Output is correct
29 Partially correct 59 ms 292 KB Output is partially correct
30 Partially correct 73 ms 208 KB Output is partially correct
31 Correct 49 ms 208 KB Output is correct
32 Correct 50 ms 296 KB Output is correct
33 Correct 58 ms 300 KB Output is correct
34 Correct 56 ms 208 KB Output is correct
35 Partially correct 67 ms 296 KB Output is partially correct
36 Partially correct 72 ms 208 KB Output is partially correct
37 Correct 53 ms 300 KB Output is correct
38 Correct 50 ms 300 KB Output is correct
39 Correct 52 ms 300 KB Output is correct
40 Correct 48 ms 412 KB Output is correct
41 Partially correct 50 ms 300 KB Output is partially correct
42 Partially correct 58 ms 288 KB Output is partially correct
43 Correct 10 ms 208 KB Output is correct
44 Correct 50 ms 292 KB Output is correct
45 Correct 71 ms 208 KB Output is correct
46 Correct 23 ms 208 KB Output is correct
47 Correct 19 ms 208 KB Output is correct
48 Correct 16 ms 208 KB Output is correct