oj.uz

답안 #1054764

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1054764 2024-08-12T12:00:03 Z Ignut 드문 곤충 (IOI22_insects) C++17
53.13 / 100
 132 ms 1112 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) {
    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:86:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |                 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 4 ms 344 KB Output is correct
7 Correct 1 ms 444 KB Output is correct
8 Correct 3 ms 600 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 3 ms 600 KB Output is correct
12 Correct 10 ms 344 KB Output is correct
13 Correct 8 ms 344 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Correct 8 ms 344 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 4 ms 432 KB Output is correct
18 Correct 5 ms 432 KB Output is correct
19 Correct 3 ms 340 KB Output is correct
20 Correct 3 ms 344 KB Output is correct
21 Correct 1 ms 444 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 4 ms 344 KB Output is correct
7 Correct 1 ms 444 KB Output is correct
8 Correct 3 ms 600 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 3 ms 600 KB Output is correct
12 Correct 10 ms 344 KB Output is correct
13 Correct 8 ms 344 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Correct 8 ms 344 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 4 ms 432 KB Output is correct
18 Correct 5 ms 432 KB Output is correct
19 Correct 3 ms 340 KB Output is correct
20 Correct 3 ms 344 KB Output is correct
21 Correct 1 ms 444 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 12 ms 476 KB Output is correct
24 Correct 4 ms 728 KB Output is correct
25 Correct 14 ms 704 KB Output is correct
26 Correct 45 ms 468 KB Output is correct
27 Correct 63 ms 464 KB Output is correct
28 Correct 8 ms 1112 KB Output is correct
29 Correct 34 ms 600 KB Output is correct
30 Correct 44 ms 476 KB Output is correct
31 Correct 25 ms 472 KB Output is correct
32 Correct 22 ms 344 KB Output is correct
33 Correct 32 ms 948 KB Output is correct
34 Correct 11 ms 492 KB Output is correct
35 Correct 19 ms 856 KB Output is correct
36 Correct 12 ms 592 KB Output is correct
37 Correct 10 ms 720 KB Output is correct
38 Correct 22 ms 856 KB Output is correct
39 Correct 11 ms 488 KB Output is correct
40 Correct 4 ms 600 KB Output is correct
41 Correct 4 ms 344 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 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 30 ms 648 KB Output is correct
8 Correct 7 ms 344 KB Output is correct
9 Correct 20 ms 344 KB Output is correct
10 Partially correct 52 ms 592 KB Output is partially correct
11 Partially correct 99 ms 600 KB Output is partially correct
12 Correct 13 ms 344 KB Output is correct
13 Partially correct 132 ms 856 KB Output is partially correct
14 Partially correct 68 ms 344 KB Output is partially correct
15 Partially correct 42 ms 344 KB Output is partially correct
16 Partially correct 47 ms 516 KB Output is partially correct
17 Partially correct 42 ms 600 KB Output is partially correct
18 Partially correct 52 ms 768 KB Output is partially correct
19 Partially correct 49 ms 460 KB Output is partially correct
20 Partially correct 45 ms 600 KB Output is partially correct
21 Partially correct 44 ms 344 KB Output is partially correct
22 Partially correct 59 ms 600 KB Output is partially correct
23 Partially correct 32 ms 600 KB Output is partially correct
24 Correct 22 ms 616 KB Output is correct
25 Correct 10 ms 468 KB Output is correct
26 Correct 6 ms 496 KB Output is correct
27 Correct 24 ms 520 KB Output is correct
28 Correct 22 ms 508 KB Output is correct
29 Partially correct 30 ms 696 KB Output is partially correct
30 Partially correct 19 ms 592 KB Output is partially correct
31 Partially correct 41 ms 580 KB Output is partially correct
32 Partially correct 47 ms 512 KB Output is partially correct
33 Partially correct 39 ms 344 KB Output is partially correct
34 Partially correct 59 ms 600 KB Output is partially correct
35 Partially correct 21 ms 508 KB Output is partially correct
36 Partially correct 35 ms 600 KB Output is partially correct
37 Partially correct 40 ms 524 KB Output is partially correct
38 Partially correct 56 ms 836 KB Output is partially correct
39 Correct 29 ms 468 KB Output is correct
40 Correct 18 ms 344 KB Output is correct
41 Partially correct 27 ms 520 KB Output is partially correct
42 Partially correct 24 ms 768 KB Output is partially correct
43 Partially correct 22 ms 600 KB Output is partially correct
44 Partially correct 84 ms 600 KB Output is partially correct
45 Correct 17 ms 344 KB Output is correct
46 Correct 18 ms 856 KB Output is correct
47 Correct 10 ms 600 KB Output is correct
48 Correct 8 ms 464 KB Output is correct