oj.uz

답안 #1054562

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1054562 2024-08-12T10:41:24 Z Ignut 드문 곤충 (IOI22_insects) C++17
50 / 100
 117 ms 1076 KB 
/* Ignut
started: 11.08.2024
now: 12.08.2024
████████████████████████████████████████████████████████████████████
████████████████████████████████    ████████████████████████████████
██████████████████████████████        ██████████████████████████████
██████      ██████████████████        ██████████████████      ██████
██████          ██████████████        ██████████████          ██████
██████      ██    ████████████        ████████████    ██      ██████
██████      ████    ██████████        ██████████    ████      ██████
██████      ████      ██████████    ██████████      ████      ██████
██████      ████      ██████████    ██████████    ██████      ██████
██████      ██████    ██████████    ██████████    ██████      ██████
██████      ██████    ████████        ████████    ██████      ██████
██████      ██████      ██████        ██████      ██████      ██████
██████      ████        ████            ████        ████      ██████
██████            ██████████    ████    ██████████            ██████
██████      ██      ██████    ████████    ██████      ██      ██████
██████      ██████            ████████            ██████      ██████
██████                    ██            ██                    ██████
██████████████████████      ████    ████      ██████████████████████
████████████████████████      ██    ██      ████████████████████████
██████████████████████████                ██████████████████████████
██████████████████████████████        ██████████████████████████████
████████████████████████████████████████████████████████████████████
*/

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

void move_inside(int i);
void move_outside(int i);
int press_button();

int n;

int Go(int maxCount) {
    vector<int> in;
    for (int i = 0; i < n; i ++) {
        move_inside(i);
        in.push_back(i);
        // cout << "add " << i << " -> " << press_button() << '\n';
        if (press_button() > maxCount) {
            move_outside(i);
            in.pop_back();
        }
    }
    int res = in.size();
    while (!in.empty()) move_outside(in.back()), in.pop_back();
    // cout << maxCount << " : " << res << '\n';
    return res;
}

int min_cardinality(int N) {
    n = N;
    int cntDiff = Go(1);
    if (cntDiff == 1) return N;
    if (cntDiff == N) return 1;
    
    int lo = 1, hi = N / cntDiff;
    while (lo < hi) {
        int mid = lo + (hi - lo + 1) / 2;
        if (1ll * Go(mid) == 1ll * mid * cntDiff)
            lo = mid;
        else
            hi = mid - 1;
    }
    return lo;
}

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 376 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 4 ms 600 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 5 ms 344 KB Output is correct
15 Correct 6 ms 344 KB Output is correct
16 Correct 4 ms 436 KB Output is correct
17 Correct 4 ms 344 KB Output is correct
18 Correct 4 ms 344 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 2 ms 436 KB Output is correct
21 Correct 2 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 376 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 4 ms 600 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 5 ms 344 KB Output is correct
15 Correct 6 ms 344 KB Output is correct
16 Correct 4 ms 436 KB Output is correct
17 Correct 4 ms 344 KB Output is correct
18 Correct 4 ms 344 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 2 ms 436 KB Output is correct
21 Correct 2 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 26 ms 600 KB Output is correct
26 Correct 28 ms 672 KB Output is correct
27 Correct 34 ms 600 KB Output is correct
28 Correct 4 ms 344 KB Output is correct
29 Correct 41 ms 436 KB Output is correct
30 Correct 22 ms 344 KB Output is correct
31 Correct 41 ms 436 KB Output is correct
32 Correct 28 ms 344 KB Output is correct
33 Correct 34 ms 600 KB Output is correct
34 Correct 44 ms 344 KB Output is correct
35 Correct 36 ms 432 KB Output is correct
36 Correct 35 ms 600 KB Output is correct
37 Correct 35 ms 344 KB Output is correct
38 Correct 13 ms 344 KB Output is correct
39 Correct 15 ms 440 KB Output is correct
40 Correct 8 ms 344 KB Output is correct
41 Correct 4 ms 444 KB Output is correct

Subtask #3
25.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 Partially correct 0 ms 344 KB Output is partially correct
7 Correct 10 ms 344 KB Output is correct
8 Correct 8 ms 600 KB Output is correct
9 Partially correct 77 ms 444 KB Output is partially correct
10 Partially correct 61 ms 428 KB Output is partially correct
11 Partially correct 97 ms 344 KB Output is partially correct
12 Correct 18 ms 424 KB Output is correct
13 Partially correct 117 ms 344 KB Output is partially correct
14 Partially correct 52 ms 432 KB Output is partially correct
15 Partially correct 97 ms 584 KB Output is partially correct
16 Partially correct 73 ms 916 KB Output is partially correct
17 Partially correct 89 ms 592 KB Output is partially correct
18 Partially correct 79 ms 676 KB Output is partially correct
19 Partially correct 92 ms 652 KB Output is partially correct
20 Partially correct 84 ms 660 KB Output is partially correct
21 Partially correct 65 ms 436 KB Output is partially correct
22 Partially correct 78 ms 672 KB Output is partially correct
23 Partially correct 35 ms 596 KB Output is partially correct
24 Correct 16 ms 592 KB Output is correct
25 Correct 22 ms 424 KB Output is correct
26 Correct 8 ms 344 KB Output is correct
27 Partially correct 60 ms 424 KB Output is partially correct
28 Partially correct 53 ms 676 KB Output is partially correct
29 Partially correct 79 ms 592 KB Output is partially correct
30 Partially correct 88 ms 420 KB Output is partially correct
31 Partially correct 47 ms 668 KB Output is partially correct
32 Partially correct 61 ms 656 KB Output is partially correct
33 Partially correct 40 ms 436 KB Output is partially correct
34 Partially correct 36 ms 680 KB Output is partially correct
35 Partially correct 55 ms 564 KB Output is partially correct
36 Partially correct 52 ms 428 KB Output is partially correct
37 Partially correct 59 ms 668 KB Output is partially correct
38 Partially correct 50 ms 576 KB Output is partially correct
39 Partially correct 35 ms 676 KB Output is partially correct
40 Partially correct 38 ms 588 KB Output is partially correct
41 Partially correct 57 ms 680 KB Output is partially correct
42 Partially correct 67 ms 660 KB Output is partially correct
43 Partially correct 28 ms 344 KB Output is partially correct
44 Partially correct 72 ms 340 KB Output is partially correct
45 Partially correct 102 ms 1076 KB Output is partially correct
46 Correct 21 ms 436 KB Output is correct
47 Correct 11 ms 344 KB Output is correct
48 Correct 22 ms 600 KB Output is correct