Submission #835699

# Submission time Handle Problem Language Result Execution time Memory
835699 2023-08-23T17:44:10 Z gagik_2007 Rarest Insects (IOI22_insects) C++17
53.11 / 100
126 ms 524 KB
#include "insects.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define ff first
#define ss second

ll ttt;
const ll INF=1e18;
const ll MOD=1e9+7;
const ll N=300007;
ll n,m;
ll t;
vector<int>inside;
bool is_inside[N];

void calc_t(){
    int cur=0;
    for(int i=0;i<n;i++){
        move_inside(i);
        cur++;
        int res=press_button();
        if(res>1){
            cur--;
            move_outside(i);
        }
        else{
            inside.push_back(i);
            is_inside[i]=true;
        }
    }
    t=cur;
    // for(int x:inside)move_outside(x);
}

bool is_smaller_equal(int k){
    int st_res=press_button();
    if(st_res>k+1){
        for(int x:inside){
            is_inside[x]=false;
            move_outside(x);
        }
        inside.clear();
    }
    int cur=0;
    for(int i=0;i<n;i++){
        if(!is_inside[i]){
            move_inside(i);
            cur++;
            int res=press_button();
            if(res>k+1){
                cur--;
                move_outside(i);
            }
            else{
                inside.push_back(i);
                is_inside[i]=true;
            }
        }
        else{
            cur++;
        }
    }
    if(cur==t*(k+1))return false;
    return true;
}

int min_cardinality(int NN) {
    n=NN;
    calc_t();
    // cout<<"t: "<<t<<endl;
    int l=1,r=n-t+2;
    while(l<r){
        int mid=(l+r+l+l+r)/5;
        if(is_smaller_equal(mid)){
            r=mid;
        }
        else{
            l=mid+1;
        }
    }
    return l;
}
# 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 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 6 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 3 ms 208 KB Output is correct
9 Correct 9 ms 304 KB Output is correct
10 Correct 9 ms 208 KB Output is correct
11 Correct 9 ms 308 KB Output is correct
12 Correct 8 ms 208 KB Output is correct
13 Correct 12 ms 208 KB Output is correct
14 Correct 9 ms 208 KB Output is correct
15 Correct 6 ms 304 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 11 ms 208 KB Output is correct
18 Correct 14 ms 312 KB Output is correct
19 Correct 6 ms 208 KB Output is correct
20 Correct 6 ms 296 KB Output is correct
21 Correct 6 ms 316 KB Output is correct
22 Correct 5 ms 308 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 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 6 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 3 ms 208 KB Output is correct
9 Correct 9 ms 304 KB Output is correct
10 Correct 9 ms 208 KB Output is correct
11 Correct 9 ms 308 KB Output is correct
12 Correct 8 ms 208 KB Output is correct
13 Correct 12 ms 208 KB Output is correct
14 Correct 9 ms 208 KB Output is correct
15 Correct 6 ms 304 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 11 ms 208 KB Output is correct
18 Correct 14 ms 312 KB Output is correct
19 Correct 6 ms 208 KB Output is correct
20 Correct 6 ms 296 KB Output is correct
21 Correct 6 ms 316 KB Output is correct
22 Correct 5 ms 308 KB Output is correct
23 Correct 23 ms 284 KB Output is correct
24 Correct 4 ms 208 KB Output is correct
25 Correct 37 ms 308 KB Output is correct
26 Correct 42 ms 208 KB Output is correct
27 Correct 36 ms 304 KB Output is correct
28 Correct 52 ms 208 KB Output is correct
29 Correct 75 ms 288 KB Output is correct
30 Correct 38 ms 208 KB Output is correct
31 Correct 63 ms 208 KB Output is correct
32 Correct 40 ms 208 KB Output is correct
33 Correct 34 ms 292 KB Output is correct
34 Correct 59 ms 320 KB Output is correct
35 Correct 39 ms 292 KB Output is correct
36 Correct 56 ms 288 KB Output is correct
37 Correct 40 ms 208 KB Output is correct
38 Correct 50 ms 284 KB Output is correct
39 Correct 38 ms 208 KB Output is correct
40 Correct 15 ms 312 KB Output is correct
41 Correct 35 ms 308 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 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 41 ms 284 KB Output is partially correct
8 Correct 10 ms 208 KB Output is correct
9 Partially correct 44 ms 292 KB Output is partially correct
10 Partially correct 113 ms 308 KB Output is partially correct
11 Partially correct 97 ms 300 KB Output is partially correct
12 Partially correct 98 ms 288 KB Output is partially correct
13 Partially correct 70 ms 208 KB Output is partially correct
14 Partially correct 100 ms 300 KB Output is partially correct
15 Partially correct 108 ms 304 KB Output is partially correct
16 Partially correct 112 ms 420 KB Output is partially correct
17 Partially correct 88 ms 304 KB Output is partially correct
18 Partially correct 122 ms 288 KB Output is partially correct
19 Partially correct 104 ms 524 KB Output is partially correct
20 Partially correct 107 ms 300 KB Output is partially correct
21 Partially correct 93 ms 304 KB Output is partially correct
22 Partially correct 78 ms 296 KB Output is partially correct
23 Partially correct 54 ms 308 KB Output is partially correct
24 Partially correct 60 ms 300 KB Output is partially correct
25 Partially correct 32 ms 312 KB Output is partially correct
26 Partially correct 42 ms 308 KB Output is partially correct
27 Partially correct 78 ms 288 KB Output is partially correct
28 Partially correct 65 ms 296 KB Output is partially correct
29 Partially correct 79 ms 304 KB Output is partially correct
30 Partially correct 80 ms 304 KB Output is partially correct
31 Partially correct 108 ms 416 KB Output is partially correct
32 Partially correct 93 ms 208 KB Output is partially correct
33 Partially correct 63 ms 288 KB Output is partially correct
34 Partially correct 84 ms 308 KB Output is partially correct
35 Partially correct 58 ms 400 KB Output is partially correct
36 Partially correct 71 ms 328 KB Output is partially correct
37 Partially correct 91 ms 296 KB Output is partially correct
38 Partially correct 107 ms 292 KB Output is partially correct
39 Partially correct 36 ms 288 KB Output is partially correct
40 Partially correct 66 ms 300 KB Output is partially correct
41 Partially correct 46 ms 300 KB Output is partially correct
42 Partially correct 52 ms 300 KB Output is partially correct
43 Partially correct 35 ms 308 KB Output is partially correct
44 Partially correct 112 ms 284 KB Output is partially correct
45 Partially correct 49 ms 288 KB Output is partially correct
46 Partially correct 124 ms 304 KB Output is partially correct
47 Partially correct 126 ms 424 KB Output is partially correct
48 Partially correct 104 ms 308 KB Output is partially correct