oj.uz

Submission #1062718

# Submission time Handle Problem Language Result Execution time Memory
1062718 2024-08-17T10:01:11 Z Zero_OP Rarest Insects (IOI22_insects) C++17
47.5 / 100
 152 ms 1048 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 = inside_insects.size();
    for(int i : inside_insects) move_outside(i);

    int l = 2, r = N / distinct_colors, res = 1;
    while(l <= r){
        int mid = l + r >> 1;
        
        vector<int> keep;
        for(int i = 0; i < N; ++i){
            move_inside(i);
            if(press_button() > mid){
                move_outside(i);
            } else keep.push_back(i); 
        }

        if(keep.size() == distinct_colors * mid){
            res = mid;
            l = mid + 1;
        } else r = mid - 1;

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

    return res;
}

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

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

    return 0;
}
#endif

Compilation message

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:86:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   86 |         int mid = l + r >> 1;
      |                   ~~^~~
insects.cpp:96:24: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   96 |         if(keep.size() == distinct_colors * mid){
      |            ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

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 11 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 6 ms 596 KB Output is correct
10 Correct 8 ms 344 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 8 ms 344 KB Output is correct
13 Correct 5 ms 436 KB Output is correct
14 Correct 5 ms 344 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Correct 5 ms 344 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 4 ms 344 KB Output is correct
20 Correct 3 ms 432 KB Output is correct
21 Correct 1 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 11 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 6 ms 596 KB Output is correct
10 Correct 8 ms 344 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 8 ms 344 KB Output is correct
13 Correct 5 ms 436 KB Output is correct
14 Correct 5 ms 344 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Correct 5 ms 344 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 4 ms 344 KB Output is correct
20 Correct 3 ms 432 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 62 ms 692 KB Output is correct
24 Correct 7 ms 344 KB Output is correct
25 Correct 36 ms 440 KB Output is correct
26 Correct 30 ms 420 KB Output is correct
27 Correct 53 ms 344 KB Output is correct
28 Correct 4 ms 344 KB Output is correct
29 Correct 49 ms 436 KB Output is correct
30 Correct 36 ms 344 KB Output is correct
31 Correct 43 ms 344 KB Output is correct
32 Correct 48 ms 592 KB Output is correct
33 Correct 42 ms 344 KB Output is correct
34 Correct 41 ms 344 KB Output is correct
35 Correct 31 ms 344 KB Output is correct
36 Correct 45 ms 420 KB Output is correct
37 Correct 23 ms 344 KB Output is correct
38 Correct 17 ms 344 KB Output is correct
39 Correct 13 ms 344 KB Output is correct
40 Correct 6 ms 344 KB Output is correct
41 Correct 5 ms 344 KB Output is correct

Subtask #3
22.5 / 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 Partially correct 0 ms 344 KB Output is partially correct
7 Partially correct 152 ms 1048 KB Output is partially correct
8 Correct 10 ms 344 KB Output is correct
9 Partially correct 92 ms 584 KB Output is partially correct
10 Partially correct 72 ms 696 KB Output is partially correct
11 Partially correct 119 ms 344 KB Output is partially correct
12 Correct 21 ms 592 KB Output is correct
13 Partially correct 136 ms 344 KB Output is partially correct
14 Partially correct 86 ms 344 KB Output is partially correct
15 Partially correct 129 ms 684 KB Output is partially correct
16 Partially correct 112 ms 576 KB Output is partially correct
17 Partially correct 86 ms 700 KB Output is partially correct
18 Partially correct 83 ms 600 KB Output is partially correct
19 Partially correct 94 ms 600 KB Output is partially correct
20 Partially correct 100 ms 924 KB Output is partially correct
21 Partially correct 77 ms 700 KB Output is partially correct
22 Partially correct 67 ms 440 KB Output is partially correct
23 Partially correct 37 ms 428 KB Output is partially correct
24 Correct 33 ms 600 KB Output is correct
25 Correct 20 ms 700 KB Output is correct
26 Correct 11 ms 440 KB Output is correct
27 Partially correct 85 ms 448 KB Output is partially correct
28 Partially correct 71 ms 672 KB Output is partially correct
29 Partially correct 74 ms 600 KB Output is partially correct
30 Partially correct 94 ms 440 KB Output is partially correct
31 Partially correct 87 ms 688 KB Output is partially correct
32 Partially correct 63 ms 600 KB Output is partially correct
33 Partially correct 71 ms 440 KB Output is partially correct
34 Partially correct 54 ms 672 KB Output is partially correct
35 Partially correct 68 ms 440 KB Output is partially correct
36 Partially correct 100 ms 436 KB Output is partially correct
37 Partially correct 55 ms 676 KB Output is partially correct
38 Partially correct 64 ms 600 KB Output is partially correct
39 Partially correct 59 ms 592 KB Output is partially correct
40 Partially correct 51 ms 448 KB Output is partially correct
41 Partially correct 74 ms 680 KB Output is partially correct
42 Partially correct 94 ms 588 KB Output is partially correct
43 Partially correct 18 ms 344 KB Output is partially correct
44 Partially correct 118 ms 436 KB Output is partially correct
45 Partially correct 137 ms 436 KB Output is partially correct
46 Correct 23 ms 588 KB Output is correct
47 Correct 24 ms 692 KB Output is correct
48 Correct 24 ms 600 KB Output is correct