| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 927102 |
2024-02-14T09:26:48 Z |
vjudge1 |
Martian DNA (BOI18_dna) |
C++17 |
|
24 ms |
3056 KB |
#include<bits/stdc++.h>
using namespace std;
const int N = (int)2e5+3;
const int MOD = (int)1e6+3;
int n, k, r, a[N], c[N], cnt[N];
int b[11];
int main() {
ios_base::sync_with_stdio(NULL);
cin.tie(0);
cin >> n >> k >> r;
for(int i = 1; i <= n; ++i) {
cin >> a[i];
}
for(int i = 1; i <= r; ++i) {
int x, y;
cin >> x >> y;
c[x]=y;
b[i]=x;
}
int j = 1;
int ans = n+1, kol = 0;
for(int i = 1; i <= n; ++i) {
cnt[a[i]]++;
if(cnt[a[i]] == c[a[i]] && c[a[i]] != 0) {
kol++;
}
while(j<=i && cnt[a[j]]-1>=c[a[j]]) {
cnt[a[j]]--;
j++;
}
if(kol == r) {
ans = min(ans, i-j+1);
}
}
if(ans == n+1) {
cout << "impossible";
return 0;
}
cout << ans;
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 3 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 4 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 5 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 6 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 7 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 8 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 9 |
Correct |
1 ms |
2396 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 3 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 4 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 5 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 6 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 7 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 8 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 9 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 10 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 11 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 12 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 13 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 14 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 15 |
Correct |
0 ms |
2396 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
2396 KB |
Output is correct |
| 2 |
Correct |
9 ms |
2520 KB |
Output is correct |
| 3 |
Correct |
10 ms |
2396 KB |
Output is correct |
| 4 |
Correct |
9 ms |
2396 KB |
Output is correct |
| 5 |
Correct |
17 ms |
2772 KB |
Output is correct |
| 6 |
Correct |
9 ms |
2516 KB |
Output is correct |
| 7 |
Correct |
10 ms |
2512 KB |
Output is correct |
| 8 |
Correct |
13 ms |
2648 KB |
Output is correct |
| 9 |
Correct |
11 ms |
2652 KB |
Output is correct |
| 10 |
Correct |
8 ms |
2512 KB |
Output is correct |
| 11 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 12 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 13 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 14 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 15 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 16 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 17 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 18 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 19 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 20 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 21 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 22 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 23 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 24 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 25 |
Correct |
1 ms |
2396 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
24 ms |
3056 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
