oj.uz

답안 #971083

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
971083 2024-04-27T23:00:14 Z ALeonidou 드문 곤충 (IOI22_insects) C++17
25 / 100
 193 ms 1708 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"

typedef vector <ll> vi;
typedef pair <ll, ll> ii;
typedef vector <ii> vii;
    
#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, ll l, ll r, vi test_subjects, vi &id){
//     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;

//         //go left:
//         for (ll i =MID+1; i<r; i++){
//             move_outside(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, l, MID, remaining_test_subjects, id);
//         for (ll i =MID+1; i<r; i++){
//             move_inside(u[i]);
//         }

//         //go right:
//         for (ll i =l; i<=MID; i++){
//             move_outside(u[i]);
//         }
//         solve(u, MID+1, r, opposite_remaining_test_subjects, id);
//         for (ll i =l; i<=MID; i++){
//             move_inside(u[i]);
//         }
//     }
// }

void solve(vi &u, ll l, ll r, vi test_subjects, vi &id){
    if (l == r){
        for (ll i =0; i<sz(test_subjects); i++){
            id[test_subjects[i]] = u[l];
        }
    }
    else{
        vi remaining_test_subjects;
 
        //go left:
        remaining_test_subjects.clear();
        for (ll i =MID+1; i<r; i++){
            move_outside(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]);
            }
            move_outside(test_subjects[i]);
        }
        solve(u, l, MID, remaining_test_subjects, id);
        for (ll i =MID+1; i<r; i++){
            move_inside(u[i]);
        }
 
        //go right:
        remaining_test_subjects.clear();
        for (ll i =l; i<=MID; i++){
            move_outside(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]);
            }
            move_outside(test_subjects[i]);
        }
        solve(u, MID+1, r, remaining_test_subjects, id);
        for (ll i =l; i<=MID; i++){
            move_inside(u[i]);
        }
    }
}

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;
        }
    }
    solve(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

60
1 2 2 6 1 3 3 2 6 1 1 2 2 6 1 3 3 2 6 1 1 2 2 6 1 3 3 2 8 6 1 1 2 2 6 1 3 3 9 6 1 1 15 2 6 1 3 3 2 6 1 1 2 2 6 1 3 3 2 6 1

6
1 2 3 4 5 6

1
1

*/

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 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 344 KB Output is correct
7 Correct 2 ms 856 KB Output is correct
8 Correct 8 ms 444 KB Output is correct
9 Correct 8 ms 600 KB Output is correct
10 Correct 4 ms 600 KB Output is correct
11 Correct 7 ms 860 KB Output is correct
12 Correct 6 ms 344 KB Output is correct
13 Correct 7 ms 600 KB Output is correct
14 Correct 5 ms 600 KB Output is correct
15 Correct 6 ms 848 KB Output is correct
16 Correct 7 ms 944 KB Output is correct
17 Correct 8 ms 344 KB Output is correct
18 Correct 7 ms 600 KB Output is correct
19 Correct 12 ms 604 KB Output is correct
20 Correct 8 ms 600 KB Output is correct
21 Correct 9 ms 600 KB Output is correct
22 Correct 8 ms 344 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 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 344 KB Output is correct
7 Correct 2 ms 856 KB Output is correct
8 Correct 8 ms 444 KB Output is correct
9 Correct 8 ms 600 KB Output is correct
10 Correct 4 ms 600 KB Output is correct
11 Correct 7 ms 860 KB Output is correct
12 Correct 6 ms 344 KB Output is correct
13 Correct 7 ms 600 KB Output is correct
14 Correct 5 ms 600 KB Output is correct
15 Correct 6 ms 848 KB Output is correct
16 Correct 7 ms 944 KB Output is correct
17 Correct 8 ms 344 KB Output is correct
18 Correct 7 ms 600 KB Output is correct
19 Correct 12 ms 604 KB Output is correct
20 Correct 8 ms 600 KB Output is correct
21 Correct 9 ms 600 KB Output is correct
22 Correct 8 ms 344 KB Output is correct
23 Correct 5 ms 440 KB Output is correct
24 Correct 7 ms 856 KB Output is correct
25 Correct 65 ms 928 KB Output is correct
26 Correct 66 ms 960 KB Output is correct
27 Correct 16 ms 600 KB Output is correct
28 Correct 54 ms 1444 KB Output is correct
29 Correct 37 ms 700 KB Output is correct
30 Correct 59 ms 696 KB Output is correct
31 Correct 32 ms 1200 KB Output is correct
32 Correct 44 ms 696 KB Output is correct
33 Correct 45 ms 848 KB Output is correct
34 Correct 46 ms 1120 KB Output is correct
35 Correct 61 ms 600 KB Output is correct
36 Correct 68 ms 688 KB Output is correct
37 Correct 84 ms 856 KB Output is correct
38 Correct 77 ms 932 KB Output is correct
39 Correct 88 ms 696 KB Output is correct
40 Correct 62 ms 680 KB Output is correct
41 Correct 50 ms 860 KB Output is correct

Subtask #3
0 / 75.0

# 결과 실행 시간 메모리 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 344 KB Output is correct
7 Correct 10 ms 416 KB Output is correct
8 Partially correct 15 ms 924 KB Output is partially correct
9 Partially correct 162 ms 1140 KB Output is partially correct
10 Partially correct 165 ms 980 KB Output is partially correct
11 Correct 38 ms 676 KB Output is correct
12 Partially correct 128 ms 1708 KB Output is partially correct
13 Partially correct 70 ms 628 KB Output is partially correct
14 Partially correct 146 ms 952 KB Output is partially correct
15 Partially correct 60 ms 944 KB Output is partially correct
16 Partially correct 79 ms 1192 KB Output is partially correct
17 Partially correct 104 ms 968 KB Output is partially correct
18 Partially correct 89 ms 1216 KB Output is partially correct
19 Partially correct 123 ms 740 KB Output is partially correct
20 Partially correct 133 ms 716 KB Output is partially correct
21 Partially correct 154 ms 1256 KB Output is partially correct
22 Partially correct 176 ms 1232 KB Output is partially correct
23 Incorrect 193 ms 724 KB Too many queries.
24 Halted 0 ms 0 KB -