Submission #627517

# Submission time Handle Problem Language Result Execution time Memory
627517 2022-08-12T16:09:50 Z Carmel_Ab1 Rarest Insects (IOI22_insects) C++17
0 / 100
203 ms 220 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=1,r=n/diff,ans=1;
    while(l<=r){
        int m=(l+r)/2;

        int good=n;
        for(int i=0; i<n;i ++){
            if(in[i])
                in[i]=0, move_outside(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 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 18 ms 208 KB Output is correct
7 Correct 4 ms 208 KB Output is correct
8 Correct 10 ms 208 KB Output is correct
9 Correct 7 ms 208 KB Output is correct
10 Correct 14 ms 208 KB Output is correct
11 Correct 4 ms 208 KB Output is correct
12 Incorrect 8 ms 208 KB Wrong answer.
13 Halted 0 ms 0 KB -
# 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 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 18 ms 208 KB Output is correct
7 Correct 4 ms 208 KB Output is correct
8 Correct 10 ms 208 KB Output is correct
9 Correct 7 ms 208 KB Output is correct
10 Correct 14 ms 208 KB Output is correct
11 Correct 4 ms 208 KB Output is correct
12 Incorrect 8 ms 208 KB Wrong answer.
13 Halted 0 ms 0 KB -
# 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 1 ms 208 KB Output is correct
6 Partially correct 1 ms 208 KB Output is partially correct
7 Partially correct 203 ms 208 KB Output is partially correct
8 Correct 40 ms 208 KB Output is correct
9 Partially correct 81 ms 208 KB Output is partially correct
10 Partially correct 109 ms 220 KB Output is partially correct
11 Partially correct 199 ms 208 KB Output is partially correct
12 Correct 52 ms 208 KB Output is correct
13 Partially correct 158 ms 208 KB Output is partially correct
14 Partially correct 103 ms 208 KB Output is partially correct
15 Incorrect 155 ms 208 KB Wrong answer.
16 Halted 0 ms 0 KB -