oj.uz

답안 #1054768

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1054768 2024-08-12T12:02:42 Z Ignut 드문 곤충 (IOI22_insects) C++17
52.71 / 100
 97 ms 1024 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;

vector<int> in;

int prev_mid = 1;

map<int, int> cnt;

int Go(int maxCount) {
    while (press_button() > maxCount) {
        move_outside(in.back());
        cnt[in.back()] --;
        in.pop_back();
    }
    // if (prev_mid > maxCount) {
    //     while (!in.empty()) {
    //         cnt[in.back()] --;
    //         move_outside(in.back());
    //         in.pop_back();
    //     }
    // }
    // prev_mid = maxCount;
    for (int i = 0; i < n; i ++) {
        if (cnt[i] >= 1) continue;
        move_inside(i);
        in.push_back(i);
        cnt[i] ++;
        if (press_button() > maxCount) {
            move_outside(i);
            in.pop_back();
            cnt[i] --;
        }
    }
    int res = in.size();
    if (maxCount == 1) diff = in;
    return res;
}

int min_cardinality(int N) {
    n = N;
    int cntDiff = Go(1);
    
    if (cntDiff <= 0) {
        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:91:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |                 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 2 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 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 5 ms 600 KB Output is correct
13 Correct 3 ms 344 KB Output is correct
14 Correct 2 ms 444 KB Output is correct
15 Correct 3 ms 340 KB Output is correct
16 Correct 2 ms 344 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 4 ms 344 KB Output is correct
19 Correct 4 ms 344 KB Output is correct
20 Correct 2 ms 344 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 2 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 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 5 ms 600 KB Output is correct
13 Correct 3 ms 344 KB Output is correct
14 Correct 2 ms 444 KB Output is correct
15 Correct 3 ms 340 KB Output is correct
16 Correct 2 ms 344 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 4 ms 344 KB Output is correct
19 Correct 4 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 14 ms 492 KB Output is correct
24 Correct 4 ms 600 KB Output is correct
25 Correct 10 ms 616 KB Output is correct
26 Correct 23 ms 596 KB Output is correct
27 Correct 33 ms 344 KB Output is correct
28 Correct 4 ms 344 KB Output is correct
29 Correct 41 ms 344 KB Output is correct
30 Correct 23 ms 600 KB Output is correct
31 Correct 9 ms 344 KB Output is correct
32 Correct 13 ms 728 KB Output is correct
33 Correct 21 ms 600 KB Output is correct
34 Correct 11 ms 476 KB Output is correct
35 Correct 9 ms 344 KB Output is correct
36 Correct 11 ms 344 KB Output is correct
37 Correct 17 ms 604 KB Output is correct
38 Correct 24 ms 856 KB Output is correct
39 Correct 8 ms 344 KB Output is correct
40 Correct 9 ms 600 KB Output is correct
41 Correct 4 ms 344 KB Output is correct

Subtask #3
27.71 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 420 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 27 ms 500 KB Output is correct
8 Correct 8 ms 600 KB Output is correct
9 Correct 27 ms 620 KB Output is correct
10 Partially correct 29 ms 600 KB Output is partially correct
11 Partially correct 97 ms 344 KB Output is partially correct
12 Correct 13 ms 344 KB Output is correct
13 Partially correct 92 ms 344 KB Output is partially correct
14 Partially correct 59 ms 344 KB Output is partially correct
15 Partially correct 25 ms 512 KB Output is partially correct
16 Partially correct 37 ms 1024 KB Output is partially correct
17 Partially correct 33 ms 688 KB Output is partially correct
18 Partially correct 32 ms 600 KB Output is partially correct
19 Partially correct 39 ms 600 KB Output is partially correct
20 Partially correct 34 ms 440 KB Output is partially correct
21 Partially correct 52 ms 508 KB Output is partially correct
22 Partially correct 63 ms 344 KB Output is partially correct
23 Partially correct 55 ms 340 KB Output is partially correct
24 Correct 26 ms 600 KB Output is correct
25 Correct 12 ms 616 KB Output is correct
26 Correct 10 ms 512 KB Output is correct
27 Correct 23 ms 496 KB Output is correct
28 Correct 26 ms 520 KB Output is correct
29 Partially correct 26 ms 344 KB Output is partially correct
30 Partially correct 36 ms 760 KB Output is partially correct
31 Partially correct 39 ms 740 KB Output is partially correct
32 Partially correct 31 ms 760 KB Output is partially correct
33 Partially correct 45 ms 344 KB Output is partially correct
34 Partially correct 45 ms 704 KB Output is partially correct
35 Partially correct 28 ms 592 KB Output is partially correct
36 Partially correct 27 ms 480 KB Output is partially correct
37 Partially correct 45 ms 508 KB Output is partially correct
38 Partially correct 33 ms 780 KB Output is partially correct
39 Correct 32 ms 600 KB Output is correct
40 Correct 31 ms 596 KB Output is correct
41 Partially correct 40 ms 524 KB Output is partially correct
42 Partially correct 26 ms 636 KB Output is partially correct
43 Partially correct 17 ms 344 KB Output is partially correct
44 Partially correct 79 ms 716 KB Output is partially correct
45 Correct 22 ms 672 KB Output is correct
46 Correct 9 ms 344 KB Output is correct
47 Correct 9 ms 500 KB Output is correct
48 Correct 16 ms 492 KB Output is correct