Submission #936625

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
936625	2024-03-02T12:15:50 Z	GrindMachine	Rarest Insects (IOI22_insects)	C++17	58.93 / 100	81 ms	1596 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 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) <= 8){
        vector<bool> marked(n);
        int ans = inf1;

        rep(iter,sz(uniq_guys)-1){
            vector<int> curr;

            rep(i,n){
                if(marked[i]) conts;
                move_inside(i);
                int res = press_button();
                if(res == sz(curr)+1){
                    curr.pb(i);
                }
                else{
                    move_outside(i);
                }
            }

            amin(ans,(int)sz(curr));

            trav(i,curr){
                move_outside(i);
                marked[i] = 1;
            }
        }

        int unmarked = count(all(marked),0);
        amin(ans,unmarked);

        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	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	1 ms	344 KB	Output is correct
7	Correct	2 ms	600 KB	Output is correct
8	Correct	4 ms	600 KB	Output is correct
9	Correct	3 ms	596 KB	Output is correct
10	Correct	2 ms	344 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	3 ms	344 KB	Output is correct
13	Correct	2 ms	600 KB	Output is correct
14	Correct	4 ms	344 KB	Output is correct
15	Correct	4 ms	344 KB	Output is correct
16	Correct	4 ms	600 KB	Output is correct
17	Correct	4 ms	600 KB	Output is correct
18	Correct	3 ms	600 KB	Output is correct
19	Correct	3 ms	344 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	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	1 ms	344 KB	Output is correct
7	Correct	2 ms	600 KB	Output is correct
8	Correct	4 ms	600 KB	Output is correct
9	Correct	3 ms	596 KB	Output is correct
10	Correct	2 ms	344 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	3 ms	344 KB	Output is correct
13	Correct	2 ms	600 KB	Output is correct
14	Correct	4 ms	344 KB	Output is correct
15	Correct	4 ms	344 KB	Output is correct
16	Correct	4 ms	600 KB	Output is correct
17	Correct	4 ms	600 KB	Output is correct
18	Correct	3 ms	600 KB	Output is correct
19	Correct	3 ms	344 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	5 ms	700 KB	Output is correct
25	Correct	28 ms	924 KB	Output is correct
26	Correct	19 ms	856 KB	Output is correct
27	Correct	9 ms	936 KB	Output is correct
28	Correct	4 ms	1120 KB	Output is correct
29	Correct	13 ms	600 KB	Output is correct
30	Correct	11 ms	856 KB	Output is correct
31	Correct	20 ms	344 KB	Output is correct
32	Correct	21 ms	596 KB	Output is correct
33	Correct	33 ms	1176 KB	Output is correct
34	Correct	35 ms	1596 KB	Output is correct
35	Correct	25 ms	440 KB	Output is correct
36	Correct	24 ms	604 KB	Output is correct
37	Correct	19 ms	600 KB	Output is correct
38	Correct	13 ms	1104 KB	Output is correct
39	Correct	9 ms	848 KB	Output is correct
40	Correct	8 ms	1192 KB	Output is correct
41	Correct	5 ms	1112 KB	Output is correct

Subtask #3

33.93 / 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	11 ms	344 KB	Output is correct
8	Correct	8 ms	600 KB	Output is correct
9	Partially correct	57 ms	924 KB	Output is partially correct
10	Partially correct	38 ms	924 KB	Output is partially correct
11	Correct	17 ms	692 KB	Output is correct
12	Correct	17 ms	1112 KB	Output is correct
13	Partially correct	33 ms	592 KB	Output is partially correct
14	Correct	28 ms	860 KB	Output is correct
15	Partially correct	43 ms	344 KB	Output is partially correct
16	Partially correct	48 ms	592 KB	Output is partially correct
17	Partially correct	76 ms	1152 KB	Output is partially correct
18	Partially correct	67 ms	904 KB	Output is partially correct
19	Partially correct	81 ms	896 KB	Output is partially correct
20	Partially correct	70 ms	1104 KB	Output is partially correct
21	Partially correct	47 ms	596 KB	Output is partially correct
22	Partially correct	49 ms	680 KB	Output is partially correct
23	Correct	24 ms	848 KB	Output is correct
24	Correct	25 ms	1364 KB	Output is correct
25	Correct	23 ms	936 KB	Output is correct
26	Correct	9 ms	1368 KB	Output is correct
27	Partially correct	57 ms	1116 KB	Output is partially correct
28	Partially correct	51 ms	1184 KB	Output is partially correct
29	Partially correct	76 ms	924 KB	Output is partially correct
30	Partially correct	68 ms	1080 KB	Output is partially correct
31	Partially correct	40 ms	920 KB	Output is partially correct
32	Partially correct	50 ms	848 KB	Output is partially correct
33	Correct	24 ms	856 KB	Output is correct
34	Correct	25 ms	852 KB	Output is correct
35	Partially correct	64 ms	684 KB	Output is partially correct
36	Partially correct	71 ms	932 KB	Output is partially correct
37	Partially correct	45 ms	1104 KB	Output is partially correct
38	Partially correct	39 ms	916 KB	Output is partially correct
39	Partially correct	50 ms	676 KB	Output is partially correct
40	Partially correct	50 ms	1104 KB	Output is partially correct
41	Partially correct	71 ms	684 KB	Output is partially correct
42	Partially correct	59 ms	1348 KB	Output is partially correct
43	Correct	6 ms	600 KB	Output is correct
44	Correct	18 ms	680 KB	Output is correct
45	Correct	19 ms	680 KB	Output is correct
46	Correct	20 ms	700 KB	Output is correct
47	Correct	18 ms	696 KB	Output is correct
48	Correct	19 ms	952 KB	Output is correct