Submission #831324

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
831324	2023-08-20T04:58:40 Z	definitelynotmee	Rarest Insects (IOI22_insects)	C++17	90.09 / 100	89 ms	504 KB

insects

// Second submission after reading edi
#include "insects.h"
#include<bits/stdc++.h>
#define all(x) x.begin(), x.end()
using ll = long long;
using namespace std;
template<typename T>
using matrix = vector<vector<T>>;


struct Machine {
    set<int> s;

    void insert(int id){
        s.insert(id);
        move_inside(id);
    }
    void erase(int id){
        s.erase(id);
        move_outside(id);
    }

    int resp(){
        return press_button();
    }
    void clear(){
        auto it  = s.begin();
        while(it!=s.end()){
            move_outside(*it);
            it = s.erase(it);
        }
    }
};

int min_cardinality(int N) {
    mt19937 rng(time(nullptr));
    vector<int> dif;
    vector<int> resto;

    Machine m;

    for(int i = 0; i < N; i++){
        m.insert(i);
        if(m.resp() == 1){
            dif.push_back(i);
        } else m.erase(i), resto.push_back(i);
    }

    shuffle(all(dif),rng);
    shuffle(all(resto),rng);


    m.clear();

    int ini = 1, fim = N/dif.size();


    auto putless =[&](int mx){
        for(int i : resto){
            if(m.s.count(i))
                continue;
            m.insert(i);
            if(m.resp() > mx)
                m.erase(i);
        }
    };

    int last = -1;

    while(ini!=fim){
        int mid = (ini+fim+1)>>1;

        // cerr << "mid = " << mid << '\n';
        
        if(mid < last){
            vector<int> newresto;

            for(int i : m.s)
                newresto.push_back(i);
            swap(resto,newresto);
            m.clear();
        }
        
        putless(mid-1);

        bool ok = 1;

        for(int i : dif){
            m.insert(i);
            ok&= m.resp() == mid;
            m.erase(i);
        }

        if(ok)
            ini = mid;
        else fim = mid-1;
        last = mid;
    } 
    return ini;

    

}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	0 ms	208 KB	Output is correct
6	Correct	6 ms	308 KB	Output is correct
7	Correct	2 ms	208 KB	Output is correct
8	Correct	6 ms	208 KB	Output is correct
9	Correct	5 ms	336 KB	Output is correct
10	Correct	5 ms	208 KB	Output is correct
11	Correct	3 ms	208 KB	Output is correct
12	Correct	5 ms	208 KB	Output is correct
13	Correct	5 ms	208 KB	Output is correct
14	Correct	7 ms	208 KB	Output is correct
15	Correct	7 ms	208 KB	Output is correct
16	Correct	5 ms	208 KB	Output is correct
17	Correct	6 ms	208 KB	Output is correct
18	Correct	5 ms	208 KB	Output is correct
19	Correct	7 ms	208 KB	Output is correct
20	Correct	4 ms	304 KB	Output is correct
21	Correct	3 ms	304 KB	Output is correct
22	Correct	2 ms	208 KB	Output is correct

Subtask #2
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	0 ms	208 KB	Output is correct
6	Correct	6 ms	308 KB	Output is correct
7	Correct	2 ms	208 KB	Output is correct
8	Correct	6 ms	208 KB	Output is correct
9	Correct	5 ms	336 KB	Output is correct
10	Correct	5 ms	208 KB	Output is correct
11	Correct	3 ms	208 KB	Output is correct
12	Correct	5 ms	208 KB	Output is correct
13	Correct	5 ms	208 KB	Output is correct
14	Correct	7 ms	208 KB	Output is correct
15	Correct	7 ms	208 KB	Output is correct
16	Correct	5 ms	208 KB	Output is correct
17	Correct	6 ms	208 KB	Output is correct
18	Correct	5 ms	208 KB	Output is correct
19	Correct	7 ms	208 KB	Output is correct
20	Correct	4 ms	304 KB	Output is correct
21	Correct	3 ms	304 KB	Output is correct
22	Correct	2 ms	208 KB	Output is correct
23	Correct	34 ms	304 KB	Output is correct
24	Correct	9 ms	332 KB	Output is correct
25	Correct	28 ms	328 KB	Output is correct
26	Correct	40 ms	304 KB	Output is correct
27	Correct	17 ms	208 KB	Output is correct
28	Correct	9 ms	320 KB	Output is correct
29	Correct	19 ms	208 KB	Output is correct
30	Correct	25 ms	312 KB	Output is correct
31	Correct	32 ms	336 KB	Output is correct
32	Correct	49 ms	304 KB	Output is correct
33	Correct	36 ms	304 KB	Output is correct
34	Correct	24 ms	320 KB	Output is correct
35	Correct	27 ms	308 KB	Output is correct
36	Correct	26 ms	304 KB	Output is correct
37	Correct	35 ms	312 KB	Output is correct
38	Correct	22 ms	308 KB	Output is correct
39	Correct	22 ms	308 KB	Output is correct
40	Correct	12 ms	208 KB	Output is correct
41	Correct	7 ms	208 KB	Output is correct

Subtask #3
65.09 / 75.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	1 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	0 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	28 ms	504 KB	Output is correct
8	Correct	18 ms	360 KB	Output is correct
9	Partially correct	57 ms	312 KB	Output is partially correct
10	Partially correct	50 ms	376 KB	Output is partially correct
11	Correct	25 ms	308 KB	Output is correct
12	Correct	16 ms	340 KB	Output is correct
13	Correct	25 ms	304 KB	Output is correct
14	Correct	50 ms	300 KB	Output is correct
15	Partially correct	89 ms	300 KB	Output is partially correct
16	Partially correct	60 ms	420 KB	Output is partially correct
17	Partially correct	80 ms	396 KB	Output is partially correct
18	Partially correct	81 ms	384 KB	Output is partially correct
19	Partially correct	48 ms	312 KB	Output is partially correct
20	Partially correct	53 ms	308 KB	Output is partially correct
21	Partially correct	70 ms	304 KB	Output is partially correct
22	Partially correct	56 ms	308 KB	Output is partially correct
23	Correct	52 ms	308 KB	Output is correct
24	Correct	35 ms	336 KB	Output is correct
25	Correct	35 ms	328 KB	Output is correct
26	Correct	17 ms	332 KB	Output is correct
27	Partially correct	52 ms	368 KB	Output is partially correct
28	Partially correct	36 ms	360 KB	Output is partially correct
29	Partially correct	47 ms	360 KB	Output is partially correct
30	Partially correct	53 ms	304 KB	Output is partially correct
31	Partially correct	81 ms	372 KB	Output is partially correct
32	Partially correct	69 ms	460 KB	Output is partially correct
33	Correct	41 ms	312 KB	Output is correct
34	Correct	45 ms	316 KB	Output is correct
35	Partially correct	60 ms	296 KB	Output is partially correct
36	Partially correct	36 ms	460 KB	Output is partially correct
37	Partially correct	40 ms	376 KB	Output is partially correct
38	Partially correct	58 ms	316 KB	Output is partially correct
39	Correct	39 ms	328 KB	Output is correct
40	Correct	34 ms	300 KB	Output is correct
41	Partially correct	54 ms	300 KB	Output is partially correct
42	Partially correct	44 ms	344 KB	Output is partially correct
43	Correct	9 ms	208 KB	Output is correct
44	Correct	27 ms	304 KB	Output is correct
45	Correct	48 ms	308 KB	Output is correct
46	Correct	33 ms	328 KB	Output is correct
47	Correct	35 ms	348 KB	Output is correct
48	Correct	27 ms	336 KB	Output is correct

Submission #831324

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 15.0 / 15.0

Subtask #3 65.09 / 75.0

Subtask #1
10.0 / 10.0

Subtask #2
15.0 / 15.0

Subtask #3
65.09 / 75.0