oj.uz

답안 #936611

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
936611 2024-03-02T11:09:31 Z GrindMachine 드문 곤충 (IOI22_insects) C++17
38.64 / 100
 174 ms 1668 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
 
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
 
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
 
template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}
 
template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}
 
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
 
/*
 
 
 
*/
 
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
 
#include "insects.h"
 
int min_cardinality(int n) {
    vector<int> uniq_guys;
 
    rep(i,n){
        move_inside(i);
        int res = press_button();
        if(res >= 2){
            move_outside(i);
        }
        else{
            uniq_guys.pb(i);
        }
    }
 
    trav(i,uniq_guys){
        move_outside(i);
    }
 
    auto ok = [&](int mid){
        vector<int> good, bad;
 
        rep(i,n){
            move_inside(i);
            int res = press_button();
            if(res > mid){
                bad.pb(i);
                move_outside(i);
            }
            else{
                good.pb(i);
            }
        }
 
        trav(i,good){
            move_outside(i);
        }

        if(sz(bad) < sz(uniq_guys)) return true;

        vector<int> bad_uniq;
        trav(i,bad){
            move_inside(i);
            int res = press_button();
            if(res >= 2){
                move_outside(i);
            }
            else{
                bad_uniq.pb(i);
            }
        }
 
        trav(i,bad_uniq){
            move_outside(i);
        }
 
        return sz(bad_uniq) < sz(uniq_guys);
    };
 
    int l = 1, r = n/sz(uniq_guys)-1;
    int ans = n/sz(uniq_guys);
 
    while(l <= r){
        int mid = (l+r) >> 1;
        // is min <= mid?
        if(ok(mid)){
            ans = mid;
            r = mid-1;
        }
        else{
            l = mid+1;
        }
    }
 
    return ans;
}

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 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 8 ms 440 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 8 ms 600 KB Output is correct
9 Correct 6 ms 600 KB Output is correct
10 Correct 9 ms 852 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 9 ms 600 KB Output is correct
13 Correct 8 ms 436 KB Output is correct
14 Correct 6 ms 432 KB Output is correct
15 Correct 6 ms 344 KB Output is correct
16 Correct 5 ms 600 KB Output is correct
17 Correct 5 ms 436 KB Output is correct
18 Correct 8 ms 596 KB Output is correct
19 Correct 5 ms 344 KB Output is correct
20 Correct 4 ms 344 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 1 ms 600 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 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 8 ms 440 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 8 ms 600 KB Output is correct
9 Correct 6 ms 600 KB Output is correct
10 Correct 9 ms 852 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 9 ms 600 KB Output is correct
13 Correct 8 ms 436 KB Output is correct
14 Correct 6 ms 432 KB Output is correct
15 Correct 6 ms 344 KB Output is correct
16 Correct 5 ms 600 KB Output is correct
17 Correct 5 ms 436 KB Output is correct
18 Correct 8 ms 596 KB Output is correct
19 Correct 5 ms 344 KB Output is correct
20 Correct 4 ms 344 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 55 ms 1100 KB Output is correct
24 Correct 5 ms 856 KB Output is correct
25 Correct 27 ms 600 KB Output is correct
26 Correct 38 ms 676 KB Output is correct
27 Correct 80 ms 600 KB Output is correct
28 Correct 5 ms 600 KB Output is correct
29 Correct 81 ms 592 KB Output is correct
30 Correct 45 ms 432 KB Output is correct
31 Correct 44 ms 668 KB Output is correct
32 Correct 46 ms 932 KB Output is correct
33 Correct 45 ms 672 KB Output is correct
34 Correct 39 ms 844 KB Output is correct
35 Correct 37 ms 1180 KB Output is correct
36 Correct 36 ms 924 KB Output is correct
37 Correct 32 ms 672 KB Output is correct
38 Correct 27 ms 848 KB Output is correct
39 Correct 16 ms 604 KB Output is correct
40 Correct 11 ms 600 KB Output is correct
41 Correct 6 ms 604 KB Output is correct

Subtask #3
13.64 / 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 Partially correct 0 ms 344 KB Output is partially correct
7 Partially correct 120 ms 1204 KB Output is partially correct
8 Correct 10 ms 600 KB Output is correct
9 Partially correct 86 ms 684 KB Output is partially correct
10 Partially correct 80 ms 436 KB Output is partially correct
11 Partially correct 174 ms 664 KB Output is partially correct
12 Correct 23 ms 948 KB Output is correct
13 Partially correct 155 ms 924 KB Output is partially correct
14 Partially correct 96 ms 440 KB Output is partially correct
15 Partially correct 96 ms 1168 KB Output is partially correct
16 Partially correct 99 ms 684 KB Output is partially correct
17 Partially correct 87 ms 1668 KB Output is partially correct
18 Partially correct 94 ms 676 KB Output is partially correct
19 Partially correct 108 ms 940 KB Output is partially correct
20 Partially correct 85 ms 924 KB Output is partially correct
21 Partially correct 82 ms 940 KB Output is partially correct
22 Partially correct 82 ms 1176 KB Output is partially correct
23 Partially correct 55 ms 600 KB Output is partially correct
24 Partially correct 39 ms 604 KB Output is partially correct
25 Correct 23 ms 688 KB Output is correct
26 Correct 10 ms 864 KB Output is correct
27 Partially correct 60 ms 848 KB Output is partially correct
28 Partially correct 66 ms 696 KB Output is partially correct
29 Partially correct 92 ms 924 KB Output is partially correct
30 Partially correct 96 ms 668 KB Output is partially correct
31 Partially correct 84 ms 676 KB Output is partially correct
32 Partially correct 81 ms 928 KB Output is partially correct
33 Partially correct 80 ms 680 KB Output is partially correct
34 Partially correct 93 ms 920 KB Output is partially correct
35 Partially correct 82 ms 944 KB Output is partially correct
36 Partially correct 76 ms 1160 KB Output is partially correct
37 Partially correct 73 ms 1104 KB Output is partially correct
38 Partially correct 78 ms 672 KB Output is partially correct
39 Partially correct 56 ms 676 KB Output is partially correct
40 Partially correct 55 ms 920 KB Output is partially correct
41 Partially correct 88 ms 920 KB Output is partially correct
42 Partially correct 70 ms 856 KB Output is partially correct
43 Partially correct 30 ms 600 KB Output is partially correct
44 Partially correct 134 ms 428 KB Output is partially correct
45 Partially correct 109 ms 912 KB Output is partially correct
46 Correct 24 ms 1188 KB Output is correct
47 Correct 21 ms 848 KB Output is correct
48 Correct 26 ms 1108 KB Output is correct