oj.uz

답안 #1054597

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1054597 2024-08-12T10:55:18 Z Ignut 드문 곤충 (IOI22_insects) C++17
53.13 / 100
 109 ms 896 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;

vector<int> diff;

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();
    if (maxCount == 1) diff = in;
    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);
    
    // for (int val : diff) cout << val << ' ';
    // cout << '\n';

    if (cntDiff <= 4) {
        int minRes = N, sum = 0;
        for (int i = 0; i < cntDiff - 1; i ++) {
            vector<int> in;
            in.push_back(diff[i]);
            move_inside(diff[i]);
            for (int j = diff[i] + 1; j < N; j ++) {
                move_inside(j);
                in.push_back(j);
                // cout << "try " << j << ' ';
                if (press_button() != in.size()) {
                    in.pop_back();
                    move_outside(j);
                    // cout << "! ";
                }
            }
            // cout << '\n';
            minRes = min(minRes, int(in.size()));
            sum += in.size();
            // cout << "have : " << in.size() << '\n';
            // for (int val : in) cout << val << ' ';
            // cout << '\n';
            while (!in.empty()) {
                move_outside(in.back());
                in.pop_back();
            }
        }
        minRes = min(minRes, N - sum);
        return minRes;
    }

    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;
}

Compilation message

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:76:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |                 if (press_button() != in.size()) {
      |                     ~~~~~~~~~~~~~~~^~~~~~~~~~~~

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

Subtask #3
28.13 / 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 6 ms 344 KB Output is correct
8 Correct 6 ms 696 KB Output is correct
9 Partially correct 65 ms 600 KB Output is partially correct
10 Partially correct 52 ms 676 KB Output is partially correct
11 Correct 17 ms 440 KB Output is correct
12 Correct 20 ms 604 KB Output is correct
13 Partially correct 109 ms 344 KB Output is partially correct
14 Partially correct 48 ms 344 KB Output is partially correct
15 Partially correct 103 ms 668 KB Output is partially correct
16 Partially correct 78 ms 672 KB Output is partially correct
17 Partially correct 95 ms 676 KB Output is partially correct
18 Partially correct 81 ms 600 KB Output is partially correct
19 Partially correct 86 ms 660 KB Output is partially correct
20 Partially correct 85 ms 656 KB Output is partially correct
21 Partially correct 51 ms 668 KB Output is partially correct
22 Partially correct 61 ms 424 KB Output is partially correct
23 Partially correct 37 ms 344 KB Output is partially correct
24 Correct 32 ms 428 KB Output is correct
25 Correct 15 ms 600 KB Output is correct
26 Correct 8 ms 344 KB Output is correct
27 Partially correct 47 ms 676 KB Output is partially correct
28 Partially correct 61 ms 664 KB Output is partially correct
29 Partially correct 79 ms 428 KB Output is partially correct
30 Partially correct 67 ms 896 KB Output is partially correct
31 Partially correct 59 ms 668 KB Output is partially correct
32 Partially correct 56 ms 344 KB Output is partially correct
33 Partially correct 45 ms 432 KB Output is partially correct
34 Partially correct 44 ms 436 KB Output is partially correct
35 Partially correct 75 ms 684 KB Output is partially correct
36 Partially correct 73 ms 676 KB Output is partially correct
37 Partially correct 58 ms 432 KB Output is partially correct
38 Partially correct 53 ms 692 KB Output is partially correct
39 Partially correct 34 ms 668 KB Output is partially correct
40 Partially correct 37 ms 680 KB Output is partially correct
41 Partially correct 64 ms 596 KB Output is partially correct
42 Partially correct 69 ms 432 KB Output is partially correct
43 Partially correct 13 ms 344 KB Output is partially correct
44 Partially correct 80 ms 440 KB Output is partially correct
45 Correct 18 ms 592 KB Output is correct
46 Correct 16 ms 588 KB Output is correct
47 Correct 16 ms 448 KB Output is correct
48 Correct 21 ms 344 KB Output is correct