oj.uz

Submission #1081184

# Submission time Handle Problem Language Result Execution time Memory
1081184 2024-08-29T19:25:51 Z Boomyday Rarest Insects (IOI22_insects) C++17
53.16 / 100
 129 ms 1616 KB 
//
// Created by adavy on 8/29/2024.
//
#include "insects.h"

#include <bits/stdc++.h>
using namespace std;
/*
static std::vector<int> op_counter(3, 0);

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;
    set<int> outside, inside;
    for(int i=0;i<N;++i){


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





    int lo = 1, hi = N/num_types;



    cerr << "num_types: " << num_types << endl;


    while (lo<hi){
        int mid = (lo+hi+1)/2;

        cerr << lo << " " << mid << " " << hi << endl;
        cerr << "outside, inside: " << outside.size() << " " << inside.size() << endl;
        //cerr << op_counter[0] << " " << op_counter[1] << " " << op_counter[2] << endl;

        /*

        cout << lo << " " << hi << " " << mid << endl;
        for(auto& j:outside) cout << j << " ";
        cout << endl;
        for (auto& j:inside) cout << j << " ";
        cout << endl;*/

        set<int> new_outside;
        set<int> to_kill;

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

        outside = new_outside;

        if (inside.size() == num_types*mid) {
            lo = mid;
        } else {
            hi = mid-1;
            for (auto&x:to_kill){
                inside.erase(x);
                outside.insert(x);
                move_outside(x);

            }
        }
    }
    //cerr << op_counter[0] << " " << op_counter[1] << " " << op_counter[2] << endl;

    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 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; //= rand()%2;

        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:76:27: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   76 |         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 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 3 ms 432 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 5 ms 600 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 6 ms 444 KB Output is correct
13 Correct 3 ms 344 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 4 ms 432 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 3 ms 600 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 2 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 1 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 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 3 ms 432 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 5 ms 600 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 6 ms 444 KB Output is correct
13 Correct 3 ms 344 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 4 ms 432 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 3 ms 600 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 2 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 20 ms 600 KB Output is correct
24 Correct 5 ms 344 KB Output is correct
25 Correct 13 ms 748 KB Output is correct
26 Correct 22 ms 756 KB Output is correct
27 Correct 62 ms 508 KB Output is correct
28 Correct 4 ms 600 KB Output is correct
29 Correct 43 ms 344 KB Output is correct
30 Correct 31 ms 732 KB Output is correct
31 Correct 20 ms 516 KB Output is correct
32 Correct 19 ms 472 KB Output is correct
33 Correct 26 ms 344 KB Output is correct
34 Correct 16 ms 744 KB Output is correct
35 Correct 11 ms 344 KB Output is correct
36 Correct 14 ms 344 KB Output is correct
37 Correct 22 ms 696 KB Output is correct
38 Correct 16 ms 600 KB Output is correct
39 Correct 9 ms 344 KB Output is correct
40 Correct 10 ms 344 KB Output is correct
41 Correct 6 ms 476 KB Output is correct

Subtask #3
28.16 / 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 1 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 42 ms 592 KB Output is correct
8 Correct 8 ms 600 KB Output is correct
9 Correct 27 ms 872 KB Output is correct
10 Partially correct 48 ms 1616 KB Output is partially correct
11 Partially correct 129 ms 596 KB Output is partially correct
12 Correct 9 ms 344 KB Output is correct
13 Partially correct 122 ms 1048 KB Output is partially correct
14 Partially correct 58 ms 588 KB Output is partially correct
15 Partially correct 46 ms 848 KB Output is partially correct
16 Partially correct 48 ms 600 KB Output is partially correct
17 Partially correct 25 ms 628 KB Output is partially correct
18 Partially correct 37 ms 720 KB Output is partially correct
19 Partially correct 37 ms 596 KB Output is partially correct
20 Partially correct 45 ms 852 KB Output is partially correct
21 Partially correct 45 ms 748 KB Output is partially correct
22 Partially correct 47 ms 592 KB Output is partially correct
23 Partially correct 40 ms 1104 KB Output is partially correct
24 Correct 29 ms 772 KB Output is correct
25 Correct 10 ms 344 KB Output is correct
26 Correct 10 ms 600 KB Output is correct
27 Correct 24 ms 500 KB Output is correct
28 Correct 26 ms 600 KB Output is correct
29 Partially correct 34 ms 592 KB Output is partially correct
30 Partially correct 42 ms 756 KB Output is partially correct
31 Partially correct 33 ms 600 KB Output is partially correct
32 Partially correct 53 ms 592 KB Output is partially correct
33 Partially correct 76 ms 744 KB Output is partially correct
34 Partially correct 69 ms 748 KB Output is partially correct
35 Partially correct 31 ms 1000 KB Output is partially correct
36 Partially correct 39 ms 704 KB Output is partially correct
37 Partially correct 49 ms 860 KB Output is partially correct
38 Partially correct 48 ms 600 KB Output is partially correct
39 Correct 25 ms 624 KB Output is correct
40 Correct 25 ms 592 KB Output is correct
41 Partially correct 27 ms 496 KB Output is partially correct
42 Partially correct 36 ms 848 KB Output is partially correct
43 Partially correct 12 ms 344 KB Output is partially correct
44 Partially correct 101 ms 848 KB Output is partially correct
45 Correct 30 ms 784 KB Output is correct
46 Correct 15 ms 1000 KB Output is correct
47 Correct 14 ms 768 KB Output is correct
48 Correct 27 ms 704 KB Output is correct