oj.uz

Submission #1081106

# Submission time Handle Problem Language Result Execution time Memory
1081106 2024-08-29T18:28:45 Z Boomyday Rarest Insects (IOI22_insects) C++17
47.5 / 100
 191 ms 932 KB 
//
// Created by adavy on 8/29/2024.
//
#include "insects.h"

#include <bits/stdc++.h>
using namespace std;
/*
void move_inside(int i);
void move_outside(int i);
int press_button();
int min_cardinality(int N);


*/

int min_cardinality(int N) {
    int num_types = 0;
    vector<int> outside, inside;
    for(int i=0;i<N;++i){
        outside.push_back(i);

        move_inside(i);
        if (press_button() == 2){
            move_outside(i);
        } else {
            inside.push_back(i);
            num_types++;
        }
    }



    for(auto& i:inside){
        move_outside(i);
    }
    inside.clear();

    int lo = 1, hi = N;






    while (lo<hi){
        int mid = (lo+hi+1)/2;
        if (mid < inside.size()){
            for(auto&i:inside){
                outside.push_back(i);
                move_outside(i);
            }
            inside.clear();
        }
        vector<int> new_outside;

        for(auto& i:outside){
            move_inside(i);
            if (press_button() > mid){
                move_outside(i); new_outside.push_back(i);
            } else {
                inside.push_back(i);
            }
        }

        outside = new_outside;

        if (inside.size() == num_types*mid) {
            lo = mid;
        } else hi = mid-1;
    }
    return lo;
}
/*


#include <cassert>
#include <cstdio>

#include <algorithm>
#include <map>
#include <set>
#include <string>
#include <vector>

static inline constexpr 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 main() {
    assert(1 == scanf("%d", &N));
    color.resize(N);
    in_box.assign(N, false);

    std::map<int, int> type_to_color;
    for (int i = 0; i < N; ++i) {
        int Ti;
        assert(1 == scanf("%d", &Ti));
        if (type_to_color.find(Ti) == type_to_color.end()) {
            int new_color = type_to_color.size();
            type_to_color[Ti] = new_color;
            max_occurrences.insert(0);
        }
        color[i] = type_to_color[Ti];
    }

    color_occurrences.assign(type_to_color.size(), 0);

    int answer = min_cardinality(N);
    int Q = *std::max_element(op_counter.begin(), op_counter.end());
    printf("%d\n", answer);
    printf("%d\n", Q);
    return 0;
}*/

Compilation message

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:48:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |         if (mid < inside.size()){
      |             ~~~~^~~~~~~~~~~~~~~
insects.cpp:68:27: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   68 |         if (inside.size() == num_types*mid) {
      |             ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~

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 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 5 ms 344 KB Output is correct
7 Correct 10 ms 436 KB Output is correct
8 Correct 9 ms 344 KB Output is correct
9 Correct 7 ms 344 KB Output is correct
10 Correct 10 ms 344 KB Output is correct
11 Correct 12 ms 344 KB Output is correct
12 Correct 7 ms 344 KB Output is correct
13 Correct 9 ms 344 KB Output is correct
14 Correct 12 ms 344 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Correct 11 ms 344 KB Output is correct
17 Correct 7 ms 344 KB Output is correct
18 Correct 11 ms 344 KB Output is correct
19 Correct 6 ms 344 KB Output is correct
20 Correct 6 ms 436 KB Output is correct
21 Correct 9 ms 344 KB Output is correct
22 Correct 11 ms 344 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 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 5 ms 344 KB Output is correct
7 Correct 10 ms 436 KB Output is correct
8 Correct 9 ms 344 KB Output is correct
9 Correct 7 ms 344 KB Output is correct
10 Correct 10 ms 344 KB Output is correct
11 Correct 12 ms 344 KB Output is correct
12 Correct 7 ms 344 KB Output is correct
13 Correct 9 ms 344 KB Output is correct
14 Correct 12 ms 344 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Correct 11 ms 344 KB Output is correct
17 Correct 7 ms 344 KB Output is correct
18 Correct 11 ms 344 KB Output is correct
19 Correct 6 ms 344 KB Output is correct
20 Correct 6 ms 436 KB Output is correct
21 Correct 9 ms 344 KB Output is correct
22 Correct 11 ms 344 KB Output is correct
23 Correct 20 ms 344 KB Output is correct
24 Correct 50 ms 344 KB Output is correct
25 Correct 77 ms 344 KB Output is correct
26 Correct 61 ms 600 KB Output is correct
27 Correct 56 ms 600 KB Output is correct
28 Correct 57 ms 428 KB Output is correct
29 Correct 70 ms 600 KB Output is correct
30 Correct 48 ms 444 KB Output is correct
31 Correct 58 ms 444 KB Output is correct
32 Correct 64 ms 344 KB Output is correct
33 Correct 61 ms 344 KB Output is correct
34 Correct 51 ms 344 KB Output is correct
35 Correct 46 ms 344 KB Output is correct
36 Correct 68 ms 344 KB Output is correct
37 Correct 49 ms 600 KB Output is correct
38 Correct 66 ms 848 KB Output is correct
39 Correct 58 ms 424 KB Output is correct
40 Correct 62 ms 344 KB Output is correct
41 Correct 53 ms 344 KB Output is correct

Subtask #3
22.5 / 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 Partially correct 1 ms 344 KB Output is partially correct
7 Correct 33 ms 684 KB Output is correct
8 Partially correct 129 ms 624 KB Output is partially correct
9 Partially correct 161 ms 900 KB Output is partially correct
10 Partially correct 169 ms 444 KB Output is partially correct
11 Partially correct 130 ms 600 KB Output is partially correct
12 Partially correct 137 ms 932 KB Output is partially correct
13 Partially correct 160 ms 436 KB Output is partially correct
14 Partially correct 159 ms 788 KB Output is partially correct
15 Partially correct 147 ms 676 KB Output is partially correct
16 Partially correct 145 ms 436 KB Output is partially correct
17 Partially correct 123 ms 652 KB Output is partially correct
18 Partially correct 167 ms 932 KB Output is partially correct
19 Partially correct 135 ms 928 KB Output is partially correct
20 Partially correct 158 ms 684 KB Output is partially correct
21 Partially correct 140 ms 684 KB Output is partially correct
22 Partially correct 152 ms 664 KB Output is partially correct
23 Partially correct 147 ms 640 KB Output is partially correct
24 Partially correct 154 ms 600 KB Output is partially correct
25 Partially correct 118 ms 876 KB Output is partially correct
26 Partially correct 128 ms 676 KB Output is partially correct
27 Partially correct 128 ms 688 KB Output is partially correct
28 Partially correct 177 ms 884 KB Output is partially correct
29 Partially correct 142 ms 664 KB Output is partially correct
30 Partially correct 152 ms 684 KB Output is partially correct
31 Partially correct 121 ms 688 KB Output is partially correct
32 Partially correct 191 ms 600 KB Output is partially correct
33 Partially correct 166 ms 916 KB Output is partially correct
34 Partially correct 148 ms 680 KB Output is partially correct
35 Partially correct 152 ms 680 KB Output is partially correct
36 Partially correct 103 ms 444 KB Output is partially correct
37 Partially correct 156 ms 444 KB Output is partially correct
38 Partially correct 131 ms 684 KB Output is partially correct
39 Partially correct 122 ms 600 KB Output is partially correct
40 Partially correct 95 ms 436 KB Output is partially correct
41 Partially correct 126 ms 440 KB Output is partially correct
42 Partially correct 123 ms 680 KB Output is partially correct
43 Partially correct 26 ms 440 KB Output is partially correct
44 Partially correct 125 ms 436 KB Output is partially correct
45 Partially correct 110 ms 692 KB Output is partially correct
46 Partially correct 137 ms 600 KB Output is partially correct
47 Partially correct 135 ms 452 KB Output is partially correct
48 Partially correct 119 ms 456 KB Output is partially correct