Submission #727260

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
727260	2023-04-20T10:26:08 Z	nasir_bashirov	Rarest Insects (IOI22_insects)	C++17	10 / 100	380 ms	208 KB

insects

#include <bits/stdc++.h>
#include "insects.h"
using namespace std;

#define endl '\n'
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pii>
#define vll vector<pll>
#define all(x) x.begin(), x.end()
#define fastio\
    ios_base::sync_with_stdio(0);\
    cin.tie(0);\
    cout.tie(0)\

int min_cardinality(int n){
    vi cnt(n, 1);
    for(int i = 0; i < n; i++){
        move_inside(i);
        for(int j = 0; j < n; j++){
            if(i == j)   continue;
            move_inside(j);
            int mx = press_button();
            if(mx > 1){
                cnt[i]++;
            }
            move_outside(j);
        }
        move_outside(i);
    }
    int res = 1e9;
    for(int i : cnt){
        res = min(res, i);
    }
    return res;
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	1 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	349 ms	208 KB	Output is correct
7	Correct	302 ms	208 KB	Output is correct
8	Correct	380 ms	208 KB	Output is correct
9	Correct	379 ms	208 KB	Output is correct
10	Correct	326 ms	208 KB	Output is correct
11	Correct	210 ms	208 KB	Output is correct
12	Correct	264 ms	208 KB	Output is correct
13	Correct	265 ms	208 KB	Output is correct
14	Correct	295 ms	208 KB	Output is correct
15	Correct	196 ms	208 KB	Output is correct
16	Correct	346 ms	208 KB	Output is correct
17	Correct	163 ms	208 KB	Output is correct
18	Correct	370 ms	208 KB	Output is correct
19	Correct	167 ms	208 KB	Output is correct
20	Correct	356 ms	208 KB	Output is correct
21	Correct	326 ms	208 KB	Output is correct
22	Correct	301 ms	208 KB	Output is correct

Subtask #2

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	1 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	349 ms	208 KB	Output is correct
7	Correct	302 ms	208 KB	Output is correct
8	Correct	380 ms	208 KB	Output is correct
9	Correct	379 ms	208 KB	Output is correct
10	Correct	326 ms	208 KB	Output is correct
11	Correct	210 ms	208 KB	Output is correct
12	Correct	264 ms	208 KB	Output is correct
13	Correct	265 ms	208 KB	Output is correct
14	Correct	295 ms	208 KB	Output is correct
15	Correct	196 ms	208 KB	Output is correct
16	Correct	346 ms	208 KB	Output is correct
17	Correct	163 ms	208 KB	Output is correct
18	Correct	370 ms	208 KB	Output is correct
19	Correct	167 ms	208 KB	Output is correct
20	Correct	356 ms	208 KB	Output is correct
21	Correct	326 ms	208 KB	Output is correct
22	Correct	301 ms	208 KB	Output is correct
23	Incorrect	243 ms	208 KB	Too many queries.
24	Halted	0 ms	0 KB	-

Subtask #3

0 / 75.0

#	Verdict	Execution time	Memory	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	0 ms	208 KB	Output is correct
5	Partially correct	1 ms	208 KB	Output is partially correct
6	Partially correct	1 ms	208 KB	Output is partially correct
7	Incorrect	378 ms	208 KB	Too many queries.
8	Halted	0 ms	0 KB	-