oj.uz

Submission #825964

# Submission time Handle Problem Language Result Execution time Memory
825964 2023-08-15T09:36:54 Z PixelCat Rarest Insects (IOI22_insects) C++17
10 / 100
 263 ms 320 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;
    while(check(1, m, sus, ans)) ans++;
    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 118 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 9 ms 304 KB Output is correct
9 Correct 6 ms 208 KB Output is correct
10 Correct 4 ms 208 KB Output is correct
11 Correct 2 ms 304 KB Output is correct
12 Correct 4 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 27 ms 208 KB Output is correct
15 Correct 17 ms 208 KB Output is correct
16 Correct 13 ms 300 KB Output is correct
17 Correct 13 ms 208 KB Output is correct
18 Correct 3 ms 300 KB Output is correct
19 Correct 7 ms 208 KB Output is correct
20 Correct 3 ms 208 KB Output is correct
21 Correct 3 ms 308 KB Output is correct
22 Correct 2 ms 208 KB Output is correct

Subtask #2
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 118 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 9 ms 304 KB Output is correct
9 Correct 6 ms 208 KB Output is correct
10 Correct 4 ms 208 KB Output is correct
11 Correct 2 ms 304 KB Output is correct
12 Correct 4 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 27 ms 208 KB Output is correct
15 Correct 17 ms 208 KB Output is correct
16 Correct 13 ms 300 KB Output is correct
17 Correct 13 ms 208 KB Output is correct
18 Correct 3 ms 300 KB Output is correct
19 Correct 7 ms 208 KB Output is correct
20 Correct 3 ms 208 KB Output is correct
21 Correct 3 ms 308 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Incorrect 263 ms 208 KB Too many queries.
24 Halted 0 ms 0 KB -

Subtask #3
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 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 Incorrect 251 ms 320 KB Too many queries.
8 Halted 0 ms 0 KB -