oj.uz

Submission #859236

# Submission time Handle Problem Language Result Execution time Memory
859236 2023-10-10T02:10:01 Z MasterDobby Rarest Insects (IOI22_insects) C++17
37.51 / 100
 116 ms 1656 KB 
#include <bits/stdc++.h>
#include "insects.h"
#define all(a) a.begin(),a.end()
#define pii pair<int,int>

using namespace std;
using ll = long long;

bitset<2020> ch;

int min_cardinality(int n){
    int cnt=1;
    ch[0]=1;
    move_inside(0);
    for(int i=1;i<n;i++){
        move_inside(i);
        int num=press_button();
        if(num==1){
            ch[i]=1;
            cnt++;
        }
        else{
            move_outside(i);
        }
    }
    int ans=1;
    // for(int i=2;i<=n;i++){
    //     int cnt2=0;
    //     for(int j=0;j<n;j++){
    //         if(cnt2==cnt) break;
    //         if(ch[j]) continue;
    //         move_inside(j);
    //         int num=press_button();
    //         if(num==i){
    //             ch[j]=1;
    //             cnt2++;
    //         }
    //         else{
    //             move_outside(j);
    //         }
    //     }
    //     if(cnt2!=cnt) break;
    //     ans=i;
    // }
    int l=1,r=n;
    while(l<r){
        int mid=(l+r+1)/2;
        int cnt2=cnt;
        vector<int> nw;
        for(int j=0;j<n;j++){
            if(cnt2==mid*cnt) break;
            if(ch[j]) continue;
            nw.push_back(j);
            move_inside(j);
            int num=press_button();
            if(num<=mid){
                // ch[j]=1;
                cnt2++;
            }
            else{
                move_outside(j);
            }
        }
        for(auto x:nw) move_outside(x);
        if(cnt2==mid*cnt) l=mid;
        else r=mid-1;
    }
    return l;
}

Compilation message

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:26:9: warning: unused variable 'ans' [-Wunused-variable]
   26 |     int ans=1;
      |         ^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 0 ms 344 KB Output is correct
6 Correct 6 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 6 ms 600 KB Output is correct
9 Correct 7 ms 600 KB Output is correct
10 Correct 7 ms 600 KB Output is correct
11 Correct 4 ms 344 KB Output is correct
12 Correct 6 ms 600 KB Output is correct
13 Correct 6 ms 432 KB Output is correct
14 Correct 7 ms 344 KB Output is correct
15 Correct 6 ms 600 KB Output is correct
16 Correct 7 ms 600 KB Output is correct
17 Correct 5 ms 600 KB Output is correct
18 Correct 6 ms 600 KB Output is correct
19 Correct 6 ms 436 KB Output is correct
20 Correct 6 ms 600 KB Output is correct
21 Correct 4 ms 344 KB Output is correct
22 Correct 3 ms 344 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 0 ms 344 KB Output is correct
6 Correct 6 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 6 ms 600 KB Output is correct
9 Correct 7 ms 600 KB Output is correct
10 Correct 7 ms 600 KB Output is correct
11 Correct 4 ms 344 KB Output is correct
12 Correct 6 ms 600 KB Output is correct
13 Correct 6 ms 432 KB Output is correct
14 Correct 7 ms 344 KB Output is correct
15 Correct 6 ms 600 KB Output is correct
16 Correct 7 ms 600 KB Output is correct
17 Correct 5 ms 600 KB Output is correct
18 Correct 6 ms 600 KB Output is correct
19 Correct 6 ms 436 KB Output is correct
20 Correct 6 ms 600 KB Output is correct
21 Correct 4 ms 344 KB Output is correct
22 Correct 3 ms 344 KB Output is correct
23 Correct 42 ms 600 KB Output is correct
24 Correct 5 ms 340 KB Output is correct
25 Correct 43 ms 916 KB Output is correct
26 Correct 44 ms 1068 KB Output is correct
27 Correct 50 ms 600 KB Output is correct
28 Correct 24 ms 600 KB Output is correct
29 Correct 45 ms 1184 KB Output is correct
30 Correct 43 ms 916 KB Output is correct
31 Correct 44 ms 672 KB Output is correct
32 Correct 40 ms 672 KB Output is correct
33 Correct 50 ms 1344 KB Output is correct
34 Correct 45 ms 1180 KB Output is correct
35 Correct 43 ms 856 KB Output is correct
36 Correct 41 ms 852 KB Output is correct
37 Correct 40 ms 1112 KB Output is correct
38 Correct 44 ms 920 KB Output is correct
39 Correct 33 ms 1348 KB Output is correct
40 Correct 26 ms 1428 KB Output is correct
41 Correct 18 ms 440 KB Output is correct

Subtask #3
12.51 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 0 ms 596 KB Output is correct
6 Partially correct 0 ms 344 KB Output is partially correct
7 Partially correct 91 ms 1164 KB Output is partially correct
8 Correct 8 ms 344 KB Output is correct
9 Partially correct 108 ms 1128 KB Output is partially correct
10 Partially correct 99 ms 1392 KB Output is partially correct
11 Partially correct 96 ms 1384 KB Output is partially correct
12 Partially correct 51 ms 1072 KB Output is partially correct
13 Partially correct 107 ms 668 KB Output is partially correct
14 Partially correct 107 ms 912 KB Output is partially correct
15 Partially correct 102 ms 1068 KB Output is partially correct
16 Partially correct 99 ms 916 KB Output is partially correct
17 Partially correct 108 ms 908 KB Output is partially correct
18 Partially correct 116 ms 664 KB Output is partially correct
19 Partially correct 107 ms 1148 KB Output is partially correct
20 Partially correct 100 ms 1084 KB Output is partially correct
21 Partially correct 103 ms 1148 KB Output is partially correct
22 Partially correct 104 ms 1160 KB Output is partially correct
23 Partially correct 94 ms 1320 KB Output is partially correct
24 Partially correct 77 ms 1156 KB Output is partially correct
25 Partially correct 69 ms 1656 KB Output is partially correct
26 Partially correct 39 ms 920 KB Output is partially correct
27 Partially correct 103 ms 920 KB Output is partially correct
28 Partially correct 104 ms 1152 KB Output is partially correct
29 Partially correct 108 ms 1148 KB Output is partially correct
30 Partially correct 104 ms 1180 KB Output is partially correct
31 Partially correct 106 ms 680 KB Output is partially correct
32 Partially correct 99 ms 912 KB Output is partially correct
33 Partially correct 98 ms 920 KB Output is partially correct
34 Partially correct 94 ms 920 KB Output is partially correct
35 Partially correct 106 ms 920 KB Output is partially correct
36 Partially correct 103 ms 1112 KB Output is partially correct
37 Partially correct 108 ms 1164 KB Output is partially correct
38 Partially correct 114 ms 920 KB Output is partially correct
39 Partially correct 106 ms 1148 KB Output is partially correct
40 Partially correct 101 ms 920 KB Output is partially correct
41 Partially correct 113 ms 848 KB Output is partially correct
42 Partially correct 113 ms 1180 KB Output is partially correct
43 Partially correct 23 ms 924 KB Output is partially correct
44 Partially correct 95 ms 672 KB Output is partially correct
45 Partially correct 97 ms 1088 KB Output is partially correct
46 Partially correct 62 ms 924 KB Output is partially correct
47 Partially correct 54 ms 668 KB Output is partially correct
48 Partially correct 51 ms 1160 KB Output is partially correct