oj.uz

Submission #1081202

# Submission time Handle Problem Language Result Execution time Memory
1081202 2024-08-29T19:38:37 Z Boomyday Rarest Insects (IOI22_insects) C++17
99.89 / 100
 53 ms 1388 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; // goes up
        } else {
            hi = mid-1; // goes down
            outside.clear();
            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()%20;

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

Subtask #2
15.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 1 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 4 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 4 ms 456 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 4 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 4 ms 600 KB Output is correct
14 Correct 2 ms 444 KB Output is correct
15 Correct 3 ms 600 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 3 ms 444 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 3 ms 404 KB Output is correct
20 Correct 3 ms 344 KB Output is correct
21 Correct 2 ms 456 KB Output is correct
22 Correct 3 ms 344 KB Output is correct
23 Correct 13 ms 468 KB Output is correct
24 Correct 5 ms 344 KB Output is correct
25 Correct 10 ms 764 KB Output is correct
26 Correct 18 ms 344 KB Output is correct
27 Correct 21 ms 708 KB Output is correct
28 Correct 4 ms 344 KB Output is correct
29 Correct 11 ms 524 KB Output is correct
30 Correct 13 ms 592 KB Output is correct
31 Correct 14 ms 600 KB Output is correct
32 Correct 17 ms 1388 KB Output is correct
33 Correct 14 ms 600 KB Output is correct
34 Correct 14 ms 600 KB Output is correct
35 Correct 12 ms 600 KB Output is correct
36 Correct 17 ms 600 KB Output is correct
37 Correct 14 ms 644 KB Output is correct
38 Correct 18 ms 532 KB Output is correct
39 Correct 12 ms 600 KB Output is correct
40 Correct 7 ms 344 KB Output is correct
41 Correct 4 ms 456 KB Output is correct

Subtask #3
74.89 / 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 1 ms 344 KB Output is correct
7 Correct 24 ms 608 KB Output is correct
8 Correct 13 ms 600 KB Output is correct
9 Correct 34 ms 740 KB Output is correct
10 Correct 44 ms 876 KB Output is correct
11 Correct 30 ms 664 KB Output is correct
12 Correct 13 ms 484 KB Output is correct
13 Correct 31 ms 756 KB Output is correct
14 Correct 48 ms 728 KB Output is correct
15 Correct 53 ms 744 KB Output is correct
16 Correct 33 ms 588 KB Output is correct
17 Correct 34 ms 484 KB Output is correct
18 Correct 30 ms 456 KB Output is correct
19 Partially correct 40 ms 464 KB Output is partially correct
20 Correct 29 ms 592 KB Output is correct
21 Correct 28 ms 444 KB Output is correct
22 Correct 42 ms 1104 KB Output is correct
23 Correct 30 ms 592 KB Output is correct
24 Correct 16 ms 468 KB Output is correct
25 Correct 20 ms 732 KB Output is correct
26 Correct 7 ms 344 KB Output is correct
27 Correct 27 ms 556 KB Output is correct
28 Correct 28 ms 1080 KB Output is correct
29 Partially correct 40 ms 596 KB Output is partially correct
30 Partially correct 27 ms 600 KB Output is partially correct
31 Correct 44 ms 444 KB Output is correct
32 Correct 41 ms 856 KB Output is correct
33 Correct 24 ms 592 KB Output is correct
34 Correct 36 ms 704 KB Output is correct
35 Partially correct 25 ms 600 KB Output is partially correct
36 Partially correct 30 ms 880 KB Output is partially correct
37 Correct 38 ms 1112 KB Output is correct
38 Correct 28 ms 592 KB Output is correct
39 Correct 23 ms 576 KB Output is correct
40 Correct 40 ms 728 KB Output is correct
41 Partially correct 36 ms 944 KB Output is partially correct
42 Partially correct 39 ms 592 KB Output is partially correct
43 Correct 7 ms 648 KB Output is correct
44 Correct 27 ms 740 KB Output is correct
45 Correct 27 ms 1024 KB Output is correct
46 Correct 16 ms 592 KB Output is correct
47 Correct 24 ms 600 KB Output is correct
48 Correct 19 ms 700 KB Output is correct