# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1015526 | Hanksburger | Martian DNA (BOI18_dna) | C++17 | 76 ms | 19928 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;
int a[200005], b[200005], c[200005];
vector<int> v[200005];
set<int> s;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k, r, mn;
cin >> n >> k >> r;
for (int i=1; i<=n; i++)
{
cin >> a[i];
v[a[i]].push_back(i);
}
for (int i=1; i<=r; i++)
{
int x, y;
cin >> x >> y;
b[x]=y;
}
for (int i=0; i<k; i++)
{
if (v[i].size()<b[i])
{
cout << "impossible";
return 0;
}
if (b[i])
s.insert(v[i][b[i]-1]);
}
mn=*s.rbegin();
for (int i=1; i<=n; i++)
{
if (b[a[i]])
{
s.erase(v[a[i]][c[a[i]]+b[a[i]]-1]);
if (v[a[i]].size()<=c[a[i]]+b[a[i]])
break;
s.insert(v[a[i]][c[a[i]]+b[a[i]]]);
c[a[i]]++;
}
mn=min(mn, *s.rbegin()-i);
}
cout << mn;
}
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... |