Submission #836443

# Submission time Handle Problem Language Result Execution time Memory
836443 2023-08-24T11:16:25 Z SamAnd Rarest Insects (IOI22_insects) C++17
48.03 / 100
126 ms 484 KB
#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]);

    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
*/
# 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 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 4 ms 336 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 8 ms 336 KB Output is correct
9 Correct 5 ms 480 KB Output is correct
10 Correct 2 ms 336 KB Output is correct
11 Correct 4 ms 348 KB Output is correct
12 Correct 6 ms 356 KB Output is correct
13 Correct 7 ms 352 KB Output is correct
14 Correct 6 ms 336 KB Output is correct
15 Correct 8 ms 336 KB Output is correct
16 Correct 5 ms 336 KB Output is correct
17 Correct 8 ms 336 KB Output is correct
18 Correct 8 ms 352 KB Output is correct
19 Correct 9 ms 344 KB Output is correct
20 Correct 9 ms 352 KB Output is correct
21 Correct 4 ms 344 KB Output is correct
22 Correct 5 ms 352 KB Output is correct
# 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 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 4 ms 336 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 8 ms 336 KB Output is correct
9 Correct 5 ms 480 KB Output is correct
10 Correct 2 ms 336 KB Output is correct
11 Correct 4 ms 348 KB Output is correct
12 Correct 6 ms 356 KB Output is correct
13 Correct 7 ms 352 KB Output is correct
14 Correct 6 ms 336 KB Output is correct
15 Correct 8 ms 336 KB Output is correct
16 Correct 5 ms 336 KB Output is correct
17 Correct 8 ms 336 KB Output is correct
18 Correct 8 ms 352 KB Output is correct
19 Correct 9 ms 344 KB Output is correct
20 Correct 9 ms 352 KB Output is correct
21 Correct 4 ms 344 KB Output is correct
22 Correct 5 ms 352 KB Output is correct
23 Correct 16 ms 336 KB Output is correct
24 Correct 4 ms 336 KB Output is correct
25 Correct 33 ms 368 KB Output is correct
26 Correct 42 ms 356 KB Output is correct
27 Correct 17 ms 356 KB Output is correct
28 Correct 36 ms 344 KB Output is correct
29 Correct 24 ms 456 KB Output is correct
30 Correct 39 ms 356 KB Output is correct
31 Correct 24 ms 336 KB Output is correct
32 Correct 22 ms 368 KB Output is correct
33 Correct 38 ms 352 KB Output is correct
34 Correct 40 ms 352 KB Output is correct
35 Correct 41 ms 352 KB Output is correct
36 Correct 37 ms 352 KB Output is correct
37 Correct 34 ms 368 KB Output is correct
38 Correct 48 ms 360 KB Output is correct
39 Correct 51 ms 352 KB Output is correct
40 Correct 26 ms 348 KB Output is correct
41 Correct 36 ms 360 KB Output is correct
# 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 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 20 ms 352 KB Output is correct
8 Correct 10 ms 352 KB Output is correct
9 Partially correct 108 ms 420 KB Output is partially correct
10 Partially correct 109 ms 372 KB Output is partially correct
11 Correct 27 ms 356 KB Output is correct
12 Partially correct 51 ms 480 KB Output is partially correct
13 Partially correct 65 ms 348 KB Output is partially correct
14 Partially correct 105 ms 420 KB Output is partially correct
15 Partially correct 62 ms 392 KB Output is partially correct
16 Partially correct 47 ms 384 KB Output is partially correct
17 Partially correct 71 ms 388 KB Output is partially correct
18 Partially correct 36 ms 400 KB Output is partially correct
19 Partially correct 62 ms 404 KB Output is partially correct
20 Partially correct 85 ms 396 KB Output is partially correct
21 Partially correct 85 ms 416 KB Output is partially correct
22 Partially correct 94 ms 400 KB Output is partially correct
23 Partially correct 76 ms 416 KB Output is partially correct
24 Partially correct 126 ms 404 KB Output is partially correct
25 Partially correct 83 ms 376 KB Output is partially correct
26 Partially correct 77 ms 364 KB Output is partially correct
27 Partially correct 89 ms 396 KB Output is partially correct
28 Partially correct 96 ms 472 KB Output is partially correct
29 Partially correct 69 ms 416 KB Output is partially correct
30 Partially correct 88 ms 412 KB Output is partially correct
31 Partially correct 75 ms 452 KB Output is partially correct
32 Partially correct 86 ms 416 KB Output is partially correct
33 Partially correct 115 ms 344 KB Output is partially correct
34 Partially correct 85 ms 348 KB Output is partially correct
35 Partially correct 122 ms 336 KB Output is partially correct
36 Partially correct 101 ms 416 KB Output is partially correct
37 Partially correct 84 ms 404 KB Output is partially correct
38 Partially correct 88 ms 376 KB Output is partially correct
39 Partially correct 111 ms 416 KB Output is partially correct
40 Partially correct 95 ms 404 KB Output is partially correct
41 Partially correct 74 ms 484 KB Output is partially correct
42 Partially correct 50 ms 356 KB Output is partially correct
43 Partially correct 14 ms 336 KB Output is partially correct
44 Partially correct 34 ms 376 KB Output is partially correct
45 Correct 32 ms 360 KB Output is correct
46 Partially correct 86 ms 380 KB Output is partially correct
47 Partially correct 104 ms 392 KB Output is partially correct
48 Partially correct 52 ms 396 KB Output is partially correct