Submission #1013779

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1013779	2024-07-04T05:46:02 Z	vjudge1	Martian DNA (BOI18_dna)	C++17	0 / 100	2000 ms	9044 KB

dna

#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));
}

Subtask #1

0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	2396 KB	Output is correct
2	Correct	2 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	2 ms	2420 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	0 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Incorrect	1 ms	2396 KB	Output isn't correct
9	Halted	0 ms	0 KB	-

Subtask #2

0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	46 ms	2560 KB	Output is correct
2	Correct	33 ms	2396 KB	Output is correct
3	Correct	32 ms	2648 KB	Output is correct
4	Correct	41 ms	2396 KB	Output is correct
5	Correct	33 ms	2544 KB	Output is correct
6	Correct	43 ms	2392 KB	Output is correct
7	Correct	2 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	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2512 KB	Output is correct
12	Correct	1 ms	2392 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Incorrect	1 ms	2396 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #3

0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1789 ms	6672 KB	Output is correct
2	Correct	1981 ms	7844 KB	Output is correct
3	Execution timed out	2009 ms	8240 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-

Subtask #4

0 / 32.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1951 ms	8532 KB	Output is correct
2	Correct	1961 ms	9044 KB	Output is correct
3	Correct	1954 ms	9016 KB	Output is correct
4	Execution timed out	2045 ms	8276 KB	Time limit exceeded
5	Halted	0 ms	0 KB	-