oj.uz

답안 #979657

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
979657 2024-05-11T09:32:42 Z 12345678 드문 곤충 (IOI22_insects) C++17
100 / 100
 33 ms 1268 KB 
#include "insects.h"
#include <bits/stdc++.h>

using namespace std;

const int nx=2e3+5;

mt19937 rng(time(0));

int p[nx], cnt, sz, in[nx], t[nx], s[nx];

vector<pair<int, int>> v;

int min_cardinality(int N) {
    cin.tie(NULL)->sync_with_stdio(false);
    for (int i=0; i<N; i++) v.push_back({rng(), i});
    sort(v.begin(), v.end());
    for (int i=0; i<N; i++) p[v[i].second]=i;
    for (int i=0; i<N; i++)
    {
        move_inside(p[i]);
        if (press_button()==1) cnt++, in[i]=1, s[i]=1;
        else move_outside(p[i]);
    }
    if (cnt==1) return N;
    if (cnt==N) return 1;
    int l=1, r=N/cnt;
    sz=cnt;
    while (l<r)
    {
        int md=(l+r+1)/2;
        for (int i=0; i<N; i++)
        {
            if (s[i]||t[i]) continue;
            move_inside(p[i]);
            if (press_button()>md) move_outside(p[i]);
            else sz++, in[i]=1;
            if (sz==cnt*md) break;
        }
        if (sz==cnt*md) 
        {
            l=md;
            for (int i=0; i<N; i++) if (in[i]) s[i]=1;
        }
        else 
        {
            r=md-1;
            for (int i=0; i<N; i++) if (!in[i]) t[i]=1;
            for (int i=0; i<N; i++) if (in[i]&&!s[i]) in[i]=0, move_outside(p[i]), sz--;
        }
    }
    return l;
}

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 1 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 3 ms 344 KB Output is correct
9 Correct 3 ms 600 KB Output is correct
10 Correct 3 ms 476 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 3 ms 600 KB Output is correct
13 Correct 2 ms 676 KB Output is correct
14 Correct 2 ms 600 KB Output is correct
15 Correct 2 ms 600 KB Output is correct
16 Correct 2 ms 600 KB Output is correct
17 Correct 3 ms 476 KB Output is correct
18 Correct 3 ms 600 KB Output is correct
19 Correct 3 ms 476 KB Output is correct
20 Correct 2 ms 596 KB Output is correct
21 Correct 2 ms 476 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 1 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 3 ms 344 KB Output is correct
9 Correct 3 ms 600 KB Output is correct
10 Correct 3 ms 476 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 3 ms 600 KB Output is correct
13 Correct 2 ms 676 KB Output is correct
14 Correct 2 ms 600 KB Output is correct
15 Correct 2 ms 600 KB Output is correct
16 Correct 2 ms 600 KB Output is correct
17 Correct 3 ms 476 KB Output is correct
18 Correct 3 ms 600 KB Output is correct
19 Correct 3 ms 476 KB Output is correct
20 Correct 2 ms 596 KB Output is correct
21 Correct 2 ms 476 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 6 ms 344 KB Output is correct
24 Correct 5 ms 748 KB Output is correct
25 Correct 13 ms 596 KB Output is correct
26 Correct 13 ms 600 KB Output is correct
27 Correct 12 ms 488 KB Output is correct
28 Correct 4 ms 600 KB Output is correct
29 Correct 16 ms 488 KB Output is correct
30 Correct 13 ms 604 KB Output is correct
31 Correct 11 ms 744 KB Output is correct
32 Correct 11 ms 480 KB Output is correct
33 Correct 12 ms 344 KB Output is correct
34 Correct 12 ms 600 KB Output is correct
35 Correct 12 ms 600 KB Output is correct
36 Correct 15 ms 484 KB Output is correct
37 Correct 11 ms 608 KB Output is correct
38 Correct 11 ms 464 KB Output is correct
39 Correct 15 ms 740 KB Output is correct
40 Correct 7 ms 600 KB Output is correct
41 Correct 5 ms 600 KB Output is correct

Subtask #3
75.0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 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 0 ms 344 KB Output is correct
7 Correct 9 ms 344 KB Output is correct
8 Correct 9 ms 768 KB Output is correct
9 Correct 32 ms 600 KB Output is correct
10 Correct 27 ms 848 KB Output is correct
11 Correct 25 ms 600 KB Output is correct
12 Correct 15 ms 504 KB Output is correct
13 Correct 25 ms 600 KB Output is correct
14 Correct 33 ms 736 KB Output is correct
15 Correct 19 ms 764 KB Output is correct
16 Correct 19 ms 756 KB Output is correct
17 Correct 23 ms 596 KB Output is correct
18 Correct 33 ms 848 KB Output is correct
19 Correct 25 ms 856 KB Output is correct
20 Correct 22 ms 1104 KB Output is correct
21 Correct 24 ms 764 KB Output is correct
22 Correct 33 ms 736 KB Output is correct
23 Correct 26 ms 600 KB Output is correct
24 Correct 22 ms 1268 KB Output is correct
25 Correct 15 ms 600 KB Output is correct
26 Correct 10 ms 600 KB Output is correct
27 Correct 24 ms 744 KB Output is correct
28 Correct 26 ms 588 KB Output is correct
29 Correct 22 ms 592 KB Output is correct
30 Correct 22 ms 592 KB Output is correct
31 Correct 29 ms 504 KB Output is correct
32 Correct 29 ms 848 KB Output is correct
33 Correct 24 ms 748 KB Output is correct
34 Correct 29 ms 764 KB Output is correct
35 Correct 24 ms 848 KB Output is correct
36 Correct 27 ms 740 KB Output is correct
37 Correct 33 ms 856 KB Output is correct
38 Correct 28 ms 500 KB Output is correct
39 Correct 21 ms 740 KB Output is correct
40 Correct 28 ms 752 KB Output is correct
41 Correct 22 ms 480 KB Output is correct
42 Correct 30 ms 504 KB Output is correct
43 Correct 7 ms 460 KB Output is correct
44 Correct 22 ms 600 KB Output is correct
45 Correct 22 ms 852 KB Output is correct
46 Correct 15 ms 856 KB Output is correct
47 Correct 16 ms 600 KB Output is correct
48 Correct 17 ms 764 KB Output is correct