Submission #627527

# Submission time Handle Problem Language Result Execution time Memory
627527 2022-08-12T16:17:52 Z Carmel_Ab1 Rarest Insects (IOI22_insects) C++17
47.5 / 100
213 ms 492 KB
/*
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
 */
#include<bits/stdc++.h>
#include "insects.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int>vi;
typedef vector<vector<int>>vvi;
typedef vector<ll>vl;
typedef vector<vl> vvl;
typedef pair<int,int>pi;
typedef pair<ll,ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld,ld> pld;
typedef vector<pi> vpi;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T> ostream& operator<<(ostream& os, vector<T>& a){os<<"[";for(int i=0; i<ll(a.size()); i++){os << a[i] << ((i!=ll(a.size()-1)?" ":""));}os << "]\n"; return os;}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define outfl(x){cout << x << endl;return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map


int min_cardinality(int n){
    int diff=0;
    vector<bool>in(n);
    for(int i=0; i<n; i++){
        move_inside(i),in[i]=1;
        diff++;
        if(press_button()!=1)
            move_outside(i),diff--,in[i]=0;
    }

    int l=2,r=n/diff,ans=1;
    while(l<=r){
        int m=(l+r)/2;
        for(int i=0; i<n;i ++)
            if(in[i])
                in[i]=0, move_outside(i);
        int good=n;
        for(int i=0; i<n;i ++){
            move_inside(i);
            in[i]=1;
            int p=press_button();
            if(p>m)
                good--, move_outside(i), in[i]=0;
        }
        if(diff*m<=good)
            l=m+1,ans=m;
        else
            r=m-1;
    }

    return ans;

}
# Verdict Execution time Memory 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 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 19 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 7 ms 208 KB Output is correct
9 Correct 10 ms 208 KB Output is correct
10 Correct 14 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 12 ms 208 KB Output is correct
13 Correct 6 ms 208 KB Output is correct
14 Correct 13 ms 208 KB Output is correct
15 Correct 11 ms 208 KB Output is correct
16 Correct 10 ms 208 KB Output is correct
17 Correct 9 ms 208 KB Output is correct
18 Correct 10 ms 208 KB Output is correct
19 Correct 6 ms 208 KB Output is correct
20 Correct 8 ms 208 KB Output is correct
21 Correct 5 ms 208 KB Output is correct
22 Correct 3 ms 208 KB Output is correct
# Verdict Execution time Memory 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 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 19 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 7 ms 208 KB Output is correct
9 Correct 10 ms 208 KB Output is correct
10 Correct 14 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 12 ms 208 KB Output is correct
13 Correct 6 ms 208 KB Output is correct
14 Correct 13 ms 208 KB Output is correct
15 Correct 11 ms 208 KB Output is correct
16 Correct 10 ms 208 KB Output is correct
17 Correct 9 ms 208 KB Output is correct
18 Correct 10 ms 208 KB Output is correct
19 Correct 6 ms 208 KB Output is correct
20 Correct 8 ms 208 KB Output is correct
21 Correct 5 ms 208 KB Output is correct
22 Correct 3 ms 208 KB Output is correct
23 Correct 90 ms 208 KB Output is correct
24 Correct 10 ms 208 KB Output is correct
25 Correct 42 ms 280 KB Output is correct
26 Correct 61 ms 280 KB Output is correct
27 Correct 68 ms 208 KB Output is correct
28 Correct 14 ms 208 KB Output is correct
29 Correct 91 ms 208 KB Output is correct
30 Correct 47 ms 208 KB Output is correct
31 Correct 84 ms 212 KB Output is correct
32 Correct 84 ms 208 KB Output is correct
33 Correct 69 ms 208 KB Output is correct
34 Correct 52 ms 280 KB Output is correct
35 Correct 67 ms 208 KB Output is correct
36 Correct 60 ms 208 KB Output is correct
37 Correct 55 ms 208 KB Output is correct
38 Correct 40 ms 208 KB Output is correct
39 Correct 22 ms 208 KB Output is correct
40 Correct 15 ms 208 KB Output is correct
41 Correct 7 ms 208 KB Output is correct
# Verdict Execution time Memory 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 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 Partially correct 196 ms 392 KB Output is partially correct
8 Correct 13 ms 208 KB Output is correct
9 Partially correct 103 ms 284 KB Output is partially correct
10 Partially correct 127 ms 280 KB Output is partially correct
11 Partially correct 213 ms 208 KB Output is partially correct
12 Correct 28 ms 208 KB Output is correct
13 Partially correct 168 ms 208 KB Output is partially correct
14 Partially correct 120 ms 212 KB Output is partially correct
15 Partially correct 178 ms 280 KB Output is partially correct
16 Partially correct 142 ms 392 KB Output is partially correct
17 Partially correct 96 ms 400 KB Output is partially correct
18 Partially correct 148 ms 292 KB Output is partially correct
19 Partially correct 113 ms 280 KB Output is partially correct
20 Partially correct 161 ms 276 KB Output is partially correct
21 Partially correct 94 ms 208 KB Output is partially correct
22 Partially correct 117 ms 208 KB Output is partially correct
23 Partially correct 79 ms 276 KB Output is partially correct
24 Correct 61 ms 280 KB Output is correct
25 Correct 38 ms 208 KB Output is correct
26 Correct 17 ms 208 KB Output is correct
27 Partially correct 106 ms 208 KB Output is partially correct
28 Partially correct 68 ms 276 KB Output is partially correct
29 Partially correct 78 ms 280 KB Output is partially correct
30 Partially correct 156 ms 284 KB Output is partially correct
31 Partially correct 91 ms 276 KB Output is partially correct
32 Partially correct 101 ms 288 KB Output is partially correct
33 Partially correct 87 ms 208 KB Output is partially correct
34 Partially correct 72 ms 280 KB Output is partially correct
35 Partially correct 83 ms 276 KB Output is partially correct
36 Partially correct 126 ms 276 KB Output is partially correct
37 Partially correct 73 ms 404 KB Output is partially correct
38 Partially correct 104 ms 292 KB Output is partially correct
39 Partially correct 90 ms 284 KB Output is partially correct
40 Partially correct 109 ms 280 KB Output is partially correct
41 Partially correct 111 ms 396 KB Output is partially correct
42 Partially correct 103 ms 280 KB Output is partially correct
43 Partially correct 38 ms 208 KB Output is partially correct
44 Partially correct 144 ms 208 KB Output is partially correct
45 Partially correct 185 ms 492 KB Output is partially correct
46 Correct 33 ms 208 KB Output is correct
47 Correct 29 ms 208 KB Output is correct
48 Correct 35 ms 284 KB Output is correct