oj.uz

Submission #1059521

# Submission time Handle Problem Language Result Execution time Memory
1059521 2024-08-15T04:30:57 Z shiomusubi496 Rarest Insects (IOI22_insects) C++17
98.55 / 100
 43 ms 592 KB 
#include "insects.h"
#include <bits/stdc++.h>
 
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define rrep2(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); --i)
 
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
 
using namespace std;
 
using ll = long long;
 
template<class T, class U> bool chmin(T& a, const U& b) { return a > b ? a = b, true : false; }
template<class T, class U> bool chmax(T& a, const U& b) { return a < b ? a = b, true : false; }
 
mt19937 mt(random_device{}());
 
int min_cardinality(int N) {
    int nk = 0;
    vector<bool> f1(N, false), f2(N, false);
    {
        vector<bool> used(N);
        rep (i, N) {
            move_inside(i);
            if (press_button() == 2) move_outside(i);
            else ++nk, used[i] = true;
        }
        f1 = used;
    }
    int ok = 1, ng = N / nk + 1;
    while (ng - ok > 1) {
        int mid = (ok + ng) / 2 - 1;
        if (mid == ok) ++mid;
        vector<bool> used(N), used2(N);
        int cnt = 0;
        rep (i, N) {
            if (f1[i]) {
                ++cnt;
                continue;
            }
            if (f2[i]) continue;
            move_inside(i);
            if (press_button() > mid) move_outside(i), used2[i] = true;
            else cnt++, used[i] = true;
        }
        if (cnt == nk * mid) {
            ok = mid;
            rep (i, N) {
                if (used[i]) f1[i] = true;
            }
        }
        else {
            rep (i, N) {
                if (used2[i]) f2[i] = true;
                if (used[i]) move_outside(i);
            }
            ng = mid;
        }
    }
    return ok;
}

Subtask #1
10.0 / 10.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 0 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 3 ms 344 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 3 ms 344 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 2 ms 344 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct

Subtask #2
15.0 / 15.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 0 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 3 ms 344 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 3 ms 344 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 2 ms 344 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 19 ms 344 KB Output is correct
24 Correct 5 ms 344 KB Output is correct
25 Correct 15 ms 344 KB Output is correct
26 Correct 12 ms 344 KB Output is correct
27 Correct 11 ms 344 KB Output is correct
28 Correct 5 ms 344 KB Output is correct
29 Correct 12 ms 344 KB Output is correct
30 Correct 12 ms 344 KB Output is correct
31 Correct 14 ms 344 KB Output is correct
32 Correct 10 ms 340 KB Output is correct
33 Correct 11 ms 344 KB Output is correct
34 Correct 15 ms 344 KB Output is correct
35 Correct 15 ms 344 KB Output is correct
36 Correct 15 ms 344 KB Output is correct
37 Correct 13 ms 344 KB Output is correct
38 Correct 7 ms 344 KB Output is correct
39 Correct 7 ms 344 KB Output is correct
40 Correct 7 ms 344 KB Output is correct
41 Correct 3 ms 344 KB Output is correct

Subtask #3
73.55 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 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 Correct 0 ms 344 KB Output is correct
7 Partially correct 28 ms 344 KB Output is partially correct
8 Correct 6 ms 344 KB Output is correct
9 Partially correct 25 ms 344 KB Output is partially correct
10 Correct 43 ms 344 KB Output is correct
11 Correct 21 ms 344 KB Output is correct
12 Correct 16 ms 344 KB Output is correct
13 Correct 29 ms 344 KB Output is correct
14 Correct 33 ms 344 KB Output is correct
15 Correct 26 ms 344 KB Output is correct
16 Partially correct 20 ms 344 KB Output is partially correct
17 Correct 30 ms 340 KB Output is correct
18 Partially correct 27 ms 344 KB Output is partially correct
19 Correct 33 ms 344 KB Output is correct
20 Partially correct 27 ms 344 KB Output is partially correct
21 Correct 28 ms 344 KB Output is correct
22 Correct 18 ms 344 KB Output is correct
23 Correct 18 ms 344 KB Output is correct
24 Correct 23 ms 344 KB Output is correct
25 Correct 21 ms 340 KB Output is correct
26 Correct 10 ms 344 KB Output is correct
27 Partially correct 28 ms 344 KB Output is partially correct
28 Partially correct 33 ms 344 KB Output is partially correct
29 Partially correct 23 ms 344 KB Output is partially correct
30 Partially correct 41 ms 344 KB Output is partially correct
31 Correct 34 ms 416 KB Output is correct
32 Correct 42 ms 436 KB Output is correct
33 Correct 20 ms 344 KB Output is correct
34 Correct 27 ms 344 KB Output is correct
35 Partially correct 31 ms 344 KB Output is partially correct
36 Partially correct 43 ms 344 KB Output is partially correct
37 Correct 18 ms 344 KB Output is correct
38 Correct 28 ms 592 KB Output is correct
39 Partially correct 32 ms 344 KB Output is partially correct
40 Partially correct 30 ms 344 KB Output is partially correct
41 Partially correct 40 ms 344 KB Output is partially correct
42 Partially correct 34 ms 344 KB Output is partially correct
43 Correct 5 ms 344 KB Output is correct
44 Correct 29 ms 344 KB Output is correct
45 Partially correct 19 ms 344 KB Output is partially correct
46 Correct 13 ms 344 KB Output is correct
47 Correct 13 ms 344 KB Output is correct
48 Correct 21 ms 344 KB Output is correct