oj.uz

Submission #859263

# Submission time Handle Problem Language Result Execution time Memory
859263 2023-10-10T02:48:51 Z MasterDobby Rarest Insects (IOI22_insects) C++17
25 / 100
 185 ms 928 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<=min(n/cnt,cnt);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;
    }
    if(ans!=min(n/cnt,cnt)) return ans;
    int l=min(n/cnt,cnt),r=n/cnt,now=cnt*min(n/cnt,cnt);
    while(l<r){
        int mid=(l+r+1)/2;
        int cnt2=now;
        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);
            }
        }
        if(cnt2==mid*cnt) l=mid,now=cnt2;
        else{
            r=mid-1;
            for(auto x:nw) move_outside(x),ch[x]=0;
        }
    }
    return l;
}

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 2 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Correct 3 ms 340 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 2 ms 344 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 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 2 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Correct 3 ms 340 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 2 ms 344 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 9 ms 600 KB Output is correct
24 Correct 5 ms 344 KB Output is correct
25 Correct 33 ms 344 KB Output is correct
26 Correct 33 ms 344 KB Output is correct
27 Correct 10 ms 344 KB Output is correct
28 Correct 4 ms 344 KB Output is correct
29 Correct 13 ms 344 KB Output is correct
30 Correct 8 ms 344 KB Output is correct
31 Correct 12 ms 600 KB Output is correct
32 Correct 10 ms 600 KB Output is correct
33 Correct 14 ms 428 KB Output is correct
34 Correct 17 ms 408 KB Output is correct
35 Correct 17 ms 408 KB Output is correct
36 Correct 26 ms 424 KB Output is correct
37 Correct 23 ms 344 KB Output is correct
38 Correct 14 ms 344 KB Output is correct
39 Correct 8 ms 344 KB Output is correct
40 Correct 8 ms 344 KB Output is correct
41 Correct 4 ms 344 KB Output is correct

Subtask #3
0 / 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 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 19 ms 432 KB Output is correct
8 Correct 9 ms 344 KB Output is correct
9 Partially correct 71 ms 344 KB Output is partially correct
10 Partially correct 81 ms 344 KB Output is partially correct
11 Correct 19 ms 344 KB Output is correct
12 Correct 13 ms 344 KB Output is correct
13 Correct 24 ms 344 KB Output is correct
14 Correct 17 ms 344 KB Output is correct
15 Correct 23 ms 600 KB Output is correct
16 Correct 24 ms 928 KB Output is correct
17 Correct 22 ms 588 KB Output is correct
18 Partially correct 37 ms 924 KB Output is partially correct
19 Partially correct 29 ms 852 KB Output is partially correct
20 Partially correct 36 ms 676 KB Output is partially correct
21 Partially correct 60 ms 344 KB Output is partially correct
22 Partially correct 52 ms 344 KB Output is partially correct
23 Correct 15 ms 344 KB Output is correct
24 Correct 16 ms 344 KB Output is correct
25 Correct 13 ms 344 KB Output is correct
26 Correct 9 ms 344 KB Output is correct
27 Partially correct 46 ms 344 KB Output is partially correct
28 Correct 20 ms 340 KB Output is correct
29 Correct 26 ms 420 KB Output is correct
30 Incorrect 185 ms 344 KB Too many queries.
31 Halted 0 ms 0 KB -