oj.uz

Submission #1062735

# Submission time Handle Problem Language Result Execution time Memory
1062735 2024-08-17T10:12:18 Z Zero_OP Rarest Insects (IOI22_insects) C++17
99.89 / 100
 41 ms 704 KB 
#include<bits/stdc++.h>
#ifndef LOCAL
    #include<insects.h>
#endif

using namespace std;

#ifdef LOCAL
const int MAX = 2e3 + 5;
int N;
int press[MAX];
vector<int> ar;
bool in[MAX];
int cnt[MAX]; //for testcase, use value <= 2000
multiset<int> st;

void move_inside(int i){
    ++press[0];
    if(press[0] > 40000){
        cout << "Too much operations move_inside!\n";
        exit(0);
    }

    if(in[i]) {
        cout << "Already added!\n";
        exit(0);
    }

    in[i] = true;
    if(cnt[ar[i]]) st.erase(st.find(cnt[ar[i]]));
    cnt[ar[i]] += 1;
    st.insert(cnt[ar[i]]);
}

void move_outside(int i){
    ++press[1];
    if(press[1] > 40000){
        cout << "Too much operations move_outside!\n";
        exit(0);
    }

    if(!in[i]){
        cout << "Not added yet!\n";
        exit(0);
    }

    in[i] = false;
    if(cnt[ar[i]]) st.erase(st.find(cnt[ar[i]]));
    cnt[ar[i]] -= 1;
    st.insert(cnt[ar[i]]);
}

int press_button(){
    ++press[2];
    if(press[2] > 40000){
        cout << "Too much operations press_button!\n";
        exit(0);
    }

    if(st.empty()){
        cout << "No insects!\n";
        assert(false);
    }

    return *prev(st.end());
}
#endif

int min_cardinality(int N){
    vector<int> inside_insects, outside_insects;
    for(int i = 0; i < N; ++i){
        move_inside(i);
        if(press_button() > 1){
            outside_insects.push_back(i);
            move_outside(i);
        } else inside_insects.push_back(i);
    }

    if(outside_insects.empty()) return 1;

    int distinct_colors = (int)inside_insects.size();

    for(int i : inside_insects) move_outside(i);
    vector<int> greedy_insects = outside_insects;

    int ans = 1;
    while((int)greedy_insects.size() >= distinct_colors){
        int nInsects = (int)greedy_insects.size();
        int mid = ((nInsects / distinct_colors) + 1) / 2;

        vector<int> good, bad;
        for(int i = 0; i < nInsects; ++i){
            move_inside(greedy_insects[i]);
            if(press_button() > mid){
                bad.push_back(greedy_insects[i]);
                move_outside(greedy_insects[i]);
            } else{
                good.push_back(greedy_insects[i]);
            }
        }

        if(mid * distinct_colors == (int)good.size()){
            ans += mid;
            greedy_insects = bad;
        } else greedy_insects = good;

        for(int i : good) move_outside(i);
    }

    return ans;
}

#ifdef LOCAL
int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

    int N = 6;
    ar = {5, 8, 9, 8, 9, 9};
    cout << min_cardinality(N);

    return 0;
}
#endif

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 1 ms 344 KB Output is correct
6 Correct 3 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 3 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 436 KB Output is correct
14 Correct 4 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 2 ms 344 KB Output is correct
18 Correct 2 ms 344 KB Output is correct
19 Correct 2 ms 344 KB Output is correct
20 Correct 3 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 1 ms 344 KB Output is correct
6 Correct 3 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 3 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 436 KB Output is correct
14 Correct 4 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 2 ms 344 KB Output is correct
18 Correct 2 ms 344 KB Output is correct
19 Correct 2 ms 344 KB Output is correct
20 Correct 3 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 24 ms 600 KB Output is correct
24 Correct 7 ms 344 KB Output is correct
25 Correct 12 ms 704 KB Output is correct
26 Correct 11 ms 344 KB Output is correct
27 Correct 7 ms 344 KB Output is correct
28 Correct 5 ms 600 KB Output is correct
29 Correct 12 ms 452 KB Output is correct
30 Correct 13 ms 444 KB Output is correct
31 Correct 13 ms 344 KB Output is correct
32 Correct 12 ms 600 KB Output is correct
33 Correct 21 ms 444 KB Output is correct
34 Correct 11 ms 344 KB Output is correct
35 Correct 11 ms 448 KB Output is correct
36 Correct 16 ms 600 KB Output is correct
37 Correct 16 ms 600 KB Output is correct
38 Correct 14 ms 432 KB Output is correct
39 Correct 9 ms 436 KB Output is correct
40 Correct 10 ms 344 KB Output is correct
41 Correct 5 ms 344 KB Output is correct

Subtask #3
74.89 / 75.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 0 ms 344 KB Output is correct
7 Correct 25 ms 600 KB Output is correct
8 Correct 8 ms 344 KB Output is correct
9 Correct 32 ms 440 KB Output is correct
10 Correct 18 ms 344 KB Output is correct
11 Correct 17 ms 340 KB Output is correct
12 Correct 10 ms 596 KB Output is correct
13 Correct 34 ms 600 KB Output is correct
14 Correct 35 ms 452 KB Output is correct
15 Correct 27 ms 436 KB Output is correct
16 Correct 41 ms 592 KB Output is correct
17 Correct 30 ms 688 KB Output is correct
18 Correct 29 ms 588 KB Output is correct
19 Partially correct 34 ms 600 KB Output is partially correct
20 Correct 28 ms 592 KB Output is correct
21 Correct 27 ms 436 KB Output is correct
22 Correct 33 ms 592 KB Output is correct
23 Correct 25 ms 436 KB Output is correct
24 Correct 16 ms 344 KB Output is correct
25 Correct 10 ms 344 KB Output is correct
26 Correct 7 ms 344 KB Output is correct
27 Correct 34 ms 344 KB Output is correct
28 Correct 28 ms 440 KB Output is correct
29 Partially correct 28 ms 440 KB Output is partially correct
30 Partially correct 31 ms 436 KB Output is partially correct
31 Correct 20 ms 596 KB Output is correct
32 Correct 33 ms 596 KB Output is correct
33 Correct 24 ms 600 KB Output is correct
34 Correct 33 ms 448 KB Output is correct
35 Partially correct 29 ms 600 KB Output is partially correct
36 Partially correct 40 ms 600 KB Output is partially correct
37 Correct 22 ms 344 KB Output is correct
38 Correct 22 ms 344 KB Output is correct
39 Correct 22 ms 344 KB Output is correct
40 Correct 20 ms 692 KB Output is correct
41 Partially correct 36 ms 600 KB Output is partially correct
42 Partially correct 31 ms 440 KB Output is partially correct
43 Correct 4 ms 344 KB Output is correct
44 Correct 18 ms 456 KB Output is correct
45 Correct 31 ms 452 KB Output is correct
46 Correct 15 ms 592 KB Output is correct
47 Correct 19 ms 344 KB Output is correct
48 Correct 10 ms 344 KB Output is correct