oj.uz

Submission #1068819

# Submission time Handle Problem Language Result Execution time Memory
1068819 2024-08-21T12:22:03 Z j_vdd16 Rarest Insects (IOI22_insects) C++17
0 / 100
 55 ms 428 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;

int min_cardinality(int N) {
    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 <= N && N <= (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
0 / 10.0

# Verdict Execution time Memory 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 1 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 2 ms 344 KB Output is correct
8 Incorrect 5 ms 344 KB Wrong answer.
9 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory 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 1 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 2 ms 344 KB Output is correct
8 Incorrect 5 ms 344 KB Wrong answer.
9 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# Verdict Execution time Memory 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 10 ms 344 KB Output is correct
8 Correct 28 ms 428 KB Output is correct
9 Incorrect 55 ms 344 KB Wrong answer.
10 Halted 0 ms 0 KB -