#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> creq;
for (int i = 0;i < r;i++)
{
int x, y;
cin >> x >> y;
creq[x] = y;
}
int min_len = 1e9;
for (int i = 0;i < n;i++)
{
unordered_map<int, int> req = creq;
for (int j = i;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;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
344 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
344 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
75 ms |
448 KB |
Output is correct |
2 |
Correct |
107 ms |
344 KB |
Output is correct |
3 |
Correct |
281 ms |
592 KB |
Output is correct |
4 |
Correct |
332 ms |
600 KB |
Output is correct |
5 |
Correct |
155 ms |
348 KB |
Output is correct |
6 |
Correct |
37 ms |
456 KB |
Output is correct |
7 |
Correct |
1 ms |
600 KB |
Output is correct |
8 |
Correct |
0 ms |
456 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
348 KB |
Output is correct |
12 |
Correct |
1 ms |
348 KB |
Output is correct |
13 |
Correct |
1 ms |
348 KB |
Output is correct |
14 |
Correct |
0 ms |
348 KB |
Output is correct |
15 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
2054 ms |
1116 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
2054 ms |
7484 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |