# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
941123 | FKS | Martian DNA (BOI18_dna) | C++14 | 38 ms | 4196 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;
#define max(a, b) (a > b ? a : b)
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k, r;cin>>n>>k>>r;
int* dna = new int[n];
for (int i = 0;i < n;i++)
cin >> dna[i];
unordered_map<int, int> req;
for (int i = 0;i < r;i++)
{
int x, y;
cin >> x >> y;
req[x] = y;
}
int min_len = 1e9;
int j = 0;
for (int i = 0;i < n;i++)
{
if (i)
req[dna[i-1]]++;
for (j;j < min(n, i + min_len);j++)
{
if (req[dna[j]])
{
req[dna[j]]--;
}
if (req[dna[j]] == 0)
req.erase(dna[j]);
if (!req.size())
min_len = min(min_len, j - i + 1);
}
}
if (min_len == 1e9)
cout << "impossible";
else if (min_len)
cout << min_len;
else if (min_len == 0)
cout << "impossible";
return 0;
}
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... |