oj.uz

답안 #826337

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
826337 2023-08-15T13:03:15 Z alvingogo 드문 곤충 (IOI22_insects) C++17
99.79 / 100
 50 ms 328 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=2,r=(n-1)/cnt+2;
        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

# 결과 실행 시간 메모리 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 5 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 4 ms 208 KB Output is correct
13 Correct 4 ms 208 KB Output is correct
14 Correct 5 ms 208 KB Output is correct
15 Correct 4 ms 208 KB Output is correct
16 Correct 2 ms 208 KB Output is correct
17 Correct 4 ms 208 KB Output is correct
18 Correct 4 ms 208 KB Output is correct
19 Correct 4 ms 208 KB Output is correct
20 Correct 4 ms 208 KB Output is correct
21 Correct 3 ms 208 KB Output is correct
22 Correct 3 ms 208 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 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 5 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 4 ms 208 KB Output is correct
13 Correct 4 ms 208 KB Output is correct
14 Correct 5 ms 208 KB Output is correct
15 Correct 4 ms 208 KB Output is correct
16 Correct 2 ms 208 KB Output is correct
17 Correct 4 ms 208 KB Output is correct
18 Correct 4 ms 208 KB Output is correct
19 Correct 4 ms 208 KB Output is correct
20 Correct 4 ms 208 KB Output is correct
21 Correct 3 ms 208 KB Output is correct
22 Correct 3 ms 208 KB Output is correct
23 Correct 5 ms 208 KB Output is correct
24 Correct 7 ms 208 KB Output is correct
25 Correct 17 ms 208 KB Output is correct
26 Correct 23 ms 308 KB Output is correct
27 Correct 11 ms 208 KB Output is correct
28 Correct 10 ms 208 KB Output is correct
29 Correct 17 ms 288 KB Output is correct
30 Correct 26 ms 312 KB Output is correct
31 Correct 18 ms 208 KB Output is correct
32 Correct 28 ms 316 KB Output is correct
33 Correct 13 ms 316 KB Output is correct
34 Correct 19 ms 208 KB Output is correct
35 Correct 19 ms 208 KB Output is correct
36 Correct 19 ms 312 KB Output is correct
37 Correct 18 ms 208 KB Output is correct
38 Correct 17 ms 208 KB Output is correct
39 Correct 17 ms 208 KB Output is correct
40 Correct 13 ms 308 KB Output is correct
41 Correct 12 ms 208 KB Output is correct

Subtask #3
74.79 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 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 11 ms 208 KB Output is correct
8 Correct 11 ms 208 KB Output is correct
9 Correct 35 ms 208 KB Output is correct
10 Correct 37 ms 304 KB Output is correct
11 Correct 27 ms 312 KB Output is correct
12 Correct 16 ms 208 KB Output is correct
13 Correct 46 ms 304 KB Output is correct
14 Correct 36 ms 304 KB Output is correct
15 Correct 24 ms 328 KB Output is correct
16 Correct 26 ms 304 KB Output is correct
17 Correct 38 ms 208 KB Output is correct
18 Correct 50 ms 208 KB Output is correct
19 Correct 39 ms 208 KB Output is correct
20 Correct 44 ms 328 KB Output is correct
21 Correct 49 ms 312 KB Output is correct
22 Correct 45 ms 308 KB Output is correct
23 Correct 44 ms 308 KB Output is correct
24 Correct 39 ms 208 KB Output is correct
25 Correct 24 ms 208 KB Output is correct
26 Correct 21 ms 304 KB Output is correct
27 Correct 44 ms 304 KB Output is correct
28 Correct 24 ms 208 KB Output is correct
29 Correct 40 ms 208 KB Output is correct
30 Correct 46 ms 208 KB Output is correct
31 Correct 50 ms 308 KB Output is correct
32 Correct 37 ms 312 KB Output is correct
33 Partially correct 40 ms 208 KB Output is partially correct
34 Partially correct 40 ms 208 KB Output is partially correct
35 Correct 46 ms 208 KB Output is correct
36 Correct 37 ms 208 KB Output is correct
37 Correct 49 ms 308 KB Output is correct
38 Correct 36 ms 208 KB Output is correct
39 Correct 41 ms 208 KB Output is correct
40 Correct 25 ms 320 KB Output is correct
41 Correct 42 ms 208 KB Output is correct
42 Correct 42 ms 304 KB Output is correct
43 Correct 13 ms 208 KB Output is correct
44 Correct 29 ms 304 KB Output is correct
45 Correct 32 ms 316 KB Output is correct
46 Correct 26 ms 208 KB Output is correct
47 Correct 20 ms 208 KB Output is correct
48 Correct 20 ms 208 KB Output is correct