oj.uz

답안 #1081173

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1081173 2024-08-29T19:16:43 Z Boomyday 드문 곤충 (IOI22_insects) C++17
0 / 100
 5 ms 344 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;
    vector<int> outside, inside;
    for(int i=0;i<N;++i){


        move_inside(i);
        if (press_button() == 2){
            move_outside(i);
            outside.push_back(i);
        } else {
            inside.push_back(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;*/
        if (mid*num_types < inside.size()){
            outside.clear();
            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;
    }
    //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:60:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |         if (mid*num_types < inside.size()){
      |             ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
insects.cpp:81:27: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   81 |         if (inside.size() == num_types*mid) {
      |             ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 5 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Incorrect 2 ms 344 KB Wrong answer.
11 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 5 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Incorrect 2 ms 344 KB Wrong answer.
11 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Wrong answer.
2 Halted 0 ms 0 KB -