답안 #831293

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
831293 2023-08-20T03:59:52 Z definitelynotmee 드문 곤충 (IOI22_insects) C++17
70.87 / 100
111 ms 560 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();

    if(dif.size() > sqrt(N)){
        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.3+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;
    } else {
        vector<int> resp(resto.size());

        int logg = log2(dif.size());

        for(int k = 0; k <= logg; k++){
            for(int i = 0; i < dif.size(); i++){
                if((1<<k)&i){
                    if(!m.s.count(dif[i]))
                        m.insert(dif[i]);
                } else {
                    if(m.s.count(dif[i]))
                        m.erase(dif[i]);
                }
            }

            for(int i = 0; i < resto.size(); i++){
                m.insert(resto[i]);
                if(m.resp() == 2)
                    resp[i] |= 1<<k;
                m.erase(resto[i]);
            }
        }

        vector<int> ct(dif.size(), 1);

        for(int i : resp)
            ct[i]++;
        
        return *min_element(all(ct));
    }
    

    

}

Compilation message

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:101:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |             for(int i = 0; i < dif.size(); i++){
      |                            ~~^~~~~~~~~~~~
insects.cpp:111:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  111 |             for(int i = 0; i < resto.size(); i++){
      |                            ~~^~~~~~~~~~~~~~
# 결과 실행 시간 메모리 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 1 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 9 ms 208 KB Output is correct
9 Correct 7 ms 208 KB Output is correct
10 Correct 5 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 7 ms 208 KB Output is correct
13 Correct 9 ms 208 KB Output is correct
14 Correct 6 ms 208 KB Output is correct
15 Correct 9 ms 208 KB Output is correct
16 Correct 8 ms 304 KB Output is correct
17 Correct 5 ms 300 KB Output is correct
18 Correct 6 ms 208 KB Output is correct
19 Correct 5 ms 308 KB Output is correct
20 Correct 3 ms 208 KB Output is correct
21 Correct 3 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
# 결과 실행 시간 메모리 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 1 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 9 ms 208 KB Output is correct
9 Correct 7 ms 208 KB Output is correct
10 Correct 5 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 7 ms 208 KB Output is correct
13 Correct 9 ms 208 KB Output is correct
14 Correct 6 ms 208 KB Output is correct
15 Correct 9 ms 208 KB Output is correct
16 Correct 8 ms 304 KB Output is correct
17 Correct 5 ms 300 KB Output is correct
18 Correct 6 ms 208 KB Output is correct
19 Correct 5 ms 308 KB Output is correct
20 Correct 3 ms 208 KB Output is correct
21 Correct 3 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 13 ms 208 KB Output is correct
24 Correct 7 ms 316 KB Output is correct
25 Correct 52 ms 304 KB Output is correct
26 Correct 42 ms 304 KB Output is correct
27 Correct 27 ms 208 KB Output is correct
28 Correct 7 ms 324 KB Output is correct
29 Correct 33 ms 300 KB Output is correct
30 Correct 39 ms 208 KB Output is correct
31 Correct 26 ms 300 KB Output is correct
32 Correct 42 ms 304 KB Output is correct
33 Correct 43 ms 208 KB Output is correct
34 Correct 40 ms 308 KB Output is correct
35 Correct 32 ms 208 KB Output is correct
36 Correct 40 ms 208 KB Output is correct
37 Correct 33 ms 308 KB Output is correct
38 Correct 17 ms 208 KB Output is correct
39 Correct 13 ms 316 KB Output is correct
40 Correct 16 ms 316 KB Output is correct
41 Correct 9 ms 208 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 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 1 ms 208 KB Output is correct
7 Correct 34 ms 208 KB Output is correct
8 Correct 12 ms 360 KB Output is correct
9 Partially correct 89 ms 312 KB Output is partially correct
10 Partially correct 63 ms 208 KB Output is partially correct
11 Correct 39 ms 288 KB Output is correct
12 Correct 26 ms 340 KB Output is correct
13 Partially correct 69 ms 300 KB Output is partially correct
14 Partially correct 111 ms 304 KB Output is partially correct
15 Partially correct 67 ms 312 KB Output is partially correct
16 Partially correct 50 ms 208 KB Output is partially correct
17 Partially correct 85 ms 312 KB Output is partially correct
18 Partially correct 77 ms 304 KB Output is partially correct
19 Partially correct 73 ms 208 KB Output is partially correct
20 Partially correct 89 ms 456 KB Output is partially correct
21 Partially correct 69 ms 312 KB Output is partially correct
22 Partially correct 56 ms 336 KB Output is partially correct
23 Correct 37 ms 312 KB Output is correct
24 Correct 28 ms 208 KB Output is correct
25 Correct 29 ms 304 KB Output is correct
26 Correct 17 ms 340 KB Output is correct
27 Partially correct 54 ms 312 KB Output is partially correct
28 Partially correct 71 ms 560 KB Output is partially correct
29 Partially correct 103 ms 324 KB Output is partially correct
30 Partially correct 85 ms 208 KB Output is partially correct
31 Partially correct 54 ms 312 KB Output is partially correct
32 Partially correct 70 ms 420 KB Output is partially correct
33 Partially correct 52 ms 208 KB Output is partially correct
34 Partially correct 45 ms 316 KB Output is partially correct
35 Partially correct 56 ms 428 KB Output is partially correct
36 Partially correct 86 ms 304 KB Output is partially correct
37 Partially correct 77 ms 308 KB Output is partially correct
38 Partially correct 92 ms 300 KB Output is partially correct
39 Partially correct 70 ms 312 KB Output is partially correct
40 Partially correct 95 ms 360 KB Output is partially correct
41 Partially correct 81 ms 376 KB Output is partially correct
42 Partially correct 73 ms 304 KB Output is partially correct
43 Partially correct 18 ms 304 KB Output is partially correct
44 Partially correct 50 ms 312 KB Output is partially correct
45 Correct 45 ms 304 KB Output is correct
46 Correct 30 ms 308 KB Output is correct
47 Correct 30 ms 352 KB Output is correct
48 Correct 25 ms 336 KB Output is correct