Submission #1013831

# Submission time Handle Problem Language Result Execution time Memory
1013831 2024-07-04T06:41:43 Z Muaath_5 Martian DNA (BOI18_dna) C++17
100 / 100
24 ms 4488 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 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 464 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 476 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 7 ms 1456 KB Output is correct
2 Correct 8 ms 1636 KB Output is correct
3 Correct 9 ms 1544 KB Output is correct
4 Correct 8 ms 1628 KB Output is correct
5 Correct 11 ms 2648 KB Output is correct
6 Correct 7 ms 1628 KB Output is correct
7 Correct 9 ms 1660 KB Output is correct
8 Correct 17 ms 3164 KB Output is correct
9 Correct 10 ms 2140 KB Output is correct
10 Correct 8 ms 1640 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 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 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 0 ms 468 KB Output is correct
21 Correct 0 ms 600 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 18 ms 3420 KB Output is correct
2 Correct 16 ms 3224 KB Output is correct
3 Correct 14 ms 2908 KB Output is correct
4 Correct 8 ms 1512 KB Output is correct
5 Correct 20 ms 3924 KB Output is correct
6 Correct 24 ms 4488 KB Output is correct
7 Correct 14 ms 2136 KB Output is correct
8 Correct 18 ms 2496 KB Output is correct
9 Correct 8 ms 1620 KB Output is correct
10 Correct 8 ms 1628 KB Output is correct
11 Correct 9 ms 1628 KB Output is correct
12 Correct 8 ms 1628 KB Output is correct
13 Correct 11 ms 2524 KB Output is correct
14 Correct 9 ms 1628 KB Output is correct
15 Correct 8 ms 1628 KB Output is correct
16 Correct 15 ms 3228 KB Output is correct
17 Correct 14 ms 2204 KB Output is correct
18 Correct 8 ms 1628 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 472 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 468 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct