oj.uz

답안 #859283

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
859283 2023-10-10T03:19:30 Z MasterDobby 드문 곤충 (IOI22_insects) C++17
38.65 / 100
 105 ms 1436 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;

int ch[2020];

int min_cardinality(int n){
    int cnt=1,mx=0;
    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++;
            mx=n-i;
        }
        else{
            move_outside(i);
        }
    }
    if(cnt==1) return n;
    // 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=1,r=min((int)n/cnt,mx),now=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 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 3 ms 436 KB Output is correct
10 Correct 5 ms 600 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 5 ms 440 KB Output is correct
13 Correct 4 ms 600 KB Output is correct
14 Correct 2 ms 356 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 2 ms 600 KB Output is correct
17 Correct 2 ms 600 KB Output is correct
18 Correct 4 ms 600 KB Output is correct
19 Correct 2 ms 344 KB Output is correct
20 Correct 2 ms 600 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 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 3 ms 436 KB Output is correct
10 Correct 5 ms 600 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 5 ms 440 KB Output is correct
13 Correct 4 ms 600 KB Output is correct
14 Correct 2 ms 356 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 2 ms 600 KB Output is correct
17 Correct 2 ms 600 KB Output is correct
18 Correct 4 ms 600 KB Output is correct
19 Correct 2 ms 344 KB Output is correct
20 Correct 2 ms 600 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 5 ms 344 KB Output is correct
24 Correct 6 ms 600 KB Output is correct
25 Correct 11 ms 696 KB Output is correct
26 Correct 24 ms 600 KB Output is correct
27 Correct 43 ms 688 KB Output is correct
28 Correct 4 ms 344 KB Output is correct
29 Correct 43 ms 1436 KB Output is correct
30 Correct 22 ms 440 KB Output is correct
31 Correct 10 ms 600 KB Output is correct
32 Correct 12 ms 848 KB Output is correct
33 Correct 14 ms 1112 KB Output is correct
34 Correct 14 ms 848 KB Output is correct
35 Correct 13 ms 440 KB Output is correct
36 Correct 11 ms 856 KB Output is correct
37 Correct 12 ms 444 KB Output is correct
38 Correct 15 ms 440 KB Output is correct
39 Correct 10 ms 856 KB Output is correct
40 Correct 6 ms 444 KB Output is correct
41 Correct 5 ms 600 KB Output is correct

Subtask #3
13.65 / 75.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 1 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 12 ms 344 KB Output is correct
8 Correct 10 ms 440 KB Output is correct
9 Correct 23 ms 688 KB Output is correct
10 Partially correct 36 ms 852 KB Output is partially correct
11 Partially correct 91 ms 920 KB Output is partially correct
12 Correct 9 ms 600 KB Output is correct
13 Partially correct 105 ms 1176 KB Output is partially correct
14 Partially correct 56 ms 676 KB Output is partially correct
15 Correct 24 ms 592 KB Output is correct
16 Correct 26 ms 848 KB Output is correct
17 Correct 22 ms 680 KB Output is correct
18 Correct 30 ms 612 KB Output is correct
19 Correct 27 ms 592 KB Output is correct
20 Partially correct 29 ms 688 KB Output is partially correct
21 Partially correct 32 ms 1172 KB Output is partially correct
22 Partially correct 41 ms 592 KB Output is partially correct
23 Partially correct 36 ms 1100 KB Output is partially correct
24 Partially correct 25 ms 696 KB Output is partially correct
25 Correct 13 ms 856 KB Output is correct
26 Correct 9 ms 344 KB Output is correct
27 Correct 35 ms 688 KB Output is correct
28 Correct 17 ms 600 KB Output is correct
29 Correct 26 ms 848 KB Output is correct
30 Correct 29 ms 592 KB Output is correct
31 Partially correct 37 ms 1104 KB Output is partially correct
32 Partially correct 35 ms 1088 KB Output is partially correct
33 Partially correct 50 ms 908 KB Output is partially correct
34 Partially correct 38 ms 1112 KB Output is partially correct
35 Partially correct 32 ms 928 KB Output is partially correct
36 Correct 21 ms 440 KB Output is correct
37 Partially correct 36 ms 684 KB Output is partially correct
38 Partially correct 52 ms 600 KB Output is partially correct
39 Correct 32 ms 432 KB Output is correct
40 Correct 18 ms 600 KB Output is correct
41 Correct 33 ms 592 KB Output is correct
42 Partially correct 24 ms 592 KB Output is partially correct
43 Partially correct 17 ms 692 KB Output is partially correct
44 Partially correct 53 ms 696 KB Output is partially correct
45 Correct 20 ms 440 KB Output is correct
46 Correct 17 ms 600 KB Output is correct
47 Correct 14 ms 692 KB Output is correct
48 Correct 12 ms 1104 KB Output is correct