# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
932356 | 12345678 | Martian DNA (BOI18_dna) | C++17 | 2028 ms | 3204 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int nx=2e5+5;
int n, v[nx], k, r, res[nx], b, q, ans=INT_MAX;
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>n>>k>>r;
for (int i=1; i<=n; i++) cin>>v[i], res[i]=INT_MAX;
for (int i=1; i<=r; i++)
{
cin>>b>>q;
deque<int> dq;
for (int j=1; j<=n; j++)
{
if (v[j]==b) dq.push_back(j);
while (!dq.empty()&&dq.size()>q) dq.pop_front();
if (dq.size()>=q) res[j]=min(res[j], dq.front());
else res[j]=-1;
//cout<<i<<' '<<j<<' '<<res[j]<<'\n';
}
}
for (int i=1; i<=n; i++) ans=min(ans, res[i]!=-1?i-res[i]+1:INT_MAX);
if (ans==INT_MAX) cout<<"impossible";
else cout<<ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |