# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1024483 | 2024-07-16T05:49:31 Z | vjudge1 | Rarest Insects (IOI22_insects) | C++17 | 1 ms | 344 KB |
#include "insects.h" #include<bits/stdc++.h> using namespace std; #define pb push_back void put(int x){ move_inside(x - 1); } void pop(int x){ move_outside(x - 1); } int get(){ return press_button(); } int min_cardinality(int N) { int n = N; vector<int> d; map<int, int> q, cnt; int ls = 0; for(int i=1; i<=n; i++){ put(i); //cout<<get()<<' '<<i<<'\n'; if(get() == 1){ q[i] = ++ls; cnt[ls] = 1; d.pb(i); continue; } for(int x: d){ pop(x); if(get() == 1){ cnt[q[x]] ++; q[i] = q[x]; break; } put(x); } } //for(int x: d) cout<<x<<' '; //cout<<'\n'; int ans = -1, mn = 1e9; for(int i=1; i<=n; i++){ //cout<<i<<' '<<q[i]<<'\n'; if(cnt[q[i]] < mn){ ans = i; mn = cnt[q[i]]; } } return mn; }
Compilation message
# | 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 | Incorrect | 1 ms | 344 KB | Wrong answer. |
5 | Halted | 0 ms | 0 KB | - |
# | 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 | Incorrect | 1 ms | 344 KB | Wrong answer. |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Wrong answer. |
2 | Halted | 0 ms | 0 KB | - |