oj.uz

Submission #835692

# Submission time Handle Problem Language Result Execution time Memory
835692 2023-08-23T17:39:26 Z gagik_2007 Rarest Insects (IOI22_insects) C++17
25 / 100
 204 ms 540 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);}
    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)/2;
        if(is_smaller_equal(mid)){
            r=mid;
        }
        else{
            l=mid+1;
        }
    }
    return l;
}

Subtask #1
10.0 / 10.0

# 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 0 ms 208 KB Output is correct
6 Correct 4 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 5 ms 308 KB Output is correct
9 Correct 9 ms 312 KB Output is correct
10 Correct 11 ms 208 KB Output is correct
11 Correct 13 ms 308 KB Output is correct
12 Correct 15 ms 208 KB Output is correct
13 Correct 13 ms 208 KB Output is correct
14 Correct 8 ms 312 KB Output is correct
15 Correct 6 ms 304 KB Output is correct
16 Correct 9 ms 208 KB Output is correct
17 Correct 10 ms 308 KB Output is correct
18 Correct 14 ms 316 KB Output is correct
19 Correct 9 ms 372 KB Output is correct
20 Correct 8 ms 308 KB Output is correct
21 Correct 6 ms 312 KB Output is correct
22 Correct 6 ms 208 KB Output is correct

Subtask #2
15.0 / 15.0

# 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 0 ms 208 KB Output is correct
6 Correct 4 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 5 ms 308 KB Output is correct
9 Correct 9 ms 312 KB Output is correct
10 Correct 11 ms 208 KB Output is correct
11 Correct 13 ms 308 KB Output is correct
12 Correct 15 ms 208 KB Output is correct
13 Correct 13 ms 208 KB Output is correct
14 Correct 8 ms 312 KB Output is correct
15 Correct 6 ms 304 KB Output is correct
16 Correct 9 ms 208 KB Output is correct
17 Correct 10 ms 308 KB Output is correct
18 Correct 14 ms 316 KB Output is correct
19 Correct 9 ms 372 KB Output is correct
20 Correct 8 ms 308 KB Output is correct
21 Correct 6 ms 312 KB Output is correct
22 Correct 6 ms 208 KB Output is correct
23 Correct 16 ms 208 KB Output is correct
24 Correct 4 ms 208 KB Output is correct
25 Correct 23 ms 304 KB Output is correct
26 Correct 48 ms 340 KB Output is correct
27 Correct 47 ms 300 KB Output is correct
28 Correct 54 ms 368 KB Output is correct
29 Correct 84 ms 300 KB Output is correct
30 Correct 52 ms 316 KB Output is correct
31 Correct 39 ms 292 KB Output is correct
32 Correct 52 ms 540 KB Output is correct
33 Correct 57 ms 324 KB Output is correct
34 Correct 48 ms 308 KB Output is correct
35 Correct 42 ms 312 KB Output is correct
36 Correct 41 ms 416 KB Output is correct
37 Correct 38 ms 312 KB Output is correct
38 Correct 40 ms 320 KB Output is correct
39 Correct 49 ms 320 KB Output is correct
40 Correct 36 ms 320 KB Output is correct
41 Correct 38 ms 296 KB Output is correct

Subtask #3
0 / 75.0

# 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 288 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Partially correct 1 ms 208 KB Output is partially correct
6 Partially correct 1 ms 208 KB Output is partially correct
7 Correct 35 ms 284 KB Output is correct
8 Correct 17 ms 208 KB Output is correct
9 Partially correct 62 ms 464 KB Output is partially correct
10 Partially correct 102 ms 356 KB Output is partially correct
11 Incorrect 204 ms 372 KB Too many queries.
12 Halted 0 ms 0 KB -