Submission #936666

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
936666	2024-03-02T13:12:16 Z	GrindMachine	Rarest Insects (IOI22_insects)	C++17	71.41 / 100	76 ms	1616 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"
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int go(vector<int> uniq_guys, vector<int> pos){
    int uniq = sz(uniq_guys);
    if(uniq == 1){
        return sz(pos);
    }
    if(sz(pos) < uniq*2){
        return 1;
    }

    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);
        }
    }

    set<int> st(all(uniq_guys));

    trav(i,pos){
        if(st.count(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) {
    vector<int> order(n);
    rep(i,n) order[i] = i;
    shuffle(all(order),rng);

    set<int> uniq_guys;
 
    trav(i,order){
        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) == 1){
        return n;
    }

    if(sz(uniq_guys) == n){
        return 1;
    }

    int cost1 = __lg(n/sz(uniq_guys)-1)+1;
    int cost2 = __lg(sz(uniq_guys)-1)+1;

    if(cost2 <= cost1){
        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(ind,n-1,0){
            int i = order[ind];
            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	0 ms	596 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	1 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	1 ms	344 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	4 ms	856 KB	Output is correct
9	Correct	4 ms	952 KB	Output is correct
10	Correct	2 ms	600 KB	Output is correct
11	Correct	1 ms	600 KB	Output is correct
12	Correct	3 ms	856 KB	Output is correct
13	Correct	5 ms	600 KB	Output is correct
14	Correct	4 ms	440 KB	Output is correct
15	Correct	3 ms	856 KB	Output is correct
16	Correct	4 ms	600 KB	Output is correct
17	Correct	4 ms	600 KB	Output is correct
18	Correct	4 ms	604 KB	Output is correct
19	Correct	4 ms	600 KB	Output is correct
20	Correct	2 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	596 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	1 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	1 ms	344 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	4 ms	856 KB	Output is correct
9	Correct	4 ms	952 KB	Output is correct
10	Correct	2 ms	600 KB	Output is correct
11	Correct	1 ms	600 KB	Output is correct
12	Correct	3 ms	856 KB	Output is correct
13	Correct	5 ms	600 KB	Output is correct
14	Correct	4 ms	440 KB	Output is correct
15	Correct	3 ms	856 KB	Output is correct
16	Correct	4 ms	600 KB	Output is correct
17	Correct	4 ms	600 KB	Output is correct
18	Correct	4 ms	604 KB	Output is correct
19	Correct	4 ms	600 KB	Output is correct
20	Correct	2 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	5 ms	344 KB	Output is correct
24	Correct	4 ms	968 KB	Output is correct
25	Correct	27 ms	796 KB	Output is correct
26	Correct	30 ms	868 KB	Output is correct
27	Correct	8 ms	700 KB	Output is correct
28	Correct	4 ms	600 KB	Output is correct
29	Correct	15 ms	692 KB	Output is correct
30	Correct	23 ms	856 KB	Output is correct
31	Correct	17 ms	856 KB	Output is correct
32	Correct	16 ms	940 KB	Output is correct
33	Correct	22 ms	948 KB	Output is correct
34	Correct	25 ms	1104 KB	Output is correct
35	Correct	25 ms	940 KB	Output is correct
36	Correct	27 ms	1196 KB	Output is correct
37	Correct	24 ms	596 KB	Output is correct
38	Correct	13 ms	448 KB	Output is correct
39	Correct	11 ms	608 KB	Output is correct
40	Correct	8 ms	608 KB	Output is correct
41	Correct	4 ms	600 KB	Output is correct

Subtask #3

46.41 / 75.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	1 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	8 ms	344 KB	Output is correct
8	Correct	11 ms	1468 KB	Output is correct
9	Partially correct	65 ms	736 KB	Output is partially correct
10	Partially correct	58 ms	1452 KB	Output is partially correct
11	Correct	17 ms	848 KB	Output is correct
12	Correct	19 ms	960 KB	Output is correct
13	Partially correct	28 ms	956 KB	Output is partially correct
14	Partially correct	57 ms	984 KB	Output is partially correct
15	Partially correct	35 ms	888 KB	Output is partially correct
16	Partially correct	37 ms	628 KB	Output is partially correct
17	Partially correct	45 ms	692 KB	Output is partially correct
18	Partially correct	47 ms	968 KB	Output is partially correct
19	Partially correct	41 ms	1220 KB	Output is partially correct
20	Partially correct	64 ms	1192 KB	Output is partially correct
21	Partially correct	70 ms	1616 KB	Output is partially correct
22	Partially correct	38 ms	1188 KB	Output is partially correct
23	Correct	25 ms	704 KB	Output is correct
24	Correct	25 ms	980 KB	Output is correct
25	Correct	19 ms	860 KB	Output is correct
26	Correct	12 ms	1112 KB	Output is correct
27	Partially correct	55 ms	1192 KB	Output is partially correct
28	Partially correct	50 ms	440 KB	Output is partially correct
29	Partially correct	52 ms	864 KB	Output is partially correct
30	Partially correct	54 ms	956 KB	Output is partially correct
31	Partially correct	64 ms	1144 KB	Output is partially correct
32	Partially correct	64 ms	968 KB	Output is partially correct
33	Correct	31 ms	944 KB	Output is correct
34	Correct	34 ms	712 KB	Output is correct
35	Partially correct	73 ms	972 KB	Output is partially correct
36	Partially correct	61 ms	1484 KB	Output is partially correct
37	Partially correct	76 ms	1236 KB	Output is partially correct
38	Partially correct	68 ms	964 KB	Output is partially correct
39	Partially correct	45 ms	852 KB	Output is partially correct
40	Partially correct	52 ms	684 KB	Output is partially correct
41	Partially correct	70 ms	984 KB	Output is partially correct
42	Partially correct	68 ms	1200 KB	Output is partially correct
43	Partially correct	7 ms	856 KB	Output is partially correct
44	Partially correct	32 ms	1192 KB	Output is partially correct
45	Correct	20 ms	716 KB	Output is correct
46	Correct	24 ms	1112 KB	Output is correct
47	Correct	19 ms	940 KB	Output is correct
48	Correct	17 ms	728 KB	Output is correct