oj.uz

Submission #826235

# Submission time Handle Problem Language Result Execution time Memory
826235 2023-08-15T11:25:01 Z PixelCat Rarest Insects (IOI22_insects) C++17
100 / 100
 50 ms 440 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;
    bool broken = false;
    for(auto &i:sus) {
        if(broken) {
            uwu.eb(i);
            continue;
        }
        move_inside(i);
        if(press_button() > k + good) {
            uwu.eb(i);
            move_outside(i);
        } else {
            owo.eb(i);
        }
        if(sz(owo) == m * k) broken = true;
    }
    // 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 hi = n / m + 1, lo = 1;
    while(hi - lo > 1) {
        int mi = (hi - lo) / 2;
        if(check(mi, m, sus, lo)) lo += mi;
        else hi = lo + mi;
    }
    return lo;
}

/*

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 3 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 3 ms 208 KB Output is correct
9 Correct 4 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 5 ms 208 KB Output is correct
13 Correct 5 ms 208 KB Output is correct
14 Correct 3 ms 208 KB Output is correct
15 Correct 5 ms 208 KB Output is correct
16 Correct 3 ms 208 KB Output is correct
17 Correct 4 ms 208 KB Output is correct
18 Correct 2 ms 308 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 1 ms 208 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 3 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 3 ms 208 KB Output is correct
9 Correct 4 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 5 ms 208 KB Output is correct
13 Correct 5 ms 208 KB Output is correct
14 Correct 3 ms 208 KB Output is correct
15 Correct 5 ms 208 KB Output is correct
16 Correct 3 ms 208 KB Output is correct
17 Correct 4 ms 208 KB Output is correct
18 Correct 2 ms 308 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 1 ms 208 KB Output is correct
23 Correct 18 ms 308 KB Output is correct
24 Correct 9 ms 308 KB Output is correct
25 Correct 21 ms 308 KB Output is correct
26 Correct 17 ms 320 KB Output is correct
27 Correct 21 ms 308 KB Output is correct
28 Correct 8 ms 208 KB Output is correct
29 Correct 22 ms 208 KB Output is correct
30 Correct 20 ms 208 KB Output is correct
31 Correct 14 ms 208 KB Output is correct
32 Correct 20 ms 304 KB Output is correct
33 Correct 20 ms 308 KB Output is correct
34 Correct 16 ms 312 KB Output is correct
35 Correct 19 ms 304 KB Output is correct
36 Correct 23 ms 208 KB Output is correct
37 Correct 17 ms 316 KB Output is correct
38 Correct 17 ms 208 KB Output is correct
39 Correct 20 ms 304 KB Output is correct
40 Correct 14 ms 312 KB Output is correct
41 Correct 9 ms 312 KB Output is correct

Subtask #3
75.0 / 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 1 ms 208 KB Output is correct
7 Correct 15 ms 300 KB Output is correct
8 Correct 12 ms 208 KB Output is correct
9 Correct 40 ms 316 KB Output is correct
10 Correct 39 ms 308 KB Output is correct
11 Correct 31 ms 320 KB Output is correct
12 Correct 27 ms 332 KB Output is correct
13 Correct 37 ms 208 KB Output is correct
14 Correct 42 ms 312 KB Output is correct
15 Correct 41 ms 312 KB Output is correct
16 Correct 44 ms 304 KB Output is correct
17 Correct 18 ms 440 KB Output is correct
18 Correct 43 ms 312 KB Output is correct
19 Correct 43 ms 316 KB Output is correct
20 Correct 29 ms 208 KB Output is correct
21 Correct 26 ms 324 KB Output is correct
22 Correct 37 ms 308 KB Output is correct
23 Correct 37 ms 208 KB Output is correct
24 Correct 39 ms 304 KB Output is correct
25 Correct 23 ms 312 KB Output is correct
26 Correct 15 ms 208 KB Output is correct
27 Correct 32 ms 308 KB Output is correct
28 Correct 37 ms 320 KB Output is correct
29 Correct 40 ms 312 KB Output is correct
30 Correct 34 ms 324 KB Output is correct
31 Correct 50 ms 312 KB Output is correct
32 Correct 39 ms 208 KB Output is correct
33 Correct 26 ms 436 KB Output is correct
34 Correct 32 ms 320 KB Output is correct
35 Correct 37 ms 208 KB Output is correct
36 Correct 33 ms 308 KB Output is correct
37 Correct 37 ms 308 KB Output is correct
38 Correct 35 ms 208 KB Output is correct
39 Correct 44 ms 312 KB Output is correct
40 Correct 45 ms 308 KB Output is correct
41 Correct 33 ms 208 KB Output is correct
42 Correct 44 ms 312 KB Output is correct
43 Correct 8 ms 308 KB Output is correct
44 Correct 30 ms 328 KB Output is correct
45 Correct 28 ms 316 KB Output is correct
46 Correct 18 ms 316 KB Output is correct
47 Correct 20 ms 320 KB Output is correct
48 Correct 21 ms 312 KB Output is correct