oj.uz

답안 #942194

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
942194 2024-03-10T10:41:03 Z benjaminkleyn 드문 곤충 (IOI22_insects) C++17
100 / 100
 27 ms 1104 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 idx = 0; idx < N; idx++)
        {
            int i = p[idx];
            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

# 결과 실행 시간 메모리 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 440 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 2 ms 444 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 2 ms 440 KB Output is correct
17 Correct 2 ms 600 KB Output is correct
18 Correct 2 ms 444 KB Output is correct
19 Correct 2 ms 600 KB Output is correct
20 Correct 2 ms 600 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

# 결과 실행 시간 메모리 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 440 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 2 ms 444 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 2 ms 440 KB Output is correct
17 Correct 2 ms 600 KB Output is correct
18 Correct 2 ms 444 KB Output is correct
19 Correct 2 ms 600 KB Output is correct
20 Correct 2 ms 600 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 4 ms 344 KB Output is correct
24 Correct 4 ms 344 KB Output is correct
25 Correct 12 ms 848 KB Output is correct
26 Correct 12 ms 700 KB Output is correct
27 Correct 10 ms 696 KB Output is correct
28 Correct 4 ms 600 KB Output is correct
29 Correct 11 ms 440 KB Output is correct
30 Correct 12 ms 608 KB Output is correct
31 Correct 10 ms 600 KB Output is correct
32 Correct 9 ms 440 KB Output is correct
33 Correct 11 ms 600 KB Output is correct
34 Correct 10 ms 600 KB Output is correct
35 Correct 10 ms 600 KB Output is correct
36 Correct 12 ms 856 KB Output is correct
37 Correct 11 ms 600 KB Output is correct
38 Correct 11 ms 1104 KB Output is correct
39 Correct 9 ms 436 KB Output is correct
40 Correct 8 ms 440 KB Output is correct
41 Correct 4 ms 600 KB Output is correct

Subtask #3
75.0 / 75.0

# 결과 실행 시간 메모리 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 0 ms 344 KB Output is correct
7 Correct 8 ms 344 KB Output is correct
8 Correct 7 ms 340 KB Output is correct
9 Correct 22 ms 428 KB Output is correct
10 Correct 23 ms 952 KB Output is correct
11 Correct 24 ms 684 KB Output is correct
12 Correct 12 ms 592 KB Output is correct
13 Correct 23 ms 684 KB Output is correct
14 Correct 26 ms 848 KB Output is correct
15 Correct 22 ms 688 KB Output is correct
16 Correct 22 ms 600 KB Output is correct
17 Correct 20 ms 592 KB Output is correct
18 Correct 25 ms 856 KB Output is correct
19 Correct 21 ms 600 KB Output is correct
20 Correct 24 ms 604 KB Output is correct
21 Correct 24 ms 932 KB Output is correct
22 Correct 22 ms 600 KB Output is correct
23 Correct 18 ms 948 KB Output is correct
24 Correct 16 ms 436 KB Output is correct
25 Correct 16 ms 860 KB Output is correct
26 Correct 8 ms 592 KB Output is correct
27 Correct 20 ms 688 KB Output is correct
28 Correct 22 ms 932 KB Output is correct
29 Correct 19 ms 604 KB Output is correct
30 Correct 22 ms 604 KB Output is correct
31 Correct 27 ms 856 KB Output is correct
32 Correct 25 ms 436 KB Output is correct
33 Correct 26 ms 684 KB Output is correct
34 Correct 21 ms 848 KB Output is correct
35 Correct 25 ms 592 KB Output is correct
36 Correct 21 ms 444 KB Output is correct
37 Correct 24 ms 688 KB Output is correct
38 Correct 27 ms 864 KB Output is correct
39 Correct 23 ms 440 KB Output is correct
40 Correct 22 ms 952 KB Output is correct
41 Correct 23 ms 672 KB Output is correct
42 Correct 23 ms 848 KB Output is correct
43 Correct 6 ms 600 KB Output is correct
44 Correct 18 ms 684 KB Output is correct
45 Correct 21 ms 692 KB Output is correct
46 Correct 17 ms 344 KB Output is correct
47 Correct 14 ms 440 KB Output is correct
48 Correct 16 ms 676 KB Output is correct