답안 #972692

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
972692 2024-04-30T22:59:28 Z ALeonidou 드문 곤충 (IOI22_insects) C++17
61.06 / 100
83 ms 1620 KB
#include "insects.h"

#include <variant>
#include <vector>
#include <iostream>
#include <algorithm>
#include <set>
using namespace std;

#define ll int
#define F first
#define S second
#define pb push_back
#define sz(x) (ll)x.size()
#define endl "\n"
#define ins insert

typedef vector <ll> vi;
typedef pair <ll, ll> ii;
typedef vector <ii> vii;
typedef set <ll> si;
    
#define dbg(x) cout<<#x<<": "<<x<<endl;
#define dbg2(x,y) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<endl;
#define dbg3(x,y,z) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<" "<<#z<<": "<<z<<endl;
    
void printVct(vi &v){
    for (ll i =0; i<sz(v); i++){
            cout<<v[i]<<" ";
    }
    cout<<endl;
}

#define MID ((l+r)/2)

void solve(vi &u, si &machine_u, ll l, ll r, vi test_subjects, vi &id){
    if (!sz(test_subjects)) return;
    if (l == r){
        for (ll i =0; i<sz(test_subjects); i++){
            id[test_subjects[i]] = u[l];
        }
    }
    else{
        vi remaining_test_subjects, opposite_remaining_test_subjects;
    
        //left:
        for (ll i = 0; i<sz(u); i++){
            if (l <= i && i <= MID){  //wanted
                if (machine_u.find(u[i]) == machine_u.end()){
                    //add
                    move_inside(u[i]);
                    machine_u.ins(u[i]);
                }  
            }
            else{   //unwanted
                if (machine_u.find(u[i]) != machine_u.end()){
                    //remove
                    move_outside(u[i]);
                    machine_u.erase(u[i]);
                } 
            }
        }
        for (ll i = 0; i<sz(test_subjects); i++){
            move_inside(test_subjects[i]);
            ll x = press_button();
            if (x == 2){
                remaining_test_subjects.pb(test_subjects[i]);
            }
            else{
                opposite_remaining_test_subjects.pb(test_subjects[i]);
            }
            move_outside(test_subjects[i]);
        }
        solve(u, machine_u, l, MID, remaining_test_subjects, id);
    
        //right:
        solve(u, machine_u, MID+1, r, opposite_remaining_test_subjects, id);
    }
}

int min_cardinality(int N){
    ll n = N;
    vi v(n);

    //step 1: make list of unique elements
    vi u(1,0);
    move_inside(0);
    for (ll i =1; i<n;i++){
        move_inside(i);
        ll x = press_button();
        if (x == 2){
            move_outside(i);
        }
        else{
            u.pb(i);
        }
    }
    // printVct(u);

    //step 2: binary search
    set <ll> st;
    for (ll i =0; i<sz(u); i++){
        st.insert(u[i]);
    }
    vi test_subjects, id(n);
    for (ll i =0; i<n; i++){
        if (st.find(i) == st.end()){
            test_subjects.pb(i);
            id[i] = -1;
        }
        else{
            id[i] = i;
        }
    }
    si machine_u;
    for (ll i = 0; i<sz(u); i++) machine_u.insert(u[i]);
    solve(u, machine_u, 0, sz(u)-1, test_subjects, id);

    // printVct(id);

    sort(id.begin(), id.end());

    vi f(n,0);
    for (ll i =0; i<n; i++){
        f[id[i]]++;
    }
    ll ans = 1000000000;
    for (ll i =0; i<n; i++){
        if (f[i]){
            ans = min(ans, f[i]);
        }
    }
    return ans;
}


/*

6
5 8 9 5 9 9

5
1 2 2 3 4


10
1 2 2 6 1 3 3 2 6 1

6
1 2 3 4 5 6

1
1

*/












# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 4 ms 856 KB Output is correct
12 Correct 3 ms 600 KB Output is correct
13 Correct 6 ms 344 KB Output is correct
14 Correct 5 ms 600 KB Output is correct
15 Correct 4 ms 856 KB Output is correct
16 Correct 4 ms 856 KB Output is correct
17 Correct 4 ms 856 KB Output is correct
18 Correct 4 ms 600 KB Output is correct
19 Correct 4 ms 692 KB Output is correct
20 Correct 5 ms 856 KB Output is correct
21 Correct 4 ms 600 KB Output is correct
22 Correct 3 ms 600 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 4 ms 856 KB Output is correct
12 Correct 3 ms 600 KB Output is correct
13 Correct 6 ms 344 KB Output is correct
14 Correct 5 ms 600 KB Output is correct
15 Correct 4 ms 856 KB Output is correct
16 Correct 4 ms 856 KB Output is correct
17 Correct 4 ms 856 KB Output is correct
18 Correct 4 ms 600 KB Output is correct
19 Correct 4 ms 692 KB Output is correct
20 Correct 5 ms 856 KB Output is correct
21 Correct 4 ms 600 KB Output is correct
22 Correct 3 ms 600 KB Output is correct
23 Correct 6 ms 440 KB Output is correct
24 Correct 6 ms 860 KB Output is correct
25 Correct 32 ms 940 KB Output is correct
26 Correct 28 ms 856 KB Output is correct
27 Correct 9 ms 600 KB Output is correct
28 Correct 28 ms 1164 KB Output is correct
29 Correct 13 ms 1364 KB Output is correct
30 Correct 32 ms 704 KB Output is correct
31 Correct 15 ms 608 KB Output is correct
32 Correct 17 ms 692 KB Output is correct
33 Correct 18 ms 1120 KB Output is correct
34 Correct 18 ms 1180 KB Output is correct
35 Correct 33 ms 884 KB Output is correct
36 Correct 28 ms 700 KB Output is correct
37 Correct 27 ms 1104 KB Output is correct
38 Correct 34 ms 856 KB Output is correct
39 Correct 35 ms 948 KB Output is correct
40 Correct 24 ms 680 KB Output is correct
41 Correct 21 ms 604 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 10 ms 416 KB Output is correct
8 Correct 10 ms 860 KB Output is correct
9 Partially correct 61 ms 1144 KB Output is partially correct
10 Partially correct 65 ms 1620 KB Output is partially correct
11 Correct 15 ms 848 KB Output is correct
12 Partially correct 61 ms 1092 KB Output is partially correct
13 Partially correct 30 ms 1188 KB Output is partially correct
14 Partially correct 71 ms 968 KB Output is partially correct
15 Partially correct 48 ms 728 KB Output is partially correct
16 Partially correct 38 ms 592 KB Output is partially correct
17 Partially correct 44 ms 864 KB Output is partially correct
18 Partially correct 59 ms 720 KB Output is partially correct
19 Partially correct 50 ms 728 KB Output is partially correct
20 Partially correct 57 ms 1200 KB Output is partially correct
21 Partially correct 82 ms 980 KB Output is partially correct
22 Partially correct 76 ms 976 KB Output is partially correct
23 Partially correct 71 ms 744 KB Output is partially correct
24 Partially correct 70 ms 600 KB Output is partially correct
25 Partially correct 59 ms 856 KB Output is partially correct
26 Partially correct 45 ms 848 KB Output is partially correct
27 Partially correct 74 ms 464 KB Output is partially correct
28 Partially correct 60 ms 672 KB Output is partially correct
29 Partially correct 60 ms 980 KB Output is partially correct
30 Partially correct 63 ms 1200 KB Output is partially correct
31 Partially correct 72 ms 992 KB Output is partially correct
32 Partially correct 74 ms 884 KB Output is partially correct
33 Partially correct 83 ms 720 KB Output is partially correct
34 Partially correct 67 ms 728 KB Output is partially correct
35 Partially correct 75 ms 848 KB Output is partially correct
36 Partially correct 65 ms 976 KB Output is partially correct
37 Partially correct 68 ms 940 KB Output is partially correct
38 Partially correct 70 ms 716 KB Output is partially correct
39 Partially correct 72 ms 1192 KB Output is partially correct
40 Partially correct 73 ms 952 KB Output is partially correct
41 Partially correct 83 ms 1112 KB Output is partially correct
42 Partially correct 66 ms 680 KB Output is partially correct
43 Partially correct 11 ms 1116 KB Output is partially correct
44 Partially correct 34 ms 724 KB Output is partially correct
45 Correct 19 ms 600 KB Output is correct
46 Partially correct 68 ms 1556 KB Output is partially correct
47 Partially correct 57 ms 1060 KB Output is partially correct
48 Partially correct 60 ms 976 KB Output is partially correct