oj.uz

Submission #826338

# Submission time Handle Problem Language Result Execution time Memory
826338 2023-08-15T13:03:47 Z alvingogo Rarest Insects (IOI22_insects) C++17
100 / 100
 52 ms 456 KB 
#include "insects.h"
#include <bits/stdc++.h>
#define fs first
#define sc second
using namespace std;

struct DSU{
    vector<int> bo;
    void init(int x){
        bo.resize(x);
        iota(bo.begin(),bo.end(),0);
    }
    int find(int x){
        return bo[x]==x?bo[x]:bo[x]=find(bo[x]);
    }
    void merge(int x,int y){
        x=find(x);
        y=find(y);
        bo[x]=y;
    }
}dsu;
int min_cardinality(int n) {
    int cnt=0;
    dsu.init(n);
    vector<int> vis(n);
    vector<int> bo(n);
    for(int i=0;i<n;i++){
        move_inside(i);
        int a=press_button();
        if(a>1){
            move_outside(i);
        }
        else{
            vis[i]=1;
            cnt++;
        }
    }
    if(cnt==1){
        return n;
    }
    if(cnt<=3){
        vector<int> cg;
        for(int w=0;w<cnt;w++){
            int k=1;
            vector<int> vz(n);
            for(int i=0;i<n;i++){
                if(!vis[i]){
                    move_inside(i);
                    int a=press_button();
                    if(a==k){
                        move_outside(i);
                    }
                    else{
                        vz[i]=1;
                        k=a;
                    }
                }
            }
            for(int i=0;i<n;i++){
                if(vz[i]){
                    vis[i]=1;
                    move_outside(i);
                }
            }
            cg.push_back(k);
        }
        return *min_element(cg.begin(),cg.end());
    }
    else{
        int l=1,r=(n-1)/cnt+3;
        int cc=cnt;
        while(r>l){
            int m=(l+r)/2;
            vector<int> pu(n);
            for(int i=0;i<n;i++){
                if(!vis[i]){
                    move_inside(i);
                    cc++;
                    int a=press_button();
                    if(a>m){
                        move_outside(i);
                        cc--;
                    }
                    else{
                        pu[i]=1;
                    }
                }
            }
            if(m*cnt!=cc){
                r=m;
                for(int i=0;i<n;i++){
                    if(pu[i]){
                        move_outside(i);
                        cc--;
                    }
                    else{
                        vis[i]=1;
                    }
                }
            }
            else{
                l=m+1;
                for(int i=0;i<n;i++){
                    if(pu[i]){
                        vis[i]=1;
                    }
                }
            }
        }
        return l-1;
    }
}

Subtask #1
10.0 / 10.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 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 5 ms 208 KB Output is correct
9 Correct 4 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 5 ms 208 KB Output is correct
13 Correct 3 ms 208 KB Output is correct
14 Correct 5 ms 208 KB Output is correct
15 Correct 5 ms 208 KB Output is correct
16 Correct 6 ms 208 KB Output is correct
17 Correct 4 ms 208 KB Output is correct
18 Correct 5 ms 208 KB Output is correct
19 Correct 3 ms 256 KB Output is correct
20 Correct 5 ms 208 KB Output is correct
21 Correct 3 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct

Subtask #2
15.0 / 15.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 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 5 ms 208 KB Output is correct
9 Correct 4 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 5 ms 208 KB Output is correct
13 Correct 3 ms 208 KB Output is correct
14 Correct 5 ms 208 KB Output is correct
15 Correct 5 ms 208 KB Output is correct
16 Correct 6 ms 208 KB Output is correct
17 Correct 4 ms 208 KB Output is correct
18 Correct 5 ms 208 KB Output is correct
19 Correct 3 ms 256 KB Output is correct
20 Correct 5 ms 208 KB Output is correct
21 Correct 3 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 8 ms 208 KB Output is correct
24 Correct 6 ms 308 KB Output is correct
25 Correct 22 ms 208 KB Output is correct
26 Correct 28 ms 336 KB Output is correct
27 Correct 14 ms 456 KB Output is correct
28 Correct 6 ms 312 KB Output is correct
29 Correct 21 ms 208 KB Output is correct
30 Correct 18 ms 208 KB Output is correct
31 Correct 25 ms 316 KB Output is correct
32 Correct 26 ms 312 KB Output is correct
33 Correct 20 ms 312 KB Output is correct
34 Correct 22 ms 208 KB Output is correct
35 Correct 20 ms 292 KB Output is correct
36 Correct 23 ms 308 KB Output is correct
37 Correct 20 ms 208 KB Output is correct
38 Correct 18 ms 312 KB Output is correct
39 Correct 16 ms 320 KB Output is correct
40 Correct 19 ms 208 KB Output is correct
41 Correct 14 ms 208 KB Output is correct

Subtask #3
75.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 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 19 ms 208 KB Output is correct
8 Correct 16 ms 300 KB Output is correct
9 Correct 35 ms 208 KB Output is correct
10 Correct 51 ms 308 KB Output is correct
11 Correct 31 ms 308 KB Output is correct
12 Correct 17 ms 304 KB Output is correct
13 Correct 32 ms 208 KB Output is correct
14 Correct 37 ms 208 KB Output is correct
15 Correct 42 ms 300 KB Output is correct
16 Correct 34 ms 208 KB Output is correct
17 Correct 51 ms 208 KB Output is correct
18 Correct 41 ms 304 KB Output is correct
19 Correct 52 ms 208 KB Output is correct
20 Correct 37 ms 300 KB Output is correct
21 Correct 46 ms 300 KB Output is correct
22 Correct 41 ms 304 KB Output is correct
23 Correct 37 ms 208 KB Output is correct
24 Correct 18 ms 312 KB Output is correct
25 Correct 32 ms 208 KB Output is correct
26 Correct 28 ms 208 KB Output is correct
27 Correct 38 ms 304 KB Output is correct
28 Correct 32 ms 208 KB Output is correct
29 Correct 34 ms 208 KB Output is correct
30 Correct 37 ms 208 KB Output is correct
31 Correct 37 ms 208 KB Output is correct
32 Correct 41 ms 304 KB Output is correct
33 Correct 32 ms 304 KB Output is correct
34 Correct 50 ms 304 KB Output is correct
35 Correct 40 ms 304 KB Output is correct
36 Correct 47 ms 208 KB Output is correct
37 Correct 42 ms 208 KB Output is correct
38 Correct 39 ms 208 KB Output is correct
39 Correct 37 ms 208 KB Output is correct
40 Correct 37 ms 300 KB Output is correct
41 Correct 20 ms 208 KB Output is correct
42 Correct 20 ms 320 KB Output is correct
43 Correct 9 ms 208 KB Output is correct
44 Correct 32 ms 304 KB Output is correct
45 Correct 36 ms 308 KB Output is correct
46 Correct 31 ms 300 KB Output is correct
47 Correct 25 ms 304 KB Output is correct
48 Correct 20 ms 208 KB Output is correct