Submission #977474

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
977474	2024-05-08T03:39:32 Z	HappyCapybara	Rarest Insects (IOI22_insects)	C++17	10 / 100	217 ms	596 KB

insects

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

int min_cardinality(int n){
    vector<int> v;
    vector<int> s(n, 1);
    for (int i=0; i<n; i++) v.push_back(i);
    for (int i=0; i<n-1; i++){
        if (v[i] < i) continue;
        move_inside(i);
        for (int j=i+1; j<n; j++){
            if (v[j] < j) continue;
            move_inside(j);
            if (press_button() == 2){
                s[v[j]]--;
                s[v[i]]++;
                v[j] = v[i];
            }
            move_outside(j);
        }
        move_outside(i);
    }
    int bsf = n;
    for (int i=0; i<n; i++){
        if (s[i] != 0) bsf = min(bsf, s[i]);
    }
    return bsf;
}

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	1 ms	344 KB	Output is correct
7	Correct	112 ms	344 KB	Output is correct
8	Correct	7 ms	344 KB	Output is correct
9	Correct	5 ms	596 KB	Output is correct
10	Correct	2 ms	344 KB	Output is correct
11	Correct	22 ms	344 KB	Output is correct
12	Correct	3 ms	344 KB	Output is correct
13	Correct	7 ms	344 KB	Output is correct
14	Correct	3 ms	344 KB	Output is correct
15	Correct	4 ms	344 KB	Output is correct
16	Correct	4 ms	344 KB	Output is correct
17	Correct	5 ms	344 KB	Output is correct
18	Correct	5 ms	344 KB	Output is correct
19	Correct	7 ms	344 KB	Output is correct
20	Correct	22 ms	344 KB	Output is correct
21	Correct	40 ms	344 KB	Output is correct
22	Correct	64 ms	344 KB	Output is correct

Subtask #2

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	1 ms	344 KB	Output is correct
7	Correct	112 ms	344 KB	Output is correct
8	Correct	7 ms	344 KB	Output is correct
9	Correct	5 ms	596 KB	Output is correct
10	Correct	2 ms	344 KB	Output is correct
11	Correct	22 ms	344 KB	Output is correct
12	Correct	3 ms	344 KB	Output is correct
13	Correct	7 ms	344 KB	Output is correct
14	Correct	3 ms	344 KB	Output is correct
15	Correct	4 ms	344 KB	Output is correct
16	Correct	4 ms	344 KB	Output is correct
17	Correct	5 ms	344 KB	Output is correct
18	Correct	5 ms	344 KB	Output is correct
19	Correct	7 ms	344 KB	Output is correct
20	Correct	22 ms	344 KB	Output is correct
21	Correct	40 ms	344 KB	Output is correct
22	Correct	64 ms	344 KB	Output is correct
23	Correct	4 ms	344 KB	Output is correct
24	Incorrect	217 ms	344 KB	Too many queries.
25	Halted	0 ms	0 KB	-

Subtask #3

0 / 75.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 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	8 ms	344 KB	Output is correct
8	Incorrect	201 ms	596 KB	Too many queries.
9	Halted	0 ms	0 KB	-