oj.uz

답안 #1081116

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1081116 2024-08-29T18:35:10 Z Boomyday 드문 곤충 (IOI22_insects) C++17
50 / 100
 157 ms 928 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;
        /*
        cout << lo << " " << hi << " " << mid << endl;
        for(auto& j:outside) cout << j << " ";
        cout << endl;
        for (auto& j:inside) cout << j << " ";
        cout << endl;*/
        if (mid*num_types <= 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:54:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |         if (mid*num_types <= inside.size()){
      |             ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
insects.cpp:74:27: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   74 |         if (inside.size() == num_types*mid) {
      |             ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 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 3 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Correct 7 ms 344 KB Output is correct
11 Correct 3 ms 344 KB Output is correct
12 Correct 8 ms 344 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 4 ms 344 KB Output is correct
16 Correct 6 ms 600 KB Output is correct
17 Correct 4 ms 344 KB Output is correct
18 Correct 5 ms 344 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 5 ms 344 KB Output is correct
21 Correct 4 ms 344 KB Output is correct
22 Correct 2 ms 344 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 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 3 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Correct 7 ms 344 KB Output is correct
11 Correct 3 ms 344 KB Output is correct
12 Correct 8 ms 344 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 4 ms 344 KB Output is correct
16 Correct 6 ms 600 KB Output is correct
17 Correct 4 ms 344 KB Output is correct
18 Correct 5 ms 344 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 5 ms 344 KB Output is correct
21 Correct 4 ms 344 KB Output is correct
22 Correct 2 ms 344 KB Output is correct
23 Correct 15 ms 344 KB Output is correct
24 Correct 9 ms 344 KB Output is correct
25 Correct 19 ms 600 KB Output is correct
26 Correct 40 ms 444 KB Output is correct
27 Correct 45 ms 600 KB Output is correct
28 Correct 8 ms 600 KB Output is correct
29 Correct 54 ms 592 KB Output is correct
30 Correct 42 ms 696 KB Output is correct
31 Correct 26 ms 344 KB Output is correct
32 Correct 31 ms 344 KB Output is correct
33 Correct 38 ms 600 KB Output is correct
34 Correct 41 ms 600 KB Output is correct
35 Correct 39 ms 592 KB Output is correct
36 Correct 40 ms 344 KB Output is correct
37 Correct 33 ms 692 KB Output is correct
38 Correct 37 ms 344 KB Output is correct
39 Correct 19 ms 600 KB Output is correct
40 Correct 14 ms 344 KB Output is correct
41 Correct 9 ms 344 KB Output is correct

Subtask #3
25.0 / 75.0

# 결과 실행 시간 메모리 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 0 ms 344 KB Output is partially correct
7 Correct 28 ms 668 KB Output is correct
8 Correct 21 ms 344 KB Output is correct
9 Partially correct 50 ms 600 KB Output is partially correct
10 Partially correct 87 ms 928 KB Output is partially correct
11 Partially correct 126 ms 684 KB Output is partially correct
12 Correct 32 ms 600 KB Output is correct
13 Partially correct 157 ms 436 KB Output is partially correct
14 Partially correct 66 ms 444 KB Output is partially correct
15 Partially correct 79 ms 600 KB Output is partially correct
16 Partially correct 64 ms 436 KB Output is partially correct
17 Partially correct 76 ms 444 KB Output is partially correct
18 Partially correct 98 ms 684 KB Output is partially correct
19 Partially correct 70 ms 600 KB Output is partially correct
20 Partially correct 57 ms 432 KB Output is partially correct
21 Partially correct 64 ms 436 KB Output is partially correct
22 Partially correct 74 ms 680 KB Output is partially correct
23 Partially correct 52 ms 440 KB Output is partially correct
24 Partially correct 46 ms 688 KB Output is partially correct
25 Correct 27 ms 592 KB Output is correct
26 Correct 15 ms 452 KB Output is correct
27 Partially correct 47 ms 680 KB Output is partially correct
28 Partially correct 53 ms 856 KB Output is partially correct
29 Partially correct 55 ms 592 KB Output is partially correct
30 Partially correct 51 ms 664 KB Output is partially correct
31 Partially correct 85 ms 344 KB Output is partially correct
32 Partially correct 99 ms 444 KB Output is partially correct
33 Partially correct 81 ms 928 KB Output is partially correct
34 Partially correct 81 ms 664 KB Output is partially correct
35 Partially correct 51 ms 836 KB Output is partially correct
36 Partially correct 56 ms 444 KB Output is partially correct
37 Partially correct 82 ms 848 KB Output is partially correct
38 Partially correct 98 ms 592 KB Output is partially correct
39 Partially correct 39 ms 600 KB Output is partially correct
40 Partially correct 33 ms 444 KB Output is partially correct
41 Partially correct 39 ms 452 KB Output is partially correct
42 Partially correct 40 ms 448 KB Output is partially correct
43 Partially correct 18 ms 436 KB Output is partially correct
44 Partially correct 94 ms 440 KB Output is partially correct
45 Partially correct 49 ms 856 KB Output is partially correct
46 Correct 25 ms 344 KB Output is correct
47 Correct 28 ms 592 KB Output is correct
48 Correct 31 ms 600 KB Output is correct