답안 #831274

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
831274 2023-08-20T03:42:09 Z definitelynotmee 드문 곤충 (IOI22_insects) C++17
62.5 / 100
136 ms 572 KB
#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 = (fim-ini)*0.4+ini;
        while(mid <= ini)
            mid++;

        // cerr << "mid = " << mid << '\n';
        
        if(mid < last)
            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;

}
# 결과 실행 시간 메모리 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 3 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 5 ms 304 KB Output is correct
9 Correct 8 ms 208 KB Output is correct
10 Correct 9 ms 300 KB Output is correct
11 Correct 2 ms 300 KB Output is correct
12 Correct 7 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 6 ms 208 KB Output is correct
16 Correct 6 ms 208 KB Output is correct
17 Correct 5 ms 208 KB Output is correct
18 Correct 4 ms 208 KB Output is correct
19 Correct 6 ms 304 KB Output is correct
20 Correct 2 ms 300 KB Output is correct
21 Correct 4 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
# 결과 실행 시간 메모리 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 3 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 5 ms 304 KB Output is correct
9 Correct 8 ms 208 KB Output is correct
10 Correct 9 ms 300 KB Output is correct
11 Correct 2 ms 300 KB Output is correct
12 Correct 7 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 6 ms 208 KB Output is correct
16 Correct 6 ms 208 KB Output is correct
17 Correct 5 ms 208 KB Output is correct
18 Correct 4 ms 208 KB Output is correct
19 Correct 6 ms 304 KB Output is correct
20 Correct 2 ms 300 KB Output is correct
21 Correct 4 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 25 ms 320 KB Output is correct
24 Correct 7 ms 336 KB Output is correct
25 Correct 25 ms 328 KB Output is correct
26 Correct 42 ms 308 KB Output is correct
27 Correct 47 ms 208 KB Output is correct
28 Correct 6 ms 324 KB Output is correct
29 Correct 50 ms 208 KB Output is correct
30 Correct 36 ms 308 KB Output is correct
31 Correct 19 ms 320 KB Output is correct
32 Correct 43 ms 320 KB Output is correct
33 Correct 38 ms 320 KB Output is correct
34 Correct 26 ms 304 KB Output is correct
35 Correct 25 ms 332 KB Output is correct
36 Correct 49 ms 288 KB Output is correct
37 Correct 35 ms 316 KB Output is correct
38 Correct 33 ms 208 KB Output is correct
39 Correct 13 ms 208 KB Output is correct
40 Correct 18 ms 208 KB Output is correct
41 Correct 8 ms 324 KB Output is correct
# 결과 실행 시간 메모리 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 1 ms 208 KB Output is correct
6 Partially correct 1 ms 208 KB Output is partially correct
7 Partially correct 62 ms 572 KB Output is partially correct
8 Correct 17 ms 352 KB Output is correct
9 Partially correct 57 ms 368 KB Output is partially correct
10 Partially correct 60 ms 312 KB Output is partially correct
11 Partially correct 101 ms 208 KB Output is partially correct
12 Correct 26 ms 328 KB Output is correct
13 Partially correct 136 ms 208 KB Output is partially correct
14 Partially correct 76 ms 312 KB Output is partially correct
15 Partially correct 69 ms 348 KB Output is partially correct
16 Partially correct 40 ms 376 KB Output is partially correct
17 Partially correct 60 ms 308 KB Output is partially correct
18 Partially correct 77 ms 364 KB Output is partially correct
19 Partially correct 55 ms 328 KB Output is partially correct
20 Partially correct 89 ms 284 KB Output is partially correct
21 Partially correct 50 ms 424 KB Output is partially correct
22 Partially correct 67 ms 316 KB Output is partially correct
23 Correct 49 ms 316 KB Output is correct
24 Correct 29 ms 324 KB Output is correct
25 Correct 25 ms 444 KB Output is correct
26 Correct 14 ms 336 KB Output is correct
27 Partially correct 60 ms 344 KB Output is partially correct
28 Partially correct 60 ms 328 KB Output is partially correct
29 Partially correct 61 ms 324 KB Output is partially correct
30 Partially correct 48 ms 484 KB Output is partially correct
31 Partially correct 65 ms 312 KB Output is partially correct
32 Partially correct 81 ms 328 KB Output is partially correct
33 Partially correct 56 ms 312 KB Output is partially correct
34 Partially correct 59 ms 208 KB Output is partially correct
35 Partially correct 51 ms 360 KB Output is partially correct
36 Partially correct 55 ms 324 KB Output is partially correct
37 Partially correct 88 ms 352 KB Output is partially correct
38 Partially correct 68 ms 316 KB Output is partially correct
39 Partially correct 59 ms 324 KB Output is partially correct
40 Partially correct 60 ms 304 KB Output is partially correct
41 Partially correct 47 ms 492 KB Output is partially correct
42 Partially correct 48 ms 312 KB Output is partially correct
43 Partially correct 12 ms 208 KB Output is partially correct
44 Partially correct 114 ms 308 KB Output is partially correct
45 Partially correct 59 ms 424 KB Output is partially correct
46 Correct 29 ms 328 KB Output is correct
47 Correct 36 ms 332 KB Output is correct
48 Correct 26 ms 304 KB Output is correct