oj.uz

Submission #848564

# Submission time Handle Problem Language Result Execution time Memory
848564 2023-09-12T22:11:10 Z Itamar Rarest Insects (IOI22_insects) C++17
85.66 / 100
 59 ms 856 KB 
#include <cassert>
#include <cstdio>
#include <insects.h>
#include <algorithm>
#include <map>
#include <set>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
using namespace std;
#define vi vector<int>
#include <random>
/*
 int kMaxQueries = 40000;

static int N;
// Insect types are compressed to colors in the range [0, N).
static std::vector<int> color;
static std::vector<bool> in_box;

static std::vector<int> color_occurrences;
static std::multiset<int> max_occurrences;

static std::vector<int> op_counter(3, 0);

static inline void protocol_violation(std::string message) {
    printf("Protocol Violation: %s\n", message.c_str());
    exit(0);
}

void move_inside(int i) {
    if (i < 0 || i >= N) {
        protocol_violation("invalid parameter");
    }
    ++op_counter[0];
    if (op_counter[0] > kMaxQueries) {
        protocol_violation("too many calls");
    }
    if (!in_box[i]) {
        in_box[i] = true;
        max_occurrences.erase(max_occurrences.find(color_occurrences[color[i]]));
        ++color_occurrences[color[i]];
        max_occurrences.insert(color_occurrences[color[i]]);
    }
}

void move_outside(int i) {
    if (i < 0 || i >= N) {
        protocol_violation("invalid parameter");
    }
    ++op_counter[1];
    if (op_counter[1] > kMaxQueries) {
        protocol_violation("too many calls");
    }
    if (in_box[i]) {
        in_box[i] = false;
        max_occurrences.erase(max_occurrences.find(color_occurrences[color[i]]));
        --color_occurrences[color[i]];
        max_occurrences.insert(color_occurrences[color[i]]);
    }
}

int press_button() {
    ++op_counter[2];
    if (op_counter[2] > kMaxQueries) {
        protocol_violation("too many calls");
    }
    return *(max_occurrences.rbegin());
}

*/



int min_cardinality(int N) {
    int sum = 0;
    vector<bool> in(N);
    for (int i = 0; i < N; i++) {
        move_inside(i);
        sum++;
        in[i] = 1;
        if (press_button() > 1) {
            move_outside(i);
            sum--;
            in[i] = 0;
        }
    }
    const int n = N;
    const int num = sum;

    //int cur = 1;

    int s = 1, e = N / num;
    vi col_siz(N);
    vi my_col(N, -1);
    vi good;
    for (int i = 0; i < n; i++)if (in[i])good.push_back(i);
    if (num <= 5) {
        for (int i = 0; i < n; i++) {
            if (in[i]) {
                my_col[i] = i;
                col_siz[i]++;
                move_outside(i);
            }
        }
        for (int i = 0; i < n; i++) {
            if (!in[i]) {
                move_inside(i);
                random_shuffle(good.begin(), good.end());
                for(int j : good){
                        move_inside(j);
                        if (press_button() == 2) {
                            my_col[i] = j;
                            col_siz[j]++;
                            move_outside(j);
                            move_outside(i);
                            break;
                        }
                        move_outside(j);
                }
                
            }
        }
        int mini = 1e9;
        for (int i = 0; i < n; i++) {
            if (col_siz[i] > 0 && col_siz[i] < mini) {
                mini = col_siz[i];
            }
        }
        return mini;
    }
    else {
        while (s != e) {
            int mid = (4 * s + 1 * e + 4) / 5;
            vi ne;
            for (int i = 0; i < n; i++) {
                if (!in[i]) {
                    move_inside(i);
                    if (press_button() > mid) {
                        move_outside(i);
                    }
                    else {
                        in[i] = 1;
                        ne.push_back(i);
                        sum++;
                    }
                }
                if (sum == mid * num)break;
                if (sum + n - i - 1 < mid * num)break;
            }
            if (sum == mid * num) {
                s = mid;
            }
            else {
                e = mid - 1;

                for (int x : ne) {
                    move_outside(x);
                    sum--;
                    in[x] = 0;
                }
            }
        }

        return s;
    }
}

Compilation message

insects.cpp:9: warning: ignoring '#pragma warning ' [-Wunknown-pragmas]
    9 | #pragma warning(disable : 4996)
      |

Subtask #1
10.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 0 ms 344 KB Output is correct
5 Correct 1 ms 756 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 3 ms 600 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 4 ms 344 KB Output is correct
15 Correct 2 ms 600 KB Output is correct
16 Correct 2 ms 600 KB Output is correct
17 Correct 2 ms 600 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 2 ms 600 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 2 ms 852 KB Output is correct
22 Correct 1 ms 600 KB Output is correct

Subtask #2
15.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 0 ms 344 KB Output is correct
5 Correct 1 ms 756 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 3 ms 600 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 4 ms 344 KB Output is correct
15 Correct 2 ms 600 KB Output is correct
16 Correct 2 ms 600 KB Output is correct
17 Correct 2 ms 600 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 2 ms 600 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 2 ms 852 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 8 ms 344 KB Output is correct
24 Correct 6 ms 424 KB Output is correct
25 Correct 14 ms 420 KB Output is correct
26 Correct 14 ms 600 KB Output is correct
27 Correct 10 ms 540 KB Output is correct
28 Correct 4 ms 600 KB Output is correct
29 Correct 19 ms 420 KB Output is correct
30 Correct 15 ms 856 KB Output is correct
31 Correct 20 ms 344 KB Output is correct
32 Correct 15 ms 344 KB Output is correct
33 Correct 14 ms 600 KB Output is correct
34 Correct 11 ms 600 KB Output is correct
35 Correct 14 ms 680 KB Output is correct
36 Correct 20 ms 600 KB Output is correct
37 Correct 14 ms 680 KB Output is correct
38 Correct 15 ms 600 KB Output is correct
39 Correct 9 ms 600 KB Output is correct
40 Correct 8 ms 600 KB Output is correct
41 Correct 5 ms 600 KB Output is correct

Subtask #3
60.66 / 75.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 0 ms 344 KB Output is correct
6 Partially correct 0 ms 344 KB Output is partially correct
7 Correct 18 ms 344 KB Output is correct
8 Correct 9 ms 592 KB Output is correct
9 Partially correct 31 ms 416 KB Output is partially correct
10 Partially correct 35 ms 592 KB Output is partially correct
11 Partially correct 21 ms 396 KB Output is partially correct
12 Correct 10 ms 600 KB Output is correct
13 Partially correct 44 ms 344 KB Output is partially correct
14 Partially correct 30 ms 400 KB Output is partially correct
15 Partially correct 37 ms 600 KB Output is partially correct
16 Correct 31 ms 596 KB Output is correct
17 Correct 22 ms 424 KB Output is correct
18 Partially correct 33 ms 416 KB Output is partially correct
19 Partially correct 31 ms 420 KB Output is partially correct
20 Partially correct 40 ms 592 KB Output is partially correct
21 Partially correct 54 ms 592 KB Output is partially correct
22 Partially correct 33 ms 344 KB Output is partially correct
23 Correct 38 ms 592 KB Output is correct
24 Correct 17 ms 848 KB Output is correct
25 Correct 11 ms 344 KB Output is correct
26 Correct 11 ms 616 KB Output is correct
27 Partially correct 43 ms 592 KB Output is partially correct
28 Correct 18 ms 344 KB Output is correct
29 Partially correct 42 ms 600 KB Output is partially correct
30 Partially correct 59 ms 424 KB Output is partially correct
31 Partially correct 35 ms 848 KB Output is partially correct
32 Partially correct 29 ms 592 KB Output is partially correct
33 Partially correct 39 ms 656 KB Output is partially correct
34 Correct 34 ms 672 KB Output is correct
35 Partially correct 41 ms 660 KB Output is partially correct
36 Partially correct 38 ms 592 KB Output is partially correct
37 Partially correct 40 ms 600 KB Output is partially correct
38 Partially correct 52 ms 412 KB Output is partially correct
39 Partially correct 38 ms 608 KB Output is partially correct
40 Correct 16 ms 600 KB Output is correct
41 Partially correct 32 ms 652 KB Output is partially correct
42 Partially correct 57 ms 592 KB Output is partially correct
43 Partially correct 9 ms 600 KB Output is partially correct
44 Partially correct 43 ms 400 KB Output is partially correct
45 Partially correct 26 ms 420 KB Output is partially correct
46 Correct 11 ms 600 KB Output is correct
47 Correct 14 ms 592 KB Output is correct
48 Correct 13 ms 592 KB Output is correct