Submission #1013753

# Submission time Handle Problem Language Result Execution time Memory
1013753 2024-07-04T05:31:23 Z vjudge1 Martian DNA (BOI18_dna) C++17
0 / 100
21 ms 4800 KB
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
using namespace std;

const int N = 2e5+1, 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 (l <= r && r <= n) {
		//cerr << l << ' ' << r << endl;
		if ((sat == rr && l < r) || r == n) {
			if (sat == rr)
				sol = min(sol, r-l+1);
			cur[a[l]]--;
			if (q[a[l]] && cur[a[l]] == q[a[l]]-1) sat--;
			l++;
		} else {
			r++;
			cur[a[r]]++;
			if (q[a[r]] && cur[a[r]] == q[a[r]]) sat++;
		}
	}
	cout << (sol == INF ? "impossible" : to_string(sol));
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2440 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Incorrect 0 ms 2396 KB Output isn't correct
9 Halted 0 ms 0 KB -
# 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 0 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 0 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 0 ms 2396 KB Output is correct
14 Incorrect 0 ms 2396 KB Output isn't correct
15 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 7 ms 2396 KB Output is correct
2 Correct 8 ms 2396 KB Output is correct
3 Correct 9 ms 2392 KB Output is correct
4 Correct 8 ms 2392 KB Output is correct
5 Correct 11 ms 2768 KB Output is correct
6 Correct 7 ms 2396 KB Output is correct
7 Correct 8 ms 2396 KB Output is correct
8 Correct 12 ms 2648 KB Output is correct
9 Correct 9 ms 2652 KB Output is correct
10 Correct 8 ms 2396 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 2392 KB Output is correct
17 Correct 0 ms 2392 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 0 ms 2396 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct
22 Correct 0 ms 2392 KB Output is correct
23 Correct 0 ms 2396 KB Output is correct
24 Incorrect 0 ms 2396 KB Output isn't correct
25 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 17 ms 2652 KB Output is correct
2 Correct 15 ms 2768 KB Output is correct
3 Correct 14 ms 2772 KB Output is correct
4 Correct 8 ms 2392 KB Output is correct
5 Correct 19 ms 4800 KB Output is correct
6 Correct 21 ms 4680 KB Output is correct
7 Correct 10 ms 3420 KB Output is correct
8 Correct 12 ms 3676 KB Output is correct
9 Correct 7 ms 2908 KB Output is correct
10 Correct 10 ms 2888 KB Output is correct
11 Correct 9 ms 3040 KB Output is correct
12 Correct 11 ms 2872 KB Output is correct
13 Correct 11 ms 3908 KB Output is correct
14 Correct 7 ms 2904 KB Output is correct
15 Correct 9 ms 3164 KB Output is correct
16 Correct 13 ms 3932 KB Output is correct
17 Correct 10 ms 3416 KB Output is correct
18 Correct 9 ms 2908 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2392 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 0 ms 2396 KB Output is correct
26 Correct 0 ms 2396 KB Output is correct
27 Correct 0 ms 2396 KB Output is correct
28 Correct 0 ms 2396 KB Output is correct
29 Correct 1 ms 2392 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Incorrect 1 ms 2392 KB Output isn't correct
33 Halted 0 ms 0 KB -