oj.uz

Submission #1068530

# Submission time Handle Problem Language Result Execution time Memory
1068530 2024-08-21T10:28:54 Z j_vdd16 Rarest Insects (IOI22_insects) C++17
10 / 100
 274 ms 596 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) {
        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;
            }
        }

        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 (maxCount + (diffCount - 1) * x <= total && total <= maxCount * diffCount) {
                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

# Verdict Execution time Memory Grader output
1 Correct 1 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 2 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 9 ms 344 KB Output is correct
9 Correct 14 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 3 ms 344 KB Output is correct
12 Correct 6 ms 344 KB Output is correct
13 Correct 19 ms 344 KB Output is correct
14 Correct 4 ms 344 KB Output is correct
15 Correct 10 ms 344 KB Output is correct
16 Correct 11 ms 344 KB Output is correct
17 Correct 13 ms 344 KB Output is correct
18 Correct 11 ms 344 KB Output is correct
19 Correct 18 ms 344 KB Output is correct
20 Correct 36 ms 344 KB Output is correct
21 Correct 20 ms 344 KB Output is correct
22 Correct 2 ms 344 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 2 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 9 ms 344 KB Output is correct
9 Correct 14 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 3 ms 344 KB Output is correct
12 Correct 6 ms 344 KB Output is correct
13 Correct 19 ms 344 KB Output is correct
14 Correct 4 ms 344 KB Output is correct
15 Correct 10 ms 344 KB Output is correct
16 Correct 11 ms 344 KB Output is correct
17 Correct 13 ms 344 KB Output is correct
18 Correct 11 ms 344 KB Output is correct
19 Correct 18 ms 344 KB Output is correct
20 Correct 36 ms 344 KB Output is correct
21 Correct 20 ms 344 KB Output is correct
22 Correct 2 ms 344 KB Output is correct
23 Correct 11 ms 344 KB Output is correct
24 Correct 13 ms 344 KB Output is correct
25 Correct 189 ms 344 KB Output is correct
26 Correct 140 ms 344 KB Output is correct
27 Correct 11 ms 596 KB Output is correct
28 Correct 12 ms 344 KB Output is correct
29 Correct 28 ms 432 KB Output is correct
30 Correct 188 ms 344 KB Output is correct
31 Correct 29 ms 344 KB Output is correct
32 Correct 65 ms 344 KB Output is correct
33 Correct 74 ms 344 KB Output is correct
34 Correct 91 ms 344 KB Output is correct
35 Correct 103 ms 344 KB Output is correct
36 Correct 137 ms 344 KB Output is correct
37 Incorrect 274 ms 344 KB Too many queries.
38 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# Verdict Execution time Memory 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 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 21 ms 344 KB Output is correct
8 Correct 22 ms 344 KB Output is correct
9 Incorrect 250 ms 344 KB Too many queries.
10 Halted 0 ms 0 KB -