oj.uz

Submission #942190

# Submission time Handle Problem Language Result Execution time Memory
942190 2024-03-10T10:39:47 Z benjaminkleyn Rarest Insects (IOI22_insects) C++17
99.95 / 100
 48 ms 1360 KB 
#include <bits/stdc++.h>
#include "insects.h"
using namespace std;

int cnt;
bool inside[2000];
bool bad[2000];

void init()
{
    cnt = 0;
    memset(inside, false, sizeof(inside));
    memset(bad, false, sizeof(bad));
}
void move_in(int i)
{
    if (inside[i])
        return;
    cnt++;
    inside[i] = true;
    move_inside(i);
}
void move_out(int i)
{
    if (!inside[i])
        return;
    cnt--;
    inside[i] = false;
    move_outside(i);
}

int min_cardinality(int N) 
{
    init();
    for (int i = 0; i < N; i++)
    {
        move_in(i);
        if (press_button() > 1)
            move_out(i);
    }
    int num_types = cnt;

    if (num_types == 1)
        return N;
    if (num_types == N)
        return 1;

    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    vector<int> p(N);
    iota(p.begin(), p.end(), 0);

    int lo = 1, hi = N / cnt, mid, ans;
    while (lo <= hi)
    {
        mid = (lo + hi) / 2;

        shuffle(p.begin(), p.end(), rng);

        vector<int> new_insects;
        vector<int> bad_insects;
        for (int i = 0; i < N; i++)
        {
            if (!(bad[i] || inside[i]))
            {
                move_in(i);

                if (press_button() > mid)
                {
                    bad_insects.push_back(i);
                    move_out(i);
                }
                else
                    new_insects.push_back(i);

                if (cnt >= mid * num_types)
                    break;
            }
        }

        if (cnt == mid * num_types)
            ans = mid, lo = mid + 1;
        else
        {
            for (int i : bad_insects)
                bad[i] = true;
            for (int i : new_insects)
                move_out(i);
            hi = mid - 1;
        }
    }
    return ans;
}

Compilation message

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:52:36: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
   52 |     int lo = 1, hi = N / cnt, mid, ans;
      |                                    ^~~

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 1 ms 344 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 2 ms 600 KB Output is correct
10 Correct 2 ms 448 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 2 ms 600 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 2 ms 600 KB Output is correct
15 Correct 4 ms 444 KB Output is correct
16 Correct 2 ms 600 KB Output is correct
17 Correct 2 ms 600 KB Output is correct
18 Correct 2 ms 344 KB Output is correct
19 Correct 2 ms 344 KB Output is correct
20 Correct 2 ms 444 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct

Subtask #2
15.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 1 ms 344 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 2 ms 600 KB Output is correct
10 Correct 2 ms 448 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 2 ms 600 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 2 ms 600 KB Output is correct
15 Correct 4 ms 444 KB Output is correct
16 Correct 2 ms 600 KB Output is correct
17 Correct 2 ms 600 KB Output is correct
18 Correct 2 ms 344 KB Output is correct
19 Correct 2 ms 344 KB Output is correct
20 Correct 2 ms 444 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 5 ms 344 KB Output is correct
24 Correct 4 ms 344 KB Output is correct
25 Correct 10 ms 600 KB Output is correct
26 Correct 12 ms 452 KB Output is correct
27 Correct 12 ms 1112 KB Output is correct
28 Correct 4 ms 600 KB Output is correct
29 Correct 10 ms 1112 KB Output is correct
30 Correct 14 ms 688 KB Output is correct
31 Correct 12 ms 600 KB Output is correct
32 Correct 10 ms 600 KB Output is correct
33 Correct 16 ms 600 KB Output is correct
34 Correct 12 ms 600 KB Output is correct
35 Correct 12 ms 444 KB Output is correct
36 Correct 13 ms 600 KB Output is correct
37 Correct 12 ms 676 KB Output is correct
38 Correct 18 ms 848 KB Output is correct
39 Correct 11 ms 444 KB Output is correct
40 Correct 8 ms 700 KB Output is correct
41 Correct 4 ms 600 KB Output is correct

Subtask #3
74.95 / 75.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 1 ms 340 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 12 ms 344 KB Output is correct
8 Correct 9 ms 344 KB Output is correct
9 Correct 22 ms 848 KB Output is correct
10 Correct 26 ms 1360 KB Output is correct
11 Correct 30 ms 432 KB Output is correct
12 Correct 13 ms 444 KB Output is correct
13 Correct 29 ms 848 KB Output is correct
14 Correct 27 ms 604 KB Output is correct
15 Correct 27 ms 344 KB Output is correct
16 Correct 22 ms 1100 KB Output is correct
17 Correct 24 ms 436 KB Output is correct
18 Correct 29 ms 600 KB Output is correct
19 Correct 26 ms 676 KB Output is correct
20 Correct 20 ms 592 KB Output is correct
21 Correct 27 ms 684 KB Output is correct
22 Correct 40 ms 852 KB Output is correct
23 Correct 23 ms 700 KB Output is correct
24 Correct 14 ms 848 KB Output is correct
25 Correct 20 ms 444 KB Output is correct
26 Correct 8 ms 592 KB Output is correct
27 Correct 20 ms 600 KB Output is correct
28 Correct 17 ms 444 KB Output is correct
29 Correct 27 ms 432 KB Output is correct
30 Correct 30 ms 688 KB Output is correct
31 Correct 32 ms 440 KB Output is correct
32 Correct 48 ms 432 KB Output is correct
33 Correct 22 ms 1104 KB Output is correct
34 Correct 21 ms 848 KB Output is correct
35 Partially correct 27 ms 608 KB Output is partially correct
36 Correct 28 ms 436 KB Output is correct
37 Correct 24 ms 428 KB Output is correct
38 Correct 30 ms 600 KB Output is correct
39 Correct 25 ms 676 KB Output is correct
40 Correct 19 ms 432 KB Output is correct
41 Correct 27 ms 436 KB Output is correct
42 Partially correct 34 ms 600 KB Output is partially correct
43 Correct 6 ms 600 KB Output is correct
44 Correct 23 ms 672 KB Output is correct
45 Correct 21 ms 936 KB Output is correct
46 Correct 17 ms 680 KB Output is correct
47 Correct 14 ms 676 KB Output is correct
48 Correct 14 ms 696 KB Output is correct