Submission #1081127

#TimeUsernameProblemLanguageResultExecution timeMemory
1081127BoomydayRarest Insects (IOI22_insects)C++17
50 / 100
142 ms928 KiB
// // 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){ 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; 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 (stderr)

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:52:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |         if (mid*num_types <= inside.size()){
      |             ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
insects.cpp:72:27: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   72 |         if (inside.size() == num_types*mid) {
      |             ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...