# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
462416 | 2021-08-10T13:28:15 Z | _Avocado_ | Martian DNA (BOI18_dna) | C++14 | 96 ms | 8028 KB |
#include <bits/stdc++.h> #define int int64_t using namespace std; signed main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int n, k, q; cin>>n>>k>>q; vector<int>v(n); for(auto&u: v) cin>>u; vector<int>goal(k); for(int i = 0; i<q; ++i){ int a, b; cin>>a>>b; goal[a] = b; } //for(auto u: goal) cout<<u<<" "; //cout<<endl; int ans = 1e9; int start = 0; vector<int>cur(k); map<int, int>full; for(int i = 0; i<n; ++i){ ++cur[v[i]]; while(cur[v[i]] > goal[v[i]] && v[start] == v[i] && start < i){ --cur[v[start]]; ++start; } if(cur[v[i]] >= goal[v[i]] && goal[v[i]] != 0) full[v[i]] = 1; if(full.size() == q) ans = min(ans, i-start+1); } if(ans == 1e9) cout<<"impossible"; else cout<<ans; cout<<'\n'; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Incorrect | 1 ms | 204 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 332 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 17 ms | 1868 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 96 ms | 8028 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |