oj.uz

답안 #1070761

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1070761 2024-08-22T18:01:59 Z j_vdd16 드문 곤충 (IOI22_insects) C++17
95.99 / 100
 52 ms 668 KB 
#include "insects.h"

#include <algorithm>
#include <bitset>
#include <cstdint>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

//#define int long long
#define loop(X, N) for(int X = 0; X < (N); X++)
#define all(V) V.begin(), V.end()
#define rall(V) V.rbegin(), V.rend()

using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;

typedef uint64_t u64;
typedef int64_t i64;

struct Manager {
    vb state;
    map<int, int> toChange;
    int n;

    Manager(int _n) {
        n = _n;
        state = vb(n);
    }

    void inside(int i) {
        //move_inside(i);
        toChange[i] = 1;
    }
    void outside(int i) {
        //move_outside(i);
        toChange[i] = 0;
    }
    int press() {
        for (auto [i, action] : toChange) {
            if (action == 0) {
                move_outside(i);
            }
            else {
                move_inside(i);
            }
        }

        toChange.clear();
        return press_button();
    }
};

int min_cardinality(int N) {
    Manager manager(N);
    vb isDone(N);

    vi madeItBigger(N, 0);
    vb isRemoved(N);
    loop(i, N) {
        manager.inside(i);

        int res = manager.press();
        if (res > 1) {
            madeItBigger[i] = 1;
            manager.outside(i);
            isRemoved[i] = true;
        }
    }

    int diffCount = 0;
    loop(i, N) {
        if (!isRemoved[i]) {
            diffCount++;
            isDone[i] = true;
        }
    }

    int prevRes = 1;
    loop(i, N) {
        if (isDone[i]) continue;

        manager.inside(i);
        int res = manager.press();
        if (res > prevRes) {
            madeItBigger[i] = max(madeItBigger[i], prevRes);
            prevRes = res;
        }
    }
    int maxCount = prevRes;
    loop(i, N) {
        if (isDone[i]) continue;

        manager.outside(i);
    }

    int total = N;
    vi possible;
    for (int x = 1; x <= N; x++) {
        if (diffCount == 2 && x + maxCount != total) continue;
        if (diffCount == 1 && (x != maxCount || x != total)) continue;

        if ((diffCount - 1) * x + maxCount <= total && total <= (diffCount - 1) * maxCount + x) {
            possible.push_back(x);
        }
    }

    int extra = 1;
    int l = 0, r = possible.size() - 1;
    while (l < r) {
        int m = (l + r + 1) / 2;

        int lessThanM = diffCount * extra;
        isRemoved = vb(N);

        int prevPress = extra;
        int insideCounter = extra;
        loop(i, N) {
            if (isDone[i]) continue;

            insideCounter++;
            if (madeItBigger[i] >= possible[m]) {
                isRemoved[i] = true;
            }
            else {
                manager.inside(i);
                if (insideCounter < possible[m]) {
                    lessThanM++;
                    continue;
                }

                int res = manager.press();
                if (res > prevPress) {
                    madeItBigger[i] = max(madeItBigger[i], prevPress);
                    prevPress = res;
                }

                if (res > possible[m]) {
                    madeItBigger[i] = max(madeItBigger[i], possible[m]);
                    manager.outside(i);
                    isRemoved[i] = true;
                }
                else {
                    lessThanM++;
                }
            }
        }

        if (lessThanM == diffCount * possible[m]) {
            l = m;
            
            loop(i, N) {
                if (!isRemoved[i] && !isDone[i]) {
                    isDone[i] = true;
                }
            }

            extra = possible[m];
        }
        else {
            r = m - 1;

            loop(i, N) {
                if (!isRemoved[i] && !isDone[i]) {
                    manager.outside(i);
                }
            }
        }
    }

    return possible[l];
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 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 3 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 3 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 4 ms 344 KB Output is correct
14 Correct 3 ms 436 KB Output is correct
15 Correct 4 ms 344 KB Output is correct
16 Correct 4 ms 344 KB Output is correct
17 Correct 4 ms 344 KB Output is correct
18 Correct 4 ms 344 KB Output is correct
19 Correct 4 ms 600 KB Output is correct
20 Correct 4 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 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 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 3 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 3 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 4 ms 344 KB Output is correct
14 Correct 3 ms 436 KB Output is correct
15 Correct 4 ms 344 KB Output is correct
16 Correct 4 ms 344 KB Output is correct
17 Correct 4 ms 344 KB Output is correct
18 Correct 4 ms 344 KB Output is correct
19 Correct 4 ms 600 KB Output is correct
20 Correct 4 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 13 ms 412 KB Output is correct
24 Correct 10 ms 596 KB Output is correct
25 Correct 29 ms 440 KB Output is correct
26 Correct 21 ms 432 KB Output is correct
27 Correct 9 ms 428 KB Output is correct
28 Correct 5 ms 436 KB Output is correct
29 Correct 14 ms 344 KB Output is correct
30 Correct 15 ms 340 KB Output is correct
31 Correct 10 ms 600 KB Output is correct
32 Correct 14 ms 436 KB Output is correct
33 Correct 16 ms 344 KB Output is correct
34 Correct 28 ms 432 KB Output is correct
35 Correct 19 ms 344 KB Output is correct
36 Correct 24 ms 436 KB Output is correct
37 Correct 18 ms 344 KB Output is correct
38 Correct 18 ms 440 KB Output is correct
39 Correct 15 ms 416 KB Output is correct
40 Correct 9 ms 588 KB Output is correct
41 Correct 5 ms 344 KB Output is correct

Subtask #3
70.99 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 19 ms 432 KB Output is correct
8 Correct 9 ms 344 KB Output is correct
9 Partially correct 51 ms 420 KB Output is partially correct
10 Partially correct 50 ms 416 KB Output is partially correct
11 Correct 15 ms 344 KB Output is correct
12 Correct 13 ms 592 KB Output is correct
13 Partially correct 31 ms 436 KB Output is partially correct
14 Partially correct 50 ms 592 KB Output is partially correct
15 Partially correct 38 ms 424 KB Output is partially correct
16 Partially correct 48 ms 420 KB Output is partially correct
17 Partially correct 30 ms 344 KB Output is partially correct
18 Partially correct 52 ms 416 KB Output is partially correct
19 Partially correct 38 ms 344 KB Output is partially correct
20 Partially correct 51 ms 416 KB Output is partially correct
21 Partially correct 50 ms 436 KB Output is partially correct
22 Partially correct 37 ms 420 KB Output is partially correct
23 Partially correct 46 ms 592 KB Output is partially correct
24 Correct 30 ms 416 KB Output is correct
25 Correct 18 ms 344 KB Output is correct
26 Correct 20 ms 436 KB Output is correct
27 Correct 25 ms 432 KB Output is correct
28 Correct 24 ms 424 KB Output is correct
29 Partially correct 33 ms 436 KB Output is partially correct
30 Partially correct 33 ms 344 KB Output is partially correct
31 Partially correct 47 ms 432 KB Output is partially correct
32 Partially correct 40 ms 668 KB Output is partially correct
33 Partially correct 42 ms 592 KB Output is partially correct
34 Partially correct 38 ms 416 KB Output is partially correct
35 Correct 37 ms 436 KB Output is correct
36 Correct 31 ms 420 KB Output is correct
37 Partially correct 47 ms 420 KB Output is partially correct
38 Partially correct 43 ms 344 KB Output is partially correct
39 Partially correct 32 ms 432 KB Output is partially correct
40 Partially correct 41 ms 416 KB Output is partially correct
41 Partially correct 44 ms 420 KB Output is partially correct
42 Partially correct 35 ms 592 KB Output is partially correct
43 Correct 6 ms 344 KB Output is correct
44 Correct 31 ms 592 KB Output is correct
45 Correct 23 ms 424 KB Output is correct
46 Correct 20 ms 592 KB Output is correct
47 Correct 18 ms 436 KB Output is correct
48 Correct 21 ms 416 KB Output is correct