Submission #1024648

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1024648	2024-07-16T08:52:33 Z	mansur	Rarest Insects (IOI22_insects)	C++17	10 / 100	301 ms	928 KB

insects

#include "insects.h"
#include <bits/stdc++.h>

using namespace std;

#define rall(s) s.rbegin(), s.rend()
#define all(s) s.begin(), s.end()
#define sz(s) (int) s.size()
#define s second 
#define f first 

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

int min_cardinality(int n) {
    vector<pair<int, vector<int>>> s;
    s.push_back({1, {0}});
    move_inside(0);
    for (int i = 1; i < n; i++) {
        move_inside(i);
        if (press_button() > 1) {
            bool ok = 0;
            sort(rall(s));
            for (int j = 0; j < sz(s); j++) {   
                if (s[j].f >= n / sz(s)) continue;
                move_outside(s[j].s.back());
                if (press_button() == 1) {
                    s[j].s.push_back(i);
                    s[j].f++;
                    ok = 1;
                    break;
                }
                move_inside(s[j].s.back());
            }
            if (!ok) move_outside(i);
            continue;
        }
        s.push_back({1, {i}});
    }
    sort(all(s));
    return s[0].f;
}

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	2 ms	344 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	10 ms	344 KB	Output is correct
9	Correct	6 ms	344 KB	Output is correct
10	Correct	2 ms	344 KB	Output is correct
11	Correct	29 ms	420 KB	Output is correct
12	Correct	3 ms	344 KB	Output is correct
13	Correct	8 ms	436 KB	Output is correct
14	Correct	5 ms	340 KB	Output is correct
15	Correct	4 ms	596 KB	Output is correct
16	Correct	7 ms	344 KB	Output is correct
17	Correct	7 ms	344 KB	Output is correct
18	Correct	8 ms	344 KB	Output is correct
19	Correct	8 ms	436 KB	Output is correct
20	Correct	19 ms	344 KB	Output is correct
21	Correct	18 ms	344 KB	Output is correct
22	Correct	5 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	2 ms	344 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	10 ms	344 KB	Output is correct
9	Correct	6 ms	344 KB	Output is correct
10	Correct	2 ms	344 KB	Output is correct
11	Correct	29 ms	420 KB	Output is correct
12	Correct	3 ms	344 KB	Output is correct
13	Correct	8 ms	436 KB	Output is correct
14	Correct	5 ms	340 KB	Output is correct
15	Correct	4 ms	596 KB	Output is correct
16	Correct	7 ms	344 KB	Output is correct
17	Correct	7 ms	344 KB	Output is correct
18	Correct	8 ms	344 KB	Output is correct
19	Correct	8 ms	436 KB	Output is correct
20	Correct	19 ms	344 KB	Output is correct
21	Correct	18 ms	344 KB	Output is correct
22	Correct	5 ms	344 KB	Output is correct
23	Correct	11 ms	344 KB	Output is correct
24	Correct	5 ms	704 KB	Output is correct
25	Correct	107 ms	592 KB	Output is correct
26	Correct	86 ms	412 KB	Output is correct
27	Correct	7 ms	344 KB	Output is correct
28	Incorrect	301 ms	928 KB	Too many queries.
29	Halted	0 ms	0 KB	-

Subtask #3

0 / 75.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	1 ms	344 KB	Output is correct
7	Correct	17 ms	432 KB	Output is correct
8	Correct	6 ms	344 KB	Output is correct
9	Incorrect	238 ms	680 KB	Too many queries.
10	Halted	0 ms	0 KB	-