Submission #936653

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
936653	2024-03-02T12:43:26 Z	GrindMachine	Rarest Insects (IOI22_insects)	C++17	62.5 / 100	87 ms	1456 KB

insects

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
 
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
 
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
 
template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}
 
template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}
 
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
 
/*
 
 
 
*/
 
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
 
#include "insects.h"
 
int go(vector<int> uniq_guys, vector<int> pos){
    int uniq = sz(uniq_guys);
    if(uniq == 1){
        return sz(pos);
    }

    int mid = uniq/2;
    vector<int> uniq_l, uniq_r;
    vector<int> pos_l, pos_r;
    
    rep(ind,uniq){
        int i = uniq_guys[ind];
        if(ind < mid){
            move_inside(i);
            uniq_l.pb(i);
            pos_l.pb(i);
        }
        else{
            uniq_r.pb(i);
            pos_r.pb(i);
        }
    }

    trav(i,pos){
        if(binary_search(all(uniq_guys),i)){
            conts;
        }

        move_inside(i);

        int res = press_button();
        if(res == 2){
            pos_l.pb(i);
        }
        else{
            pos_r.pb(i);
        }

        move_outside(i);
    }

    trav(i,uniq_l){
        move_outside(i);
    }

    int ans = min(go(uniq_l,pos_l), go(uniq_r,pos_r));
    return ans;
}

int min_cardinality(int n) {
    set<int> uniq_guys;
 
    rep(i,n){
        move_inside(i);
        int res = press_button();
        if(res >= 2){
            move_outside(i);
        }
        else{
            uniq_guys.insert(i);
        }
    }

    trav(i,uniq_guys){
        move_outside(i);
    }
    
    if(sz(uniq_guys) < 16){
        vector<int> v1(all(uniq_guys));
        vector<int> v2(n);
        rep(i,n) v2[i] = i;
        int ans = go(v1,v2);
        return ans;
    }

    vector<bool> ignore(n);

    auto ok = [&](int mid){
        vector<int> good, bad;
 
        rev(i,n-1,0){
            if(ignore[i]) conts;
            move_inside(i);
            int res = press_button();
            if(res > mid){
                bad.pb(i);
                move_outside(i);
            }
            else{
                good.pb(i);
            }
        }
 
        trav(i,good){
            move_outside(i);
        }

        int curr_uniq = 0;
        trav(i,bad){
            curr_uniq += uniq_guys.count(i);
        }

        if(curr_uniq >= sz(uniq_guys)) return false;
            
        trav(i,bad){
            if(uniq_guys.count(i)){
                uniq_guys.erase(i);
            }
            ignore[i] = 1;
        }

        return true;        
    };

    int l = 1, r = n/sz(uniq_guys)-1;
    int ans = n/sz(uniq_guys);
 
    while(l <= r){
        int mid = (l+r) >> 1;
        // is min <= mid?
        if(ok(mid)){
            ans = mid;
            r = mid-1;
        }
        else{
            l = mid+1;
        }
    }
 
    return ans;
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	500 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	1 ms	356 KB	Output is correct
7	Correct	1 ms	600 KB	Output is correct
8	Correct	5 ms	600 KB	Output is correct
9	Correct	4 ms	600 KB	Output is correct
10	Correct	2 ms	600 KB	Output is correct
11	Correct	2 ms	600 KB	Output is correct
12	Correct	3 ms	600 KB	Output is correct
13	Correct	4 ms	440 KB	Output is correct
14	Correct	4 ms	600 KB	Output is correct
15	Correct	4 ms	856 KB	Output is correct
16	Correct	4 ms	856 KB	Output is correct
17	Correct	4 ms	692 KB	Output is correct
18	Correct	4 ms	600 KB	Output is correct
19	Correct	4 ms	600 KB	Output is correct
20	Correct	2 ms	600 KB	Output is correct
21	Correct	2 ms	600 KB	Output is correct
22	Correct	1 ms	600 KB	Output is correct

Subtask #2

15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	500 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	1 ms	356 KB	Output is correct
7	Correct	1 ms	600 KB	Output is correct
8	Correct	5 ms	600 KB	Output is correct
9	Correct	4 ms	600 KB	Output is correct
10	Correct	2 ms	600 KB	Output is correct
11	Correct	2 ms	600 KB	Output is correct
12	Correct	3 ms	600 KB	Output is correct
13	Correct	4 ms	440 KB	Output is correct
14	Correct	4 ms	600 KB	Output is correct
15	Correct	4 ms	856 KB	Output is correct
16	Correct	4 ms	856 KB	Output is correct
17	Correct	4 ms	692 KB	Output is correct
18	Correct	4 ms	600 KB	Output is correct
19	Correct	4 ms	600 KB	Output is correct
20	Correct	2 ms	600 KB	Output is correct
21	Correct	2 ms	600 KB	Output is correct
22	Correct	1 ms	600 KB	Output is correct
23	Correct	5 ms	344 KB	Output is correct
24	Correct	4 ms	708 KB	Output is correct
25	Correct	28 ms	924 KB	Output is correct
26	Correct	23 ms	672 KB	Output is correct
27	Correct	11 ms	436 KB	Output is correct
28	Correct	5 ms	856 KB	Output is correct
29	Correct	17 ms	696 KB	Output is correct
30	Correct	17 ms	436 KB	Output is correct
31	Correct	18 ms	672 KB	Output is correct
32	Correct	17 ms	848 KB	Output is correct
33	Correct	17 ms	600 KB	Output is correct
34	Correct	27 ms	936 KB	Output is correct
35	Correct	28 ms	1200 KB	Output is correct
36	Correct	30 ms	680 KB	Output is correct
37	Correct	21 ms	852 KB	Output is correct
38	Correct	12 ms	676 KB	Output is correct
39	Correct	10 ms	688 KB	Output is correct
40	Correct	9 ms	856 KB	Output is correct
41	Correct	4 ms	872 KB	Output is correct

Subtask #3

37.5 / 75.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	1 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	11 ms	600 KB	Output is correct
8	Correct	11 ms	1200 KB	Output is correct
9	Partially correct	70 ms	932 KB	Output is partially correct
10	Partially correct	47 ms	928 KB	Output is partially correct
11	Correct	17 ms	692 KB	Output is correct
12	Correct	20 ms	1372 KB	Output is correct
13	Partially correct	27 ms	696 KB	Output is partially correct
14	Correct	26 ms	852 KB	Output is correct
15	Partially correct	31 ms	716 KB	Output is partially correct
16	Partially correct	38 ms	1180 KB	Output is partially correct
17	Partially correct	44 ms	952 KB	Output is partially correct
18	Partially correct	43 ms	716 KB	Output is partially correct
19	Partially correct	46 ms	884 KB	Output is partially correct
20	Partially correct	70 ms	608 KB	Output is partially correct
21	Partially correct	42 ms	1336 KB	Output is partially correct
22	Partially correct	42 ms	1176 KB	Output is partially correct
23	Correct	23 ms	944 KB	Output is correct
24	Correct	24 ms	1204 KB	Output is correct
25	Correct	20 ms	1364 KB	Output is correct
26	Correct	8 ms	1132 KB	Output is correct
27	Partially correct	56 ms	940 KB	Output is partially correct
28	Partially correct	57 ms	676 KB	Output is partially correct
29	Partially correct	87 ms	672 KB	Output is partially correct
30	Partially correct	76 ms	1168 KB	Output is partially correct
31	Partially correct	49 ms	904 KB	Output is partially correct
32	Partially correct	41 ms	1160 KB	Output is partially correct
33	Correct	24 ms	932 KB	Output is correct
34	Correct	26 ms	684 KB	Output is correct
35	Partially correct	75 ms	680 KB	Output is partially correct
36	Partially correct	60 ms	940 KB	Output is partially correct
37	Partially correct	44 ms	692 KB	Output is partially correct
38	Partially correct	43 ms	932 KB	Output is partially correct
39	Partially correct	49 ms	864 KB	Output is partially correct
40	Partially correct	58 ms	1100 KB	Output is partially correct
41	Partially correct	63 ms	920 KB	Output is partially correct
42	Partially correct	70 ms	944 KB	Output is partially correct
43	Partially correct	8 ms	856 KB	Output is partially correct
44	Partially correct	27 ms	952 KB	Output is partially correct
45	Correct	21 ms	668 KB	Output is correct
46	Correct	21 ms	1128 KB	Output is correct
47	Correct	17 ms	1132 KB	Output is correct
48	Correct	18 ms	1456 KB	Output is correct