답안 #627659

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
627659	2022-08-12T18:12:56 Z	Carmel_Ab1	드문 곤충 (IOI22_insects)	C++17	53.13 / 100	194 ms	400 KB

insects

/*
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
 */
#include<bits/stdc++.h>
#include "insects.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int>vi;
typedef vector<vector<int>>vvi;
typedef vector<ll>vl;
typedef vector<vl> vvl;
typedef pair<int,int>pi;
typedef pair<ll,ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld,ld> pld;
typedef vector<pi> vpi;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T> ostream& operator<<(ostream& os, vector<T>& a){os<<"[";for(int i=0; i<ll(a.size()); i++){os << a[i] << ((i!=ll(a.size()-1)?" ":""));}os << "]\n"; return os;}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define outfl(x){cout << x << endl;return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map


int min_cardinality(int n){
    int diff=0;
    vector<bool>in(n);
    for(int i=0; i<n; i++){
        move_inside(i),in[i]=1;
        diff++;
        if(press_button()!=1)
            move_outside(i),diff--,in[i]=0;
    }
    for(int i=0; i<n; i++)
        if(in[i])
            move_outside(i),in[i]=0;
        
    int l=2,r=n/diff,ans=1;
    while(l<=r){
        int m=(l+r)/2;
        
        int good=n;
        for(int i=0; i<n;i ++){
            if(in[i])continue;
            move_inside(i);
            in[i]=1;
            int p=press_button();
            if(p>m)
                good--, move_outside(i), in[i]=0;
        }
        if(diff*m<=good)
            l=m+1,ans=m;
        else {
            r = m - 1;
            for(int i=0; i<n;i ++)
                if(in[i])
                    in[i]=0, move_outside(i);
        }
    }

    return ans;

}

Subtask #1

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	1 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	0 ms	208 KB	Output is correct
6	Correct	8 ms	208 KB	Output is correct
7	Correct	3 ms	208 KB	Output is correct
8	Correct	6 ms	208 KB	Output is correct
9	Correct	4 ms	208 KB	Output is correct
10	Correct	18 ms	208 KB	Output is correct
11	Correct	4 ms	208 KB	Output is correct
12	Correct	13 ms	208 KB	Output is correct
13	Correct	12 ms	240 KB	Output is correct
14	Correct	4 ms	208 KB	Output is correct
15	Correct	5 ms	208 KB	Output is correct
16	Correct	9 ms	208 KB	Output is correct
17	Correct	12 ms	208 KB	Output is correct
18	Correct	13 ms	208 KB	Output is correct
19	Correct	6 ms	208 KB	Output is correct
20	Correct	3 ms	208 KB	Output is correct
21	Correct	5 ms	208 KB	Output is correct
22	Correct	4 ms	208 KB	Output is correct

Subtask #2

15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	1 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	0 ms	208 KB	Output is correct
6	Correct	8 ms	208 KB	Output is correct
7	Correct	3 ms	208 KB	Output is correct
8	Correct	6 ms	208 KB	Output is correct
9	Correct	4 ms	208 KB	Output is correct
10	Correct	18 ms	208 KB	Output is correct
11	Correct	4 ms	208 KB	Output is correct
12	Correct	13 ms	208 KB	Output is correct
13	Correct	12 ms	240 KB	Output is correct
14	Correct	4 ms	208 KB	Output is correct
15	Correct	5 ms	208 KB	Output is correct
16	Correct	9 ms	208 KB	Output is correct
17	Correct	12 ms	208 KB	Output is correct
18	Correct	13 ms	208 KB	Output is correct
19	Correct	6 ms	208 KB	Output is correct
20	Correct	3 ms	208 KB	Output is correct
21	Correct	5 ms	208 KB	Output is correct
22	Correct	4 ms	208 KB	Output is correct
23	Correct	21 ms	208 KB	Output is correct
24	Correct	5 ms	208 KB	Output is correct
25	Correct	30 ms	208 KB	Output is correct
26	Correct	64 ms	280 KB	Output is correct
27	Correct	88 ms	208 KB	Output is correct
28	Correct	13 ms	208 KB	Output is correct
29	Correct	90 ms	208 KB	Output is correct
30	Correct	26 ms	208 KB	Output is correct
31	Correct	40 ms	300 KB	Output is correct
32	Correct	48 ms	280 KB	Output is correct
33	Correct	54 ms	208 KB	Output is correct
34	Correct	41 ms	208 KB	Output is correct
35	Correct	39 ms	208 KB	Output is correct
36	Correct	37 ms	208 KB	Output is correct
37	Correct	17 ms	276 KB	Output is correct
38	Correct	33 ms	208 KB	Output is correct
39	Correct	24 ms	208 KB	Output is correct
40	Correct	11 ms	208 KB	Output is correct
41	Correct	9 ms	208 KB	Output is correct

Subtask #3

28.13 / 75.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	1 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	0 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	40 ms	208 KB	Output is correct
8	Correct	23 ms	208 KB	Output is correct
9	Correct	23 ms	208 KB	Output is correct
10	Partially correct	108 ms	280 KB	Output is partially correct
11	Partially correct	194 ms	208 KB	Output is partially correct
12	Correct	32 ms	208 KB	Output is correct
13	Partially correct	163 ms	208 KB	Output is partially correct
14	Partially correct	96 ms	208 KB	Output is partially correct
15	Partially correct	87 ms	280 KB	Output is partially correct
16	Partially correct	95 ms	280 KB	Output is partially correct
17	Partially correct	57 ms	280 KB	Output is partially correct
18	Partially correct	98 ms	208 KB	Output is partially correct
19	Partially correct	73 ms	208 KB	Output is partially correct
20	Partially correct	42 ms	276 KB	Output is partially correct
21	Partially correct	98 ms	280 KB	Output is partially correct
22	Partially correct	77 ms	280 KB	Output is partially correct
23	Partially correct	79 ms	208 KB	Output is partially correct
24	Correct	50 ms	276 KB	Output is correct
25	Correct	58 ms	284 KB	Output is correct
26	Correct	16 ms	208 KB	Output is correct
27	Correct	44 ms	208 KB	Output is correct
28	Correct	33 ms	208 KB	Output is correct
29	Partially correct	78 ms	280 KB	Output is partially correct
30	Partially correct	27 ms	276 KB	Output is partially correct
31	Partially correct	80 ms	400 KB	Output is partially correct
32	Partially correct	112 ms	284 KB	Output is partially correct
33	Partially correct	92 ms	284 KB	Output is partially correct
34	Partially correct	101 ms	208 KB	Output is partially correct
35	Partially correct	64 ms	284 KB	Output is partially correct
36	Partially correct	62 ms	208 KB	Output is partially correct
37	Partially correct	55 ms	284 KB	Output is partially correct
38	Partially correct	112 ms	280 KB	Output is partially correct
39	Correct	45 ms	208 KB	Output is correct
40	Correct	52 ms	208 KB	Output is correct
41	Partially correct	43 ms	208 KB	Output is partially correct
42	Partially correct	61 ms	208 KB	Output is partially correct
43	Partially correct	39 ms	208 KB	Output is partially correct
44	Partially correct	169 ms	208 KB	Output is partially correct
45	Correct	49 ms	208 KB	Output is correct
46	Correct	22 ms	280 KB	Output is correct
47	Correct	39 ms	208 KB	Output is correct
48	Correct	36 ms	280 KB	Output is correct