Submission #1024778

# Submission time Handle Problem Language Result Execution time Memory
1024778 2024-07-16T10:15:41 Z vjudge1 Rarest Insects (IOI22_insects) C++17
49.4 / 100
153 ms 1276 KB
#include "insects.h"
#include <bits/stdc++.h>

#define ll long long
#define sz(s) (int)s.size()
#define pb push_back
#define in insert
#define lb lower_bound
#define ub upper_bound

using namespace std;

const int MAX=2e5+10;

vector<int> a;
int cnt[MAX];
set<int> st;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int rnd(int l,int r){
    return rng()%(r-l+1)+l;
}

void solve(int l,int r,vector<int> b){
    if(b.empty())return;
    if(l==r){
        cnt[l]+=sz(b);
        return;
    }
    int m=rnd(l,r);
    while(st.ub(m)!=st.end()&&*st.ub(m)<=r){
        move_outside(a[*st.ub(m)]);
        st.erase(st.ub(m));
    }
    vector<int> L,R;
    for(int i=l;i<=m;i++){
        if(!st.count(i))move_inside(a[i]);
        st.in(i);
    }
    for(int i:b){
        move_inside(i);
        if(press_button()==2)L.pb(i);
        else R.pb(i);
        move_outside(i);
    }
    solve(l,m,L);
    solve(m+1,r,R);
}

int min_cardinality(int N){
    vector<int> b;
    for(int i=0;i<N;i++){
        move_inside(i);
        if(press_button()==2){
            b.pb(i);
            move_outside(i);
        }
        else{
            st.in(sz(a));
            a.pb(i);
        }
    }
    solve(0,sz(a)-1,b);
    int ans=N;
    for(int i=0;i<sz(a);i++)ans=min(ans,cnt[i]+1);
    return ans;
}
//
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 2 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 6 ms 460 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 3 ms 452 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 4 ms 344 KB Output is correct
16 Correct 6 ms 344 KB Output is correct
17 Correct 9 ms 456 KB Output is correct
18 Correct 8 ms 456 KB Output is correct
19 Correct 9 ms 712 KB Output is correct
20 Correct 9 ms 460 KB Output is correct
21 Correct 6 ms 460 KB Output is correct
22 Correct 7 ms 464 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 2 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 6 ms 460 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 3 ms 452 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 4 ms 344 KB Output is correct
16 Correct 6 ms 344 KB Output is correct
17 Correct 9 ms 456 KB Output is correct
18 Correct 8 ms 456 KB Output is correct
19 Correct 9 ms 712 KB Output is correct
20 Correct 9 ms 460 KB Output is correct
21 Correct 6 ms 460 KB Output is correct
22 Correct 7 ms 464 KB Output is correct
23 Correct 5 ms 600 KB Output is correct
24 Correct 3 ms 344 KB Output is correct
25 Correct 34 ms 720 KB Output is correct
26 Correct 62 ms 716 KB Output is correct
27 Correct 31 ms 600 KB Output is correct
28 Correct 34 ms 472 KB Output is correct
29 Correct 35 ms 716 KB Output is correct
30 Correct 51 ms 716 KB Output is correct
31 Correct 18 ms 712 KB Output is correct
32 Correct 39 ms 604 KB Output is correct
33 Correct 46 ms 700 KB Output is correct
34 Correct 37 ms 688 KB Output is correct
35 Correct 43 ms 704 KB Output is correct
36 Correct 44 ms 472 KB Output is correct
37 Correct 47 ms 600 KB Output is correct
38 Correct 60 ms 968 KB Output is correct
39 Correct 50 ms 960 KB Output is correct
40 Correct 61 ms 468 KB Output is correct
41 Correct 44 ms 724 KB Output is correct
# 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 504 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 13 ms 344 KB Output is correct
8 Correct 11 ms 856 KB Output is correct
9 Partially correct 108 ms 740 KB Output is partially correct
10 Partially correct 127 ms 852 KB Output is partially correct
11 Correct 24 ms 608 KB Output is correct
12 Partially correct 49 ms 600 KB Output is partially correct
13 Partially correct 42 ms 732 KB Output is partially correct
14 Partially correct 103 ms 776 KB Output is partially correct
15 Partially correct 39 ms 720 KB Output is partially correct
16 Partially correct 60 ms 752 KB Output is partially correct
17 Partially correct 85 ms 732 KB Output is partially correct
18 Partially correct 71 ms 488 KB Output is partially correct
19 Partially correct 86 ms 776 KB Output is partially correct
20 Partially correct 65 ms 744 KB Output is partially correct
21 Partially correct 112 ms 600 KB Output is partially correct
22 Partially correct 123 ms 876 KB Output is partially correct
23 Partially correct 153 ms 716 KB Output is partially correct
24 Partially correct 143 ms 524 KB Output is partially correct
25 Partially correct 115 ms 600 KB Output is partially correct
26 Partially correct 90 ms 344 KB Output is partially correct
27 Partially correct 139 ms 720 KB Output is partially correct
28 Partially correct 106 ms 996 KB Output is partially correct
29 Partially correct 101 ms 712 KB Output is partially correct
30 Partially correct 92 ms 848 KB Output is partially correct
31 Partially correct 111 ms 592 KB Output is partially correct
32 Partially correct 106 ms 720 KB Output is partially correct
33 Partially correct 95 ms 600 KB Output is partially correct
34 Partially correct 135 ms 736 KB Output is partially correct
35 Partially correct 108 ms 496 KB Output is partially correct
36 Partially correct 135 ms 712 KB Output is partially correct
37 Partially correct 142 ms 744 KB Output is partially correct
38 Partially correct 112 ms 604 KB Output is partially correct
39 Partially correct 130 ms 860 KB Output is partially correct
40 Partially correct 136 ms 616 KB Output is partially correct
41 Partially correct 120 ms 476 KB Output is partially correct
42 Partially correct 121 ms 592 KB Output is partially correct
43 Partially correct 10 ms 344 KB Output is partially correct
44 Partially correct 52 ms 344 KB Output is partially correct
45 Correct 25 ms 344 KB Output is correct
46 Partially correct 50 ms 724 KB Output is partially correct
47 Partially correct 34 ms 744 KB Output is partially correct
48 Partially correct 80 ms 1276 KB Output is partially correct