Submission #628881

# Submission time Handle Problem Language Result Execution time Memory
628881 2022-08-13T18:52:21 Z dqhungdl Rarest Insects (IOI22_insects) C++17
10 / 100
385 ms 304 KB
#include "insects.h"
#include <bits/stdc++.h>
using namespace std;

int min_cardinality(int N) {
    vector<int> P(N, -1);
    int rs = 1e9;
    for (int i = 0; i < N; i++)
        if (P[i] == -1) {
            P[i] = i;
            move_inside(i);
            int cnt = 1;
            for (int j = i + 1; j < N; j++)
                if (P[j] == -1) {
                    move_inside(j);
                    if (cnt + 1 == press_button()) {
                        cnt++;
                        P[j] = i;
                    } else
                        move_outside(j);
                }
            rs = min(rs, cnt);
            for (int j = i; j < N; j++)
                if (P[j] == i)
                    move_outside(j);
        }
    return rs;
}
# 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 2 ms 208 KB Output is correct
7 Correct 163 ms 208 KB Output is correct
8 Correct 19 ms 208 KB Output is correct
9 Correct 15 ms 208 KB Output is correct
10 Correct 5 ms 208 KB Output is correct
11 Correct 45 ms 304 KB Output is correct
12 Correct 6 ms 208 KB Output is correct
13 Correct 13 ms 208 KB Output is correct
14 Correct 5 ms 208 KB Output is correct
15 Correct 11 ms 208 KB Output is correct
16 Correct 10 ms 208 KB Output is correct
17 Correct 14 ms 208 KB Output is correct
18 Correct 14 ms 208 KB Output is correct
19 Correct 21 ms 208 KB Output is correct
20 Correct 49 ms 208 KB Output is correct
21 Correct 67 ms 256 KB Output is correct
22 Correct 67 ms 244 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 2 ms 208 KB Output is correct
7 Correct 163 ms 208 KB Output is correct
8 Correct 19 ms 208 KB Output is correct
9 Correct 15 ms 208 KB Output is correct
10 Correct 5 ms 208 KB Output is correct
11 Correct 45 ms 304 KB Output is correct
12 Correct 6 ms 208 KB Output is correct
13 Correct 13 ms 208 KB Output is correct
14 Correct 5 ms 208 KB Output is correct
15 Correct 11 ms 208 KB Output is correct
16 Correct 10 ms 208 KB Output is correct
17 Correct 14 ms 208 KB Output is correct
18 Correct 14 ms 208 KB Output is correct
19 Correct 21 ms 208 KB Output is correct
20 Correct 49 ms 208 KB Output is correct
21 Correct 67 ms 256 KB Output is correct
22 Correct 67 ms 244 KB Output is correct
23 Correct 12 ms 208 KB Output is correct
24 Incorrect 312 ms 208 KB Too many queries.
25 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 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 0 ms 208 KB Output is correct
7 Correct 23 ms 288 KB Output is correct
8 Incorrect 385 ms 208 KB Too many queries.
9 Halted 0 ms 0 KB -