Submission #1013763

# Submission time Handle Problem Language Result Execution time Memory
1013763 2024-07-04T05:37:41 Z vjudge1 Martian DNA (BOI18_dna) C++17
0 / 100
20 ms 2900 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 << l << ' ' << r << endl;
		if (sat == rr && l < r) {
			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++;
		}
	}
	while (l <= n && sat) {
		sol = min(sol, r-l+1);
		cur[a[l]]--;
		if (q[a[l]] && cur[a[l]] == q[a[l]]-1) break;
		l++;
	}
	cout << (sol == INF ? "impossible" : to_string(sol));
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Incorrect 1 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -
# 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 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 348 KB Output is correct
8 Incorrect 0 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 9 ms 1116 KB Output is correct
2 Correct 10 ms 2396 KB Output is correct
3 Correct 8 ms 2396 KB Output is correct
4 Correct 7 ms 2512 KB Output is correct
5 Incorrect 10 ms 2652 KB Output isn't correct
6 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 18 ms 2772 KB Output is correct
2 Correct 15 ms 2632 KB Output is correct
3 Correct 14 ms 2772 KB Output is correct
4 Correct 8 ms 2520 KB Output is correct
5 Correct 18 ms 2628 KB Output is correct
6 Correct 20 ms 2900 KB Output is correct
7 Correct 15 ms 2564 KB Output is correct
8 Correct 10 ms 2520 KB Output is correct
9 Correct 6 ms 2396 KB Output is correct
10 Correct 7 ms 2628 KB Output is correct
11 Correct 9 ms 1192 KB Output is correct
12 Correct 10 ms 2516 KB Output is correct
13 Incorrect 13 ms 2772 KB Output isn't correct
14 Halted 0 ms 0 KB -