#include <bits/stdc++.h>
using namespace std;
int n, k, r, req[300010], amt[300010], qu, ans = 1e9, p1 = 0, p2 = 0;
vector<int> dna;
void add(int type) {
if(req[type] == 0) return;
if(req[type] == amt[type]+1) {
qu++;
}
amt[type]++;
}
void del(int type) {
if(req[type] == 0) return;
if(req[type] == amt[type]) {
qu--;
}
amt[type]--;
}
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n >> k >> r;
for(int i=1; i<=n; i++) {
int in;
cin >> in;
dna.push_back(in);
}
for(int i=1; i<=r; i++) {
int b, q;
cin >> b >> q;
req[b] = q;
}
while(p2 < n) {
if(qu == r) {
ans = min(ans, p2-p1);
del(dna[p1]);
p1++;
} else {
add(dna[p2]);
p2++;
}
}
if(ans == 1e9) {
cout << "impossible";
} else {
cout << ans;
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
2384 KB |
Output is correct |
2 |
Correct |
1 ms |
2384 KB |
Output is correct |
3 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
2384 KB |
Output is correct |
2 |
Correct |
1 ms |
2384 KB |
Output is correct |
3 |
Correct |
1 ms |
2384 KB |
Output is correct |
4 |
Correct |
1 ms |
2384 KB |
Output is correct |
5 |
Correct |
1 ms |
2384 KB |
Output is correct |
6 |
Correct |
1 ms |
2384 KB |
Output is correct |
7 |
Correct |
1 ms |
2384 KB |
Output is correct |
8 |
Correct |
1 ms |
2384 KB |
Output is correct |
9 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
10 ms |
3276 KB |
Output is correct |
2 |
Correct |
11 ms |
3260 KB |
Output is correct |
3 |
Correct |
12 ms |
3276 KB |
Output is correct |
4 |
Correct |
10 ms |
3276 KB |
Output is correct |
5 |
Correct |
12 ms |
3276 KB |
Output is correct |
6 |
Incorrect |
10 ms |
3408 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
21 ms |
3532 KB |
Output is correct |
2 |
Correct |
18 ms |
3544 KB |
Output is correct |
3 |
Correct |
16 ms |
3532 KB |
Output is correct |
4 |
Correct |
11 ms |
3276 KB |
Output is correct |
5 |
Correct |
24 ms |
3572 KB |
Output is correct |
6 |
Correct |
25 ms |
4044 KB |
Output is correct |
7 |
Correct |
14 ms |
4300 KB |
Output is correct |
8 |
Correct |
17 ms |
4556 KB |
Output is correct |
9 |
Correct |
11 ms |
3788 KB |
Output is correct |
10 |
Correct |
12 ms |
3788 KB |
Output is correct |
11 |
Correct |
15 ms |
3788 KB |
Output is correct |
12 |
Correct |
12 ms |
3804 KB |
Output is correct |
13 |
Correct |
15 ms |
4556 KB |
Output is correct |
14 |
Incorrect |
10 ms |
3788 KB |
Output isn't correct |
15 |
Halted |
0 ms |
0 KB |
- |