oj.uz

답안 #831317

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
831317 2023-08-20T04:35:16 Z definitelynotmee 드문 곤충 (IOI22_insects) C++17
87.89 / 100
 84 ms 592 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>>;

const double coef_bin_search = 0.4, coef_sqrt = 0.13;

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() > N*coef_sqrt/dif.size()){
        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)*coef_bin_search+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 {
        int resp = N;

        auto dq =[&](vector<int> dif, vector<int> resto, bool flag, auto dq) -> void {
            if(dif.size() == 1 || resto.size() == 0){
                resp = min(resp,(int)resto.size());
                return;
            }
            
            int mid = dif.size()/2;

            if(flag){
                for(int i = mid; i < dif.size(); i++)
                    m.erase(dif[i]);
            } else{
                for(int i = 0; i < mid; i++){
                    m.insert(dif[i]);
                }
            }

            vector<int> ldif, rdif, lresto, rresto;

            for(int i = 0; i < mid; i++)
                ldif.push_back(dif[i]);
            
            for(int i = mid; i < dif.size(); i++)
                rdif.push_back(dif[i]);
            
            for(int i : resto){
                m.insert(i);
                if(m.resp() == 2)
                    lresto.push_back(i);
                else rresto.push_back(i);
                m.erase(i);
            }

            dq(ldif,lresto,1,dq);
            m.clear();
            dq(rdif,rresto,0,dq);
        };

        
        dq(dif,resto,0,dq);
        return resp+1;
    }
    

    

}

Compilation message

insects.cpp: In lambda function:
insects.cpp:109:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  109 |                 for(int i = mid; i < dif.size(); i++)
      |                                  ~~^~~~~~~~~~~~
insects.cpp:122:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 |             for(int i = mid; i < dif.size(); i++)
      |                              ~~^~~~~~~~~~~~
insects.cpp: In instantiation of 'min_cardinality(int)::<lambda(std::vector<int>, std::vector<int>, bool, auto:23)> [with auto:23 = min_cardinality(int)::<lambda(std::vector<int>, std::vector<int>, bool, auto:23)>]':
insects.cpp:139:26:   required from here
insects.cpp:109:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  109 |                 for(int i = mid; i < dif.size(); i++)
      |                                  ~~^~~~~~~~~~~~
insects.cpp:122:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 |             for(int i = mid; i < dif.size(); i++)
      |                              ~~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 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 2 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 7 ms 208 KB Output is correct
10 Correct 3 ms 304 KB Output is correct
11 Correct 2 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 6 ms 308 KB Output is correct
15 Correct 6 ms 208 KB Output is correct
16 Correct 7 ms 308 KB Output is correct
17 Correct 8 ms 208 KB Output is correct
18 Correct 7 ms 208 KB Output is correct
19 Correct 7 ms 304 KB Output is correct
20 Correct 3 ms 208 KB Output is correct
21 Correct 4 ms 300 KB Output is correct
22 Correct 2 ms 208 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 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 2 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 7 ms 208 KB Output is correct
10 Correct 3 ms 304 KB Output is correct
11 Correct 2 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 6 ms 308 KB Output is correct
15 Correct 6 ms 208 KB Output is correct
16 Correct 7 ms 308 KB Output is correct
17 Correct 8 ms 208 KB Output is correct
18 Correct 7 ms 208 KB Output is correct
19 Correct 7 ms 304 KB Output is correct
20 Correct 3 ms 208 KB Output is correct
21 Correct 4 ms 300 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 8 ms 208 KB Output is correct
24 Correct 8 ms 308 KB Output is correct
25 Correct 27 ms 448 KB Output is correct
26 Correct 37 ms 208 KB Output is correct
27 Correct 11 ms 208 KB Output is correct
28 Correct 10 ms 316 KB Output is correct
29 Correct 26 ms 304 KB Output is correct
30 Correct 26 ms 308 KB Output is correct
31 Correct 22 ms 296 KB Output is correct
32 Correct 34 ms 424 KB Output is correct
33 Correct 30 ms 308 KB Output is correct
34 Correct 32 ms 316 KB Output is correct
35 Correct 33 ms 308 KB Output is correct
36 Correct 47 ms 304 KB Output is correct
37 Correct 29 ms 312 KB Output is correct
38 Correct 31 ms 208 KB Output is correct
39 Correct 8 ms 304 KB Output is correct
40 Correct 15 ms 312 KB Output is correct
41 Correct 9 ms 320 KB Output is correct

Subtask #3
62.89 / 75.0

# 결과 실행 시간 메모리 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 Partially correct 1 ms 208 KB Output is partially correct
7 Correct 12 ms 304 KB Output is correct
8 Correct 17 ms 340 KB Output is correct
9 Partially correct 46 ms 328 KB Output is partially correct
10 Partially correct 58 ms 328 KB Output is partially correct
11 Correct 23 ms 312 KB Output is correct
12 Correct 22 ms 336 KB Output is correct
13 Partially correct 56 ms 308 KB Output is partially correct
14 Partially correct 84 ms 308 KB Output is partially correct
15 Partially correct 51 ms 308 KB Output is partially correct
16 Partially correct 47 ms 312 KB Output is partially correct
17 Partially correct 52 ms 308 KB Output is partially correct
18 Partially correct 52 ms 336 KB Output is partially correct
19 Partially correct 57 ms 420 KB Output is partially correct
20 Partially correct 72 ms 328 KB Output is partially correct
21 Partially correct 46 ms 344 KB Output is partially correct
22 Partially correct 53 ms 308 KB Output is partially correct
23 Correct 34 ms 312 KB Output is correct
24 Correct 33 ms 208 KB Output is correct
25 Correct 24 ms 452 KB Output is correct
26 Correct 18 ms 336 KB Output is correct
27 Partially correct 58 ms 308 KB Output is partially correct
28 Partially correct 59 ms 328 KB Output is partially correct
29 Partially correct 67 ms 348 KB Output is partially correct
30 Partially correct 66 ms 372 KB Output is partially correct
31 Partially correct 56 ms 348 KB Output is partially correct
32 Partially correct 60 ms 312 KB Output is partially correct
33 Partially correct 51 ms 304 KB Output is partially correct
34 Partially correct 48 ms 436 KB Output is partially correct
35 Partially correct 70 ms 300 KB Output is partially correct
36 Partially correct 66 ms 360 KB Output is partially correct
37 Partially correct 81 ms 308 KB Output is partially correct
38 Partially correct 70 ms 348 KB Output is partially correct
39 Partially correct 54 ms 368 KB Output is partially correct
40 Partially correct 74 ms 312 KB Output is partially correct
41 Partially correct 55 ms 592 KB Output is partially correct
42 Partially correct 71 ms 304 KB Output is partially correct
43 Partially correct 16 ms 316 KB Output is partially correct
44 Partially correct 61 ms 352 KB Output is partially correct
45 Correct 35 ms 316 KB Output is correct
46 Correct 25 ms 336 KB Output is correct
47 Correct 23 ms 336 KB Output is correct
48 Correct 29 ms 308 KB Output is correct