Submission #836516

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
836516	2023-08-24T12:13:57 Z	SamAnd	Rarest Insects (IOI22_insects)	C++17	58.38 / 100	107 ms	584 KB

insects

#include "insects.h"
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
typedef long long ll;
const int N = 2003;

vector<int> q[N];
int min_cardinality(int N)
{
    vector<int> v;
    vector<int> b;
    for (int i = 0; i < N; ++i)
    {
        move_inside(i);
        if (press_button() == 1)
        {
            v.push_back(i);
        }
        else
        {
            move_outside(i);
            b.push_back(i);
        }
    }
    for (int i = 0; i < sz(v); ++i)
        move_outside(v[i]);

    if (sz(v) > 200)
    {
        int ans = 1;
        while (!b.empty())
        {
            vector<int> vv;
            vector<int> bb;
            for (int i = 0; i < sz(b); ++i)
            {
                if (sz(v) == sz(vv))
                {
                    bb.push_back(b[i]);
                    continue;
                }
                move_inside(b[i]);
                if (press_button() == 1)
                {
                    vv.push_back(b[i]);
                }
                else
                {
                    move_outside(b[i]);
                    bb.push_back(b[i]);
                }
            }
            if (sz(vv) < sz(v))
                break;
            ++ans;
            for (int i = 0; i < sz(vv); ++i)
                move_outside(vv[i]);
            b = bb;
        }
        return ans;
    }

    vector<int> l, r, u;
    l.assign(sz(b), 0);
    r.assign(sz(b), sz(v) - 1);
    u.assign(sz(b), -1);
    while (1)
    {
        for (int i = 0; i < sz(v); ++i)
            q[i].clear();
        bool z = false;
        for (int i = 0; i < sz(b); ++i)
        {
            if (l[i] <= r[i])
            {
                int m = (l[i] + r[i]) / 2;
                q[m].push_back(i);
                z = true;
            }
        }
        if (!z)
            break;
        for (int i = 0; i < sz(v); ++i)
        {
            move_inside(v[i]);
            for (int j = 0; j < sz(q[i]); ++j)
            {
                move_inside(b[q[i][j]]);
                if (press_button() == 2)
                {
                    u[q[i][j]] = i;
                    r[q[i][j]] = i - 1;
                }
                else
                    l[q[i][j]] = i + 1;
                move_outside(b[q[i][j]]);
            }
        }
        for (int i = 0; i < sz(v); ++i)
        {
            move_outside(v[i]);
        }
    }

    vector<int> q;
    q.assign(sz(v), 1);
    for (int i = 0; i < sz(b); ++i)
        ++q[u[i]];
    int ans = q[0];
    for (int i = 0; i < sz(v); ++i)
        ans = min(ans, q[i]);
    return ans;
}

/*
10
1 1 2 2 1 2 3 3 3 4
*/

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	336 KB	Output is correct
2	Correct	0 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	0 ms	336 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	3 ms	336 KB	Output is correct
7	Correct	3 ms	336 KB	Output is correct
8	Correct	9 ms	336 KB	Output is correct
9	Correct	8 ms	348 KB	Output is correct
10	Correct	5 ms	356 KB	Output is correct
11	Correct	8 ms	336 KB	Output is correct
12	Correct	4 ms	336 KB	Output is correct
13	Correct	6 ms	476 KB	Output is correct
14	Correct	6 ms	336 KB	Output is correct
15	Correct	6 ms	336 KB	Output is correct
16	Correct	5 ms	336 KB	Output is correct
17	Correct	6 ms	336 KB	Output is correct
18	Correct	8 ms	336 KB	Output is correct
19	Correct	7 ms	348 KB	Output is correct
20	Correct	9 ms	336 KB	Output is correct
21	Correct	8 ms	460 KB	Output is correct
22	Correct	4 ms	336 KB	Output is correct

Subtask #2
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	336 KB	Output is correct
2	Correct	0 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	0 ms	336 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	3 ms	336 KB	Output is correct
7	Correct	3 ms	336 KB	Output is correct
8	Correct	9 ms	336 KB	Output is correct
9	Correct	8 ms	348 KB	Output is correct
10	Correct	5 ms	356 KB	Output is correct
11	Correct	8 ms	336 KB	Output is correct
12	Correct	4 ms	336 KB	Output is correct
13	Correct	6 ms	476 KB	Output is correct
14	Correct	6 ms	336 KB	Output is correct
15	Correct	6 ms	336 KB	Output is correct
16	Correct	5 ms	336 KB	Output is correct
17	Correct	6 ms	336 KB	Output is correct
18	Correct	8 ms	336 KB	Output is correct
19	Correct	7 ms	348 KB	Output is correct
20	Correct	9 ms	336 KB	Output is correct
21	Correct	8 ms	460 KB	Output is correct
22	Correct	4 ms	336 KB	Output is correct
23	Correct	12 ms	464 KB	Output is correct
24	Correct	6 ms	336 KB	Output is correct
25	Correct	43 ms	476 KB	Output is correct
26	Correct	28 ms	496 KB	Output is correct
27	Correct	13 ms	336 KB	Output is correct
28	Correct	11 ms	336 KB	Output is correct
29	Correct	16 ms	456 KB	Output is correct
30	Correct	31 ms	584 KB	Output is correct
31	Correct	25 ms	336 KB	Output is correct
32	Correct	31 ms	336 KB	Output is correct
33	Correct	38 ms	368 KB	Output is correct
34	Correct	28 ms	336 KB	Output is correct
35	Correct	24 ms	456 KB	Output is correct
36	Correct	39 ms	344 KB	Output is correct
37	Correct	43 ms	372 KB	Output is correct
38	Correct	58 ms	360 KB	Output is correct
39	Correct	46 ms	368 KB	Output is correct
40	Correct	10 ms	336 KB	Output is correct
41	Correct	12 ms	352 KB	Output is correct

Subtask #3
33.38 / 75.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	388 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	0 ms	336 KB	Output is correct
4	Correct	0 ms	336 KB	Output is correct
5	Correct	0 ms	336 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	27 ms	356 KB	Output is correct
8	Correct	13 ms	336 KB	Output is correct
9	Partially correct	96 ms	336 KB	Output is partially correct
10	Partially correct	78 ms	516 KB	Output is partially correct
11	Correct	37 ms	384 KB	Output is correct
12	Correct	20 ms	352 KB	Output is correct
13	Partially correct	59 ms	376 KB	Output is partially correct
14	Partially correct	90 ms	336 KB	Output is partially correct
15	Partially correct	45 ms	336 KB	Output is partially correct
16	Partially correct	33 ms	372 KB	Output is partially correct
17	Partially correct	66 ms	384 KB	Output is partially correct
18	Partially correct	51 ms	376 KB	Output is partially correct
19	Partially correct	88 ms	344 KB	Output is partially correct
20	Partially correct	47 ms	584 KB	Output is partially correct
21	Partially correct	87 ms	520 KB	Output is partially correct
22	Partially correct	93 ms	408 KB	Output is partially correct
23	Partially correct	107 ms	372 KB	Output is partially correct
24	Correct	21 ms	348 KB	Output is correct
25	Correct	19 ms	460 KB	Output is correct
26	Correct	19 ms	340 KB	Output is correct
27	Partially correct	82 ms	480 KB	Output is partially correct
28	Partially correct	89 ms	344 KB	Output is partially correct
29	Partially correct	68 ms	416 KB	Output is partially correct
30	Partially correct	47 ms	456 KB	Output is partially correct
31	Partially correct	80 ms	360 KB	Output is partially correct
32	Partially correct	58 ms	460 KB	Output is partially correct
33	Partially correct	93 ms	420 KB	Output is partially correct
34	Partially correct	94 ms	508 KB	Output is partially correct
35	Partially correct	94 ms	448 KB	Output is partially correct
36	Partially correct	55 ms	384 KB	Output is partially correct
37	Partially correct	90 ms	416 KB	Output is partially correct
38	Partially correct	69 ms	472 KB	Output is partially correct
39	Partially correct	97 ms	408 KB	Output is partially correct
40	Partially correct	53 ms	464 KB	Output is partially correct
41	Partially correct	80 ms	336 KB	Output is partially correct
42	Partially correct	83 ms	420 KB	Output is partially correct
43	Partially correct	12 ms	376 KB	Output is partially correct
44	Partially correct	33 ms	400 KB	Output is partially correct
45	Correct	38 ms	348 KB	Output is correct
46	Correct	26 ms	340 KB	Output is correct
47	Correct	19 ms	340 KB	Output is correct
48	Correct	19 ms	340 KB	Output is correct

Submission #836516

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 15.0 / 15.0

Subtask #3 33.38 / 75.0

Subtask #1
10.0 / 10.0

Subtask #2
15.0 / 15.0

Subtask #3
33.38 / 75.0