oj.uz

답안 #1069802

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1069802 2024-08-22T09:04:18 Z j_vdd16 드문 곤충 (IOI22_insects) C++17
62.61 / 100
 87 ms 600 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;

vb isDone;
int min_cardinality(int N) {
    isDone = vb(N);

    vb isRemoved(N);
    loop(i, N) {
        move_inside(i);

        int res = press_button();
        if (res > 1) {
            move_outside(i);
            isRemoved[i] = true;
        }
    }

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

    loop(i, N) {
        if (isDone[i]) continue;

        move_inside(i);
    }
    int maxCount = press_button();
    loop(i, N) {
        if (isDone[i]) continue;

        move_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 + l + 2) / 3;

        int lessThanM = diffCount * extra;
        isRemoved = vb(N);
        loop(i, N) {
            if (isDone[i]) continue;

            move_inside(i);

            int res = press_button();
            if (res > possible[m]) {
                move_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]) {
                    move_outside(i);
                }
            }
        }
    }

    return possible[l];
    
    // vb isDone(N);

    // int diffCount = 0;
    // vb isNew(N);
    // loop(i, N) {
    //     move_inside(i);
        
    //     int res = press_button();
    //     if (res == 1) {
    //         diffCount++;
    //         isNew[i] = true;
    //     }
    //     else {
    //         move_outside(i);
    //     }
    // }
    // loop(i, N) {
    //     if (isNew[i]) {
    //         move_outside(i);
    //     }
    // }
    // int total = N;

    // while (true) {
    //     if (diffCount == 1) {
    //         return total;
    //     }

    //     int maxCount = 0;
    //     int lastIncrease = 0;
    //     loop(i, N) {
    //         if (isDone[i]) continue;

    //         move_inside(i);
    //         int res = press_button();
    //         if (res > maxCount) {
    //             maxCount = res;
    //             lastIncrease = i;
    //         }
    //     }

    //     if (diffCount == 2) {
    //         return total - maxCount;
    //     }

    //     vi possible;
    //     for (int x = 1; x <= total; 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);
    //         }
    //     }

    //     if (possible.size() == 1) {
    //         return possible[0];
    //     }
    //     else if (possible.size() == 0) {
    //         return -1;
    //     }

    //     for (int i = N - 1; i > lastIncrease; i--) {
    //         if (isDone[i]) continue;

    //         move_outside(i);
    //     }

    //     vb isPartOfMax(N);
    //     isPartOfMax[lastIncrease] = true;
    //     for (int i = 0; i < lastIncrease; i++) {
    //         if (isDone[i]) continue;

    //         move_outside(i);
    //         int res = press_button();
    //         if (res < maxCount) {
    //             move_inside(i);
    //             isPartOfMax[i] = true;
    //         }
    //     }

    //     loop(i, N) {
    //         if (isPartOfMax[i]) {
    //             isDone[i] = true;
    //             move_outside(i);
    //         }
    //     }
        
    //     diffCount--;
    //     total -= maxCount;
    // }

    // return 0;
}

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

Subtask #3
37.61 / 75.0

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