oj.uz

Submission #831330

# Submission time Handle Problem Language Result Execution time Memory
831330 2023-08-20T05:20:38 Z definitelynotmee Rarest Insects (IOI22_insects) C++17
100 / 100
 55 ms 484 KB 
// Fifth 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> 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);
    }

    shuffle(all(v),rng);


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

Subtask #3
75.0 / 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 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 37 ms 388 KB Output is correct
8 Correct 19 ms 336 KB Output is correct
9 Correct 26 ms 316 KB Output is correct
10 Correct 41 ms 456 KB Output is correct
11 Correct 37 ms 440 KB Output is correct
12 Correct 19 ms 340 KB Output is correct
13 Correct 34 ms 292 KB Output is correct
14 Correct 37 ms 324 KB Output is correct
15 Correct 34 ms 428 KB Output is correct
16 Correct 38 ms 348 KB Output is correct
17 Correct 31 ms 304 KB Output is correct
18 Correct 33 ms 308 KB Output is correct
19 Correct 30 ms 308 KB Output is correct
20 Correct 35 ms 416 KB Output is correct
21 Correct 30 ms 328 KB Output is correct
22 Correct 33 ms 312 KB Output is correct
23 Correct 30 ms 320 KB Output is correct
24 Correct 47 ms 336 KB Output is correct
25 Correct 24 ms 456 KB Output is correct
26 Correct 14 ms 356 KB Output is correct
27 Correct 36 ms 304 KB Output is correct
28 Correct 38 ms 308 KB Output is correct
29 Correct 29 ms 380 KB Output is correct
30 Correct 41 ms 300 KB Output is correct
31 Correct 37 ms 456 KB Output is correct
32 Correct 43 ms 332 KB Output is correct
33 Correct 38 ms 316 KB Output is correct
34 Correct 55 ms 316 KB Output is correct
35 Correct 38 ms 384 KB Output is correct
36 Correct 39 ms 424 KB Output is correct
37 Correct 50 ms 308 KB Output is correct
38 Correct 31 ms 304 KB Output is correct
39 Correct 39 ms 380 KB Output is correct
40 Correct 28 ms 364 KB Output is correct
41 Correct 28 ms 484 KB Output is correct
42 Correct 31 ms 316 KB Output is correct
43 Correct 7 ms 208 KB Output is correct
44 Correct 29 ms 308 KB Output is correct
45 Correct 31 ms 316 KB Output is correct
46 Correct 30 ms 308 KB Output is correct
47 Correct 34 ms 316 KB Output is correct
48 Correct 16 ms 312 KB Output is correct