| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 1013790 |
2024-07-04T05:55:02 Z |
vjudge1 |
Martian DNA (BOI18_dna) |
C++17 |
|
2000 ms |
7764 KB |
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
using namespace std;
const int N = 2e5+5, INF = 1e9;
int n, k, rr;
int a[N];
int q[N];
int cur[N];
int main()
{
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
cin >> n >> k >> rr;
for (int i = 1; i <= n; cin >> a[i++]);
for (int i = 1, b; i <= rr; cin >> b >> q[b], i++);
int sat = (q[a[1]] && ++cur[a[1]] == q[a[1]]);
int l = 1, r = 1;
int sol = INF;
while (r <= n) {
cerr << sat << ": " << l << ' ' << r << endl;
if (sat == rr && l <= r) {
sol = min(sol, r-l+1);
if (q[a[l]] && cur[a[l]] == q[a[l]]) sat--;
cur[a[l]]--;
l++;
} else {
r++;
cur[a[r]]++;
if (q[a[r]] && cur[a[r]] == q[a[r]]) sat++;
}
if (r == n) break;
}
while (l <= n && sat == rr) {
sol = min(sol, r-l+1);
if (q[a[l]] && cur[a[l]] == q[a[l]]) break;
cur[a[l]]--;
l++;
}
cout << (sol == INF ? "impossible" : to_string(sol));
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
1 ms |
388 KB |
Output is correct |
| 3 |
Correct |
1 ms |
344 KB |
Output is correct |
| 4 |
Correct |
1 ms |
348 KB |
Output is correct |
| 5 |
Correct |
1 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
1 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
42 ms |
348 KB |
Output is correct |
| 2 |
Correct |
34 ms |
344 KB |
Output is correct |
| 3 |
Correct |
32 ms |
552 KB |
Output is correct |
| 4 |
Correct |
76 ms |
348 KB |
Output is correct |
| 5 |
Correct |
33 ms |
344 KB |
Output is correct |
| 6 |
Correct |
56 ms |
348 KB |
Output is correct |
| 7 |
Correct |
1 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 ms |
348 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 |
2 ms |
472 KB |
Output is correct |
| 14 |
Correct |
1 ms |
344 KB |
Output is correct |
| 15 |
Correct |
2 ms |
344 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1904 ms |
5368 KB |
Output is correct |
| 2 |
Execution timed out |
2054 ms |
6228 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1959 ms |
7764 KB |
Output is correct |
| 2 |
Execution timed out |
2045 ms |
7752 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
