oj.uz

Submission #825970

# Submission time Handle Problem Language Result Execution time Memory
825970 2023-08-15T09:38:43 Z PixelCat Rarest Insects (IOI22_insects) C++17
39.7 / 100
 203 ms 464 KB 
#include "insects.h"

#ifdef NYAOWO
#include "stub.cpp"
#endif

#include <bits/stdc++.h>
#define For(i, a, b) for(int i = a; i <= b; i++)
#define Forr(i, a, b) for(int i = a; i >= b; i--)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define eb emplace_back
// #define int LL
using namespace std;
using i32 = int32_t;
using LL = long long;
using pii = pair<int, int>;

int find_types(vector<int> &sus) {
    vector<int> rep;
    vector<int> uwu;
    for(auto &i:sus) {
        move_inside(i);
        if(press_button() == 1) {
            rep.eb(i);
        } else {
            move_outside(i);
            uwu.eb(i);
        }
    }
    sus = uwu;
    // for(auto &i:rep) move_outside(i);
    return sz(rep);
}

// # of all types >= k ?
bool check(int k, int m, vector<int> &sus, int good) {
    if(sz(sus) < k * m) return false;
    // for(auto &i:sus) cerr << i << " ";
    vector<int> owo;
    vector<int> uwu;
    for(auto &i:sus) {
        move_inside(i);
        if(press_button() > k + good) {
            uwu.eb(i);
            move_outside(i);
        } else {
            owo.eb(i);
        }
    }
    // cerr << " - " << k << " " << sz(owo) + good << " " << (m * k == sz(owo) + good) << "\n";
    if(m * k == sz(owo)) {
        sus = uwu;
        return true;
    }
    sus = owo;
    for(auto &i:owo) move_outside(i);
    return false;
}

int min_cardinality(int n) {

    vector<int> sus;
    For(i, 0, n - 1) sus.eb(i);
    random_shuffle(all(sus));

    int m = find_types(sus);
    cerr << m << "\n";

    int ans = 1;
    int upd = 1;
    while(upd) {
        int uwu = 1;
        upd = 0;
        while(check(uwu, m, sus, ans)) {
            ans += uwu;
            uwu *= 2;
            upd = 1;
        }
    }
    return ans;
}

/*

6
5 8 9 5 9 9

1
7

*/

Subtask #1
10.0 / 10.0

# 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 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 10 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 6 ms 208 KB Output is correct
9 Correct 7 ms 208 KB Output is correct
10 Correct 4 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 4 ms 304 KB Output is correct
13 Correct 4 ms 300 KB Output is correct
14 Correct 7 ms 208 KB Output is correct
15 Correct 7 ms 208 KB Output is correct
16 Correct 7 ms 304 KB Output is correct
17 Correct 7 ms 208 KB Output is correct
18 Correct 4 ms 208 KB Output is correct
19 Correct 4 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 300 KB Output is correct

Subtask #2
15.0 / 15.0

# 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 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 10 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 6 ms 208 KB Output is correct
9 Correct 7 ms 208 KB Output is correct
10 Correct 4 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 4 ms 304 KB Output is correct
13 Correct 4 ms 300 KB Output is correct
14 Correct 7 ms 208 KB Output is correct
15 Correct 7 ms 208 KB Output is correct
16 Correct 7 ms 304 KB Output is correct
17 Correct 7 ms 208 KB Output is correct
18 Correct 4 ms 208 KB Output is correct
19 Correct 4 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 300 KB Output is correct
23 Correct 83 ms 316 KB Output is correct
24 Correct 7 ms 208 KB Output is correct
25 Correct 25 ms 304 KB Output is correct
26 Correct 37 ms 208 KB Output is correct
27 Correct 13 ms 208 KB Output is correct
28 Correct 7 ms 340 KB Output is correct
29 Correct 20 ms 208 KB Output is correct
30 Correct 13 ms 308 KB Output is correct
31 Correct 57 ms 312 KB Output is correct
32 Correct 49 ms 208 KB Output is correct
33 Correct 42 ms 316 KB Output is correct
34 Correct 43 ms 320 KB Output is correct
35 Correct 58 ms 308 KB Output is correct
36 Correct 41 ms 312 KB Output is correct
37 Correct 47 ms 312 KB Output is correct
38 Correct 19 ms 312 KB Output is correct
39 Correct 11 ms 312 KB Output is correct
40 Correct 12 ms 308 KB Output is correct
41 Correct 6 ms 208 KB Output is correct

Subtask #3
14.7 / 75.0

# 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 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Partially correct 203 ms 320 KB Output is partially correct
8 Correct 13 ms 320 KB Output is correct
9 Partially correct 86 ms 312 KB Output is partially correct
10 Partially correct 104 ms 208 KB Output is partially correct
11 Correct 31 ms 208 KB Output is correct
12 Correct 20 ms 312 KB Output is correct
13 Correct 39 ms 208 KB Output is correct
14 Correct 23 ms 208 KB Output is correct
15 Partially correct 139 ms 324 KB Output is partially correct
16 Partially correct 138 ms 312 KB Output is partially correct
17 Partially correct 146 ms 208 KB Output is partially correct
18 Partially correct 111 ms 320 KB Output is partially correct
19 Partially correct 139 ms 208 KB Output is partially correct
20 Partially correct 119 ms 320 KB Output is partially correct
21 Partially correct 94 ms 336 KB Output is partially correct
22 Partially correct 70 ms 308 KB Output is partially correct
23 Correct 26 ms 320 KB Output is correct
24 Correct 18 ms 320 KB Output is correct
25 Correct 22 ms 208 KB Output is correct
26 Correct 13 ms 288 KB Output is correct
27 Partially correct 63 ms 308 KB Output is partially correct
28 Partially correct 55 ms 320 KB Output is partially correct
29 Partially correct 76 ms 308 KB Output is partially correct
30 Partially correct 68 ms 464 KB Output is partially correct
31 Partially correct 64 ms 308 KB Output is partially correct
32 Partially correct 62 ms 316 KB Output is partially correct
33 Correct 44 ms 324 KB Output is correct
34 Correct 46 ms 208 KB Output is correct
35 Partially correct 65 ms 324 KB Output is partially correct
36 Partially correct 67 ms 208 KB Output is partially correct
37 Partially correct 87 ms 324 KB Output is partially correct
38 Partially correct 78 ms 320 KB Output is partially correct
39 Partially correct 46 ms 316 KB Output is partially correct
40 Partially correct 39 ms 320 KB Output is partially correct
41 Partially correct 67 ms 312 KB Output is partially correct
42 Partially correct 68 ms 208 KB Output is partially correct
43 Correct 8 ms 304 KB Output is correct
44 Correct 21 ms 312 KB Output is correct
45 Partially correct 193 ms 208 KB Output is partially correct
46 Correct 21 ms 296 KB Output is correct
47 Correct 22 ms 308 KB Output is correct
48 Correct 16 ms 208 KB Output is correct