oj.uz

답안 #859057

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
859057 2023-10-09T15:28:52 Z thinknoexit 드문 곤충 (IOI22_insects) C++17
25 / 100
 204 ms 848 KB 
#include <bits/stdc++.h>
#include "insects.h"
using namespace std;
using ll = long long;
int in[2020];
const int C = 20;
int min_cardinality(int n) {
    int type = 0;
    for (int i = 0;i < n;i++) {
        move_inside(i);
        if (press_button() == 2) {
            move_outside(i);
        }
        else in[i] = 1, type++;
    }
    if (type == 1) return n;
    if (type == n) return 1;
    if (type > n / 2) return 1;
    int mxans = n / type;
    int now = 1;
    while (now + C <= mxans) {
        now += C;
        int cnt = 0;
        for (int i = 0;i < n;i++) {
            if (in[i]) continue;
            move_inside(i);
            if (press_button() > now) {
                move_outside(i);
            }
            else in[i] = now, cnt++;
        }
        if (cnt < C * type) {
            for (int i = 0;i < n;i++) {
                if (in[i] == now) move_outside(i), in[i] = 0;
            }
            now -= C;
            while (1) {
                now++;
                int cnt = 0;
                for (int i = 0;i < n;i++) {
                    if (in[i]) continue;
                    move_inside(i);
                    if (press_button() > now) {
                        move_outside(i);
                    }
                    else in[i] = now, cnt++;
                }
                if (cnt != type) return now - 1;
            }
        }
    }
    while (now <= mxans) {
        now++;
        int cnt = 0;
        for (int i = 0;i < n;i++) {
            if (in[i]) continue;
            move_inside(i);
            if (press_button() > now) {
                move_outside(i);
            }
            else in[i] = now, cnt++;
        }
        if (cnt != type) return now - 1;
    }
    // n , n , n
    /*
        ans <= n / type
        ans <= n - mx
    */
    return -1;
}

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 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 9 ms 344 KB Output is correct
17 Correct 8 ms 344 KB Output is correct
18 Correct 2 ms 344 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 3 ms 596 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 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 9 ms 344 KB Output is correct
17 Correct 8 ms 344 KB Output is correct
18 Correct 2 ms 344 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 3 ms 596 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 600 KB Output is correct
25 Correct 16 ms 428 KB Output is correct
26 Correct 83 ms 684 KB Output is correct
27 Correct 15 ms 340 KB Output is correct
28 Correct 4 ms 604 KB Output is correct
29 Correct 25 ms 600 KB Output is correct
30 Correct 16 ms 428 KB Output is correct
31 Correct 32 ms 596 KB Output is correct
32 Correct 29 ms 412 KB Output is correct
33 Correct 41 ms 344 KB Output is correct
34 Correct 28 ms 416 KB Output is correct
35 Correct 39 ms 592 KB Output is correct
36 Correct 42 ms 596 KB Output is correct
37 Correct 42 ms 428 KB Output is correct
38 Correct 17 ms 592 KB Output is correct
39 Correct 6 ms 600 KB Output is correct
40 Correct 7 ms 440 KB Output is correct
41 Correct 4 ms 600 KB Output is correct

Subtask #3
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 11 ms 344 KB Output is correct
8 Correct 7 ms 600 KB Output is correct
9 Correct 27 ms 600 KB Output is correct
10 Partially correct 36 ms 416 KB Output is partially correct
11 Correct 33 ms 344 KB Output is correct
12 Correct 20 ms 600 KB Output is correct
13 Partially correct 45 ms 440 KB Output is partially correct
14 Correct 29 ms 848 KB Output is correct
15 Partially correct 135 ms 432 KB Output is partially correct
16 Partially correct 88 ms 416 KB Output is partially correct
17 Partially correct 98 ms 412 KB Output is partially correct
18 Partially correct 95 ms 420 KB Output is partially correct
19 Partially correct 72 ms 428 KB Output is partially correct
20 Partially correct 50 ms 420 KB Output is partially correct
21 Correct 28 ms 444 KB Output is correct
22 Partially correct 83 ms 596 KB Output is partially correct
23 Correct 15 ms 600 KB Output is correct
24 Correct 16 ms 600 KB Output is correct
25 Correct 14 ms 600 KB Output is correct
26 Correct 11 ms 596 KB Output is correct
27 Partially correct 40 ms 676 KB Output is partially correct
28 Partially correct 37 ms 416 KB Output is partially correct
29 Partially correct 29 ms 420 KB Output is partially correct
30 Partially correct 32 ms 592 KB Output is partially correct
31 Partially correct 130 ms 436 KB Output is partially correct
32 Partially correct 148 ms 684 KB Output is partially correct
33 Correct 26 ms 344 KB Output is correct
34 Correct 29 ms 344 KB Output is correct
35 Partially correct 44 ms 592 KB Output is partially correct
36 Partially correct 51 ms 416 KB Output is partially correct
37 Partially correct 150 ms 600 KB Output is partially correct
38 Partially correct 168 ms 672 KB Output is partially correct
39 Partially correct 93 ms 596 KB Output is partially correct
40 Partially correct 85 ms 416 KB Output is partially correct
41 Partially correct 41 ms 592 KB Output is partially correct
42 Partially correct 51 ms 440 KB Output is partially correct
43 Correct 7 ms 344 KB Output is correct
44 Correct 31 ms 600 KB Output is correct
45 Incorrect 204 ms 592 KB Too many queries.
46 Halted 0 ms 0 KB -