oj.uz

답안 #859265

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
859265 2023-10-10T02:52:33 Z MasterDobby 드문 곤충 (IOI22_insects) C++17
25 / 100
 212 ms 852 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((int)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((int)n/cnt,cnt)) return ans;
    int l=min((int)n/cnt,cnt),r=(int)n/cnt,now=cnt*min((int)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

# 결과 실행 시간 메모리 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 2 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 3 ms 344 KB Output is correct
16 Correct 4 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 2 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 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 2 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 3 ms 344 KB Output is correct
16 Correct 4 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 2 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 4 ms 344 KB Output is correct
25 Correct 33 ms 340 KB Output is correct
26 Correct 29 ms 344 KB Output is correct
27 Correct 7 ms 344 KB Output is correct
28 Correct 5 ms 344 KB Output is correct
29 Correct 16 ms 344 KB Output is correct
30 Correct 9 ms 344 KB Output is correct
31 Correct 14 ms 440 KB Output is correct
32 Correct 15 ms 604 KB Output is correct
33 Correct 16 ms 408 KB Output is correct
34 Correct 14 ms 600 KB Output is correct
35 Correct 16 ms 344 KB Output is correct
36 Correct 27 ms 408 KB Output is correct
37 Correct 25 ms 344 KB Output is correct
38 Correct 13 ms 344 KB Output is correct
39 Correct 7 ms 344 KB Output is correct
40 Correct 7 ms 344 KB Output is correct
41 Correct 4 ms 344 KB Output is correct

Subtask #3
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 356 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 0 ms 344 KB Output is correct
7 Correct 17 ms 600 KB Output is correct
8 Correct 8 ms 344 KB Output is correct
9 Partially correct 72 ms 344 KB Output is partially correct
10 Partially correct 96 ms 344 KB Output is partially correct
11 Correct 27 ms 344 KB Output is correct
12 Correct 12 ms 344 KB Output is correct
13 Correct 37 ms 344 KB Output is correct
14 Correct 19 ms 340 KB Output is correct
15 Correct 29 ms 412 KB Output is correct
16 Correct 29 ms 600 KB Output is correct
17 Correct 22 ms 428 KB Output is correct
18 Partially correct 34 ms 436 KB Output is partially correct
19 Partially correct 33 ms 424 KB Output is partially correct
20 Partially correct 36 ms 420 KB Output is partially correct
21 Partially correct 80 ms 344 KB Output is partially correct
22 Partially correct 69 ms 344 KB Output is partially correct
23 Correct 15 ms 344 KB Output is correct
24 Correct 18 ms 344 KB Output is correct
25 Correct 10 ms 344 KB Output is correct
26 Correct 8 ms 344 KB Output is correct
27 Partially correct 49 ms 344 KB Output is partially correct
28 Correct 18 ms 344 KB Output is correct
29 Correct 29 ms 852 KB Output is correct
30 Incorrect 212 ms 344 KB Too many queries.
31 Halted 0 ms 0 KB -