#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 17;
int n, k, r, a[N], z[N], ans, b, q;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> k >> r;
for (int i = 1; i <= n; ++i)
{
cin >> a[i];
}
for (int i = 1; i <= r; ++i)
{
cin >> b >> q;
z[b] = q;
}
ans = n + 1;
for (int i = 1, j = 1; i <= n; ++i)
{
while (r > 0 && j <= n)
{
--z[a[j]];
if (!z[a[j]])
{
--r;
}
++j;
}
if (!r)
{
ans = min (ans, j - i);
}
++z[a[i]];
if (z[a[i]] == 1)
{
++r;
}
}
if (ans == n + 1)
{
cout << "impossible";
return 0;
}
cout << ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
2 |
Correct |
1 ms |
336 KB |
Output is correct |
3 |
Correct |
1 ms |
504 KB |
Output is correct |
4 |
Correct |
1 ms |
336 KB |
Output is correct |
5 |
Correct |
1 ms |
432 KB |
Output is correct |
6 |
Correct |
1 ms |
504 KB |
Output is correct |
7 |
Correct |
1 ms |
336 KB |
Output is correct |
8 |
Correct |
1 ms |
336 KB |
Output is correct |
9 |
Correct |
1 ms |
336 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
2 |
Correct |
1 ms |
336 KB |
Output is correct |
3 |
Correct |
1 ms |
336 KB |
Output is correct |
4 |
Correct |
1 ms |
336 KB |
Output is correct |
5 |
Correct |
1 ms |
336 KB |
Output is correct |
6 |
Correct |
1 ms |
504 KB |
Output is correct |
7 |
Correct |
1 ms |
336 KB |
Output is correct |
8 |
Correct |
1 ms |
336 KB |
Output is correct |
9 |
Correct |
1 ms |
336 KB |
Output is correct |
10 |
Correct |
1 ms |
336 KB |
Output is correct |
11 |
Correct |
1 ms |
336 KB |
Output is correct |
12 |
Correct |
1 ms |
336 KB |
Output is correct |
13 |
Correct |
1 ms |
336 KB |
Output is correct |
14 |
Correct |
1 ms |
336 KB |
Output is correct |
15 |
Correct |
1 ms |
336 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
9 ms |
1104 KB |
Output is correct |
2 |
Correct |
10 ms |
1616 KB |
Output is correct |
3 |
Correct |
10 ms |
1104 KB |
Output is correct |
4 |
Correct |
9 ms |
1104 KB |
Output is correct |
5 |
Correct |
12 ms |
1360 KB |
Output is correct |
6 |
Correct |
8 ms |
1104 KB |
Output is correct |
7 |
Correct |
10 ms |
1104 KB |
Output is correct |
8 |
Correct |
16 ms |
2384 KB |
Output is correct |
9 |
Correct |
11 ms |
1104 KB |
Output is correct |
10 |
Correct |
10 ms |
1500 KB |
Output is correct |
11 |
Correct |
2 ms |
336 KB |
Output is correct |
12 |
Correct |
1 ms |
336 KB |
Output is correct |
13 |
Correct |
1 ms |
336 KB |
Output is correct |
14 |
Correct |
1 ms |
336 KB |
Output is correct |
15 |
Correct |
1 ms |
336 KB |
Output is correct |
16 |
Correct |
1 ms |
336 KB |
Output is correct |
17 |
Correct |
1 ms |
508 KB |
Output is correct |
18 |
Correct |
1 ms |
336 KB |
Output is correct |
19 |
Correct |
1 ms |
336 KB |
Output is correct |
20 |
Correct |
1 ms |
336 KB |
Output is correct |
21 |
Correct |
1 ms |
336 KB |
Output is correct |
22 |
Correct |
1 ms |
336 KB |
Output is correct |
23 |
Correct |
1 ms |
504 KB |
Output is correct |
24 |
Correct |
1 ms |
336 KB |
Output is correct |
25 |
Correct |
1 ms |
336 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
23 ms |
2424 KB |
Output is correct |
2 |
Correct |
19 ms |
2384 KB |
Output is correct |
3 |
Correct |
20 ms |
1360 KB |
Output is correct |
4 |
Correct |
11 ms |
1104 KB |
Output is correct |
5 |
Correct |
21 ms |
1616 KB |
Output is correct |
6 |
Correct |
23 ms |
1872 KB |
Output is correct |
7 |
Correct |
12 ms |
1104 KB |
Output is correct |
8 |
Correct |
14 ms |
1104 KB |
Output is correct |
9 |
Correct |
10 ms |
1116 KB |
Output is correct |
10 |
Correct |
10 ms |
1104 KB |
Output is correct |
11 |
Correct |
10 ms |
1100 KB |
Output is correct |
12 |
Correct |
9 ms |
1104 KB |
Output is correct |
13 |
Correct |
12 ms |
1360 KB |
Output is correct |
14 |
Correct |
8 ms |
1104 KB |
Output is correct |
15 |
Correct |
11 ms |
1104 KB |
Output is correct |
16 |
Correct |
17 ms |
2816 KB |
Output is correct |
17 |
Correct |
10 ms |
1104 KB |
Output is correct |
18 |
Correct |
8 ms |
1244 KB |
Output is correct |
19 |
Correct |
1 ms |
336 KB |
Output is correct |
20 |
Correct |
1 ms |
336 KB |
Output is correct |
21 |
Correct |
1 ms |
336 KB |
Output is correct |
22 |
Correct |
1 ms |
336 KB |
Output is correct |
23 |
Correct |
1 ms |
336 KB |
Output is correct |
24 |
Correct |
1 ms |
336 KB |
Output is correct |
25 |
Correct |
1 ms |
336 KB |
Output is correct |
26 |
Correct |
1 ms |
336 KB |
Output is correct |
27 |
Correct |
1 ms |
336 KB |
Output is correct |
28 |
Correct |
1 ms |
336 KB |
Output is correct |
29 |
Correct |
1 ms |
336 KB |
Output is correct |
30 |
Correct |
1 ms |
336 KB |
Output is correct |
31 |
Correct |
1 ms |
508 KB |
Output is correct |
32 |
Correct |
1 ms |
336 KB |
Output is correct |
33 |
Correct |
1 ms |
504 KB |
Output is correct |