Submission #710389

#TimeUsernameProblemLanguageResultExecution timeMemory
710389myrcellaRarest Insects (IOI22_insects)C++17
Compilation error
0 ms0 KiB
//by szh #include<bits/stdc++.h> //#include "insects.h" using namespace std; #define fi first #define se second #define pii pair<int,int> #define pll pair<long long,long long> #define pb push_back #define debug(x) cerr<<#x<<"="<<x<<endl #define pq priority_queue #define inf 0x3f #define rep(i,a,b) for (int i=a;i<(b);i++) #define MP make_pair #define SZ(x) (int(x.size())) #define ll long long #define mod 1000000007 #define ALL(x) x.begin(),x.end() void inc(int &a,int b) {a=(a+b)%mod;} void dec(int &a,int b) {a=(a-b+mod)%mod;} int lowbit(int x) {return x&(-x);} ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;} const int maxn = 2010; int typ[maxn]; bool in[maxn]; int cnt[maxn]; const 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 min_cardinality(int N) { int cur = 0; rep(i,0,N) { move_inside(i); int tmp = press_button(); if (tmp==1) typ[i]=cur++; else rep(j,0,i) { if (!in[j]) continue; move_outside(j); tmp = press_button(); if (tmp!=1) move_inside(j); else { typ[i] = typ[j]; break; } } cnt[typ[i]]++; } int ret = N; rep(i,0,cur) ret = min(ret,cnt[i]); return ret; } 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)

/usr/bin/ld: /tmp/ccMoxLtL.o: in function `move_inside(int)':
stub.cpp:(.text+0x0): multiple definition of `move_inside(int)'; /tmp/ccYHJCyL.o:insects.cpp:(.text+0x380): first defined here
/usr/bin/ld: /tmp/ccMoxLtL.o: in function `move_outside(int)':
stub.cpp:(.text+0xe0): multiple definition of `move_outside(int)'; /tmp/ccYHJCyL.o:insects.cpp:(.text+0x550): first defined here
/usr/bin/ld: /tmp/ccMoxLtL.o: in function `press_button()':
stub.cpp:(.text+0x1c0): multiple definition of `press_button()'; /tmp/ccYHJCyL.o:insects.cpp:(.text+0x2f0): first defined here
/usr/bin/ld: /tmp/ccMoxLtL.o: in function `main':
stub.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/ccYHJCyL.o:insects.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status