답안 #978140

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
978140 2024-05-08T22:59:56 Z SiliconSquared 드문 곤충 (IOI22_insects) C++17
47.5 / 100
137 ms 1424 KB
#include "insects.h"
using namespace std;
#include <vector>
#include <iostream>
int min_cardinality(int N) {
    int a,b,c,x,y,q;
    vector<bool> g;
    vector<bool> h;
    bool f;
    g.resize(N,false);
    h.resize(N);
    // for (int i=0;i<N;i++){
    //     move_inside(i);
    // }
    // b=press_button();
    // for (int i=0;i<N;i++){
    //     move_outside(i);
    // }
    a=1;b=N;
    y=0;
    for (int i=0;i<N;i++){
        move_inside(i);
        if (press_button()==2){
            move_outside(i);
            g[i]=true;
        }else{
            y++;
        }
    }
    for (int i=0;i<N;i++){
        if (!g[i]){
            move_outside(i);
        }
        g[i]=false;
    }
    while (a!=b){
        c=(a+b+1)/2;
        x=0;
        for (int i=0;i<N;i++){
            // if (!g[i]){
                move_inside(i);
                q=press_button();
                if (q>c){//cerr<<c<<','<<i<<';';
                    move_outside(i);
                    h[i]=true;
                    x++;
                }
            // }
        }
        for (int i=0;i<N;i++){
            // if (!g[i]){
                if (!h[i]){
                    move_outside(i);
                }
            // }
        }
        f=((N-x)==y*c);
        // for (int i=0;i<N;i++){
        //     if (!g[i]){
        //         if (h[i]){
        //             move_inside(i);
        //             if (press_button()==2){
        //                 move_outside(i);
        //             }
        //         }
        //     }
        // }
        // f=true;
        // for (int i=0;i<N;i++){
        //     if ((!g[i])&&(!h[i])){
        //         move_inside(i);
        //         if (press_button()==2){
        //             h[i]=true;
        //         }else{
        //             f=false;
        //         }
        //         move_outside(i);
        //     }
        // }
        if (f){
            //all bugs eliminated
            a=c;
        }else{
            //some bugs remain
            b=c-1;
            // for (int i=0;i<N;i++){
            //     if (h[i]){
            //         g[i]=true;
            //     }
            // }
        }
    }
    return a;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 8 ms 344 KB Output is correct
7 Correct 7 ms 344 KB Output is correct
8 Correct 8 ms 344 KB Output is correct
9 Correct 7 ms 344 KB Output is correct
10 Correct 7 ms 344 KB Output is correct
11 Correct 8 ms 344 KB Output is correct
12 Correct 8 ms 344 KB Output is correct
13 Correct 7 ms 344 KB Output is correct
14 Correct 9 ms 344 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Correct 7 ms 344 KB Output is correct
17 Correct 6 ms 344 KB Output is correct
18 Correct 8 ms 344 KB Output is correct
19 Correct 8 ms 344 KB Output is correct
20 Correct 7 ms 344 KB Output is correct
21 Correct 7 ms 344 KB Output is correct
22 Correct 7 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 8 ms 344 KB Output is correct
7 Correct 7 ms 344 KB Output is correct
8 Correct 8 ms 344 KB Output is correct
9 Correct 7 ms 344 KB Output is correct
10 Correct 7 ms 344 KB Output is correct
11 Correct 8 ms 344 KB Output is correct
12 Correct 8 ms 344 KB Output is correct
13 Correct 7 ms 344 KB Output is correct
14 Correct 9 ms 344 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Correct 7 ms 344 KB Output is correct
17 Correct 6 ms 344 KB Output is correct
18 Correct 8 ms 344 KB Output is correct
19 Correct 8 ms 344 KB Output is correct
20 Correct 7 ms 344 KB Output is correct
21 Correct 7 ms 344 KB Output is correct
22 Correct 7 ms 344 KB Output is correct
23 Correct 50 ms 344 KB Output is correct
24 Correct 55 ms 600 KB Output is correct
25 Correct 43 ms 1164 KB Output is correct
26 Correct 56 ms 600 KB Output is correct
27 Correct 39 ms 344 KB Output is correct
28 Correct 53 ms 844 KB Output is correct
29 Correct 52 ms 596 KB Output is correct
30 Correct 49 ms 416 KB Output is correct
31 Correct 50 ms 840 KB Output is correct
32 Correct 57 ms 676 KB Output is correct
33 Correct 60 ms 908 KB Output is correct
34 Correct 60 ms 1156 KB Output is correct
35 Correct 52 ms 600 KB Output is correct
36 Correct 50 ms 1096 KB Output is correct
37 Correct 58 ms 912 KB Output is correct
38 Correct 58 ms 916 KB Output is correct
39 Correct 42 ms 908 KB Output is correct
40 Correct 51 ms 912 KB Output is correct
41 Correct 47 ms 1424 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 544 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Partially correct 1 ms 344 KB Output is partially correct
7 Partially correct 122 ms 412 KB Output is partially correct
8 Partially correct 116 ms 1136 KB Output is partially correct
9 Partially correct 129 ms 656 KB Output is partially correct
10 Partially correct 116 ms 1120 KB Output is partially correct
11 Partially correct 119 ms 408 KB Output is partially correct
12 Partially correct 111 ms 668 KB Output is partially correct
13 Partially correct 136 ms 416 KB Output is partially correct
14 Partially correct 110 ms 660 KB Output is partially correct
15 Partially correct 130 ms 660 KB Output is partially correct
16 Partially correct 132 ms 664 KB Output is partially correct
17 Partially correct 121 ms 896 KB Output is partially correct
18 Partially correct 137 ms 908 KB Output is partially correct
19 Partially correct 115 ms 912 KB Output is partially correct
20 Partially correct 131 ms 1380 KB Output is partially correct
21 Partially correct 131 ms 916 KB Output is partially correct
22 Partially correct 130 ms 916 KB Output is partially correct
23 Partially correct 107 ms 880 KB Output is partially correct
24 Partially correct 117 ms 652 KB Output is partially correct
25 Partially correct 114 ms 912 KB Output is partially correct
26 Partially correct 104 ms 840 KB Output is partially correct
27 Partially correct 117 ms 1140 KB Output is partially correct
28 Partially correct 121 ms 1136 KB Output is partially correct
29 Partially correct 122 ms 1136 KB Output is partially correct
30 Partially correct 115 ms 1140 KB Output is partially correct
31 Partially correct 119 ms 664 KB Output is partially correct
32 Partially correct 136 ms 652 KB Output is partially correct
33 Partially correct 118 ms 836 KB Output is partially correct
34 Partially correct 123 ms 900 KB Output is partially correct
35 Partially correct 115 ms 1136 KB Output is partially correct
36 Partially correct 122 ms 668 KB Output is partially correct
37 Partially correct 124 ms 672 KB Output is partially correct
38 Partially correct 130 ms 668 KB Output is partially correct
39 Partially correct 113 ms 892 KB Output is partially correct
40 Partially correct 125 ms 900 KB Output is partially correct
41 Partially correct 117 ms 896 KB Output is partially correct
42 Partially correct 126 ms 900 KB Output is partially correct
43 Partially correct 25 ms 344 KB Output is partially correct
44 Partially correct 101 ms 408 KB Output is partially correct
45 Partially correct 116 ms 844 KB Output is partially correct
46 Partially correct 88 ms 916 KB Output is partially correct
47 Partially correct 109 ms 664 KB Output is partially correct
48 Partially correct 111 ms 1160 KB Output is partially correct