Submission #831329

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
831329	2023-08-20T05:19:09 Z	definitelynotmee	Rarest Insects (IOI22_insects)	C++17	99.83 / 100	56 ms	488 KB

insects

// Fourth 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) {

    vector<int> dif;
    vector<int> v;

    Machine m;

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




    m.clear();

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

    vector<int> curinsert, lastinsert;

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

            if(m.s.size() == dif.size()*mx)
                break;
        }
    };

    int last = -1;

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

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

            for(int i : m.s)
                newv.push_back(i);
            swap(v,newv);
            for(int i : lastinsert)
                m.erase(i);
        }
        
        putless(mid);

        bool ok = m.s.size()%mid == 0 && m.s.size()/mid == dif.size();
        if(ok)
            ini = mid;
        else fim = mid-1;
        last = mid;

        swap(curinsert,lastinsert);
        curinsert.clear();
    } 
    return ini;

    

}

Subtask #1
10.0 / 10.0

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

Subtask #3
74.83 / 75.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	1 ms	208 KB	Output is correct
6	Correct	0 ms	208 KB	Output is correct
7	Correct	25 ms	408 KB	Output is correct
8	Correct	17 ms	328 KB	Output is correct
9	Correct	45 ms	368 KB	Output is correct
10	Correct	37 ms	312 KB	Output is correct
11	Correct	46 ms	308 KB	Output is correct
12	Correct	31 ms	320 KB	Output is correct
13	Correct	40 ms	304 KB	Output is correct
14	Correct	41 ms	356 KB	Output is correct
15	Correct	32 ms	304 KB	Output is correct
16	Correct	39 ms	304 KB	Output is correct
17	Correct	39 ms	304 KB	Output is correct
18	Correct	35 ms	376 KB	Output is correct
19	Correct	39 ms	296 KB	Output is correct
20	Correct	31 ms	300 KB	Output is correct
21	Correct	46 ms	344 KB	Output is correct
22	Partially correct	30 ms	356 KB	Output is partially correct
23	Correct	42 ms	328 KB	Output is correct
24	Correct	48 ms	320 KB	Output is correct
25	Correct	36 ms	368 KB	Output is correct
26	Correct	18 ms	320 KB	Output is correct
27	Correct	34 ms	308 KB	Output is correct
28	Correct	16 ms	300 KB	Output is correct
29	Partially correct	35 ms	304 KB	Output is partially correct
30	Partially correct	56 ms	308 KB	Output is partially correct
31	Correct	36 ms	300 KB	Output is correct
32	Correct	48 ms	304 KB	Output is correct
33	Correct	26 ms	316 KB	Output is correct
34	Correct	44 ms	368 KB	Output is correct
35	Partially correct	52 ms	384 KB	Output is partially correct
36	Correct	24 ms	372 KB	Output is correct
37	Correct	45 ms	432 KB	Output is correct
38	Correct	36 ms	312 KB	Output is correct
39	Correct	46 ms	304 KB	Output is correct
40	Correct	26 ms	316 KB	Output is correct
41	Correct	48 ms	316 KB	Output is correct
42	Partially correct	52 ms	488 KB	Output is partially correct
43	Correct	9 ms	208 KB	Output is correct
44	Correct	41 ms	304 KB	Output is correct
45	Correct	32 ms	300 KB	Output is correct
46	Correct	26 ms	312 KB	Output is correct
47	Correct	25 ms	344 KB	Output is correct
48	Correct	37 ms	340 KB	Output is correct

Submission #831329

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 15.0 / 15.0

Subtask #3 74.83 / 75.0

Subtask #1
10.0 / 10.0

Subtask #2
15.0 / 15.0

Subtask #3
74.83 / 75.0