답안 #927100

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
927100	2024-02-14T09:24:08 Z	vjudge1	Martian DNA (BOI18_dna)	C++17	68 / 100	2000 ms	2652 KB

dna

#include<bits/stdc++.h>

using namespace std;

const int N = (int)2e5+3;
const int MOD = (int)1e6+3;

int n, k, r, a[N], c[N], cnt[N];
int b[11];

int main() {
    ios_base::sync_with_stdio(NULL);
    cin.tie(0);
	cin >> n >> k >> r;
	for(int i = 1; i <= n; ++i) {
		cin >> a[i];
	} 
	for(int i = 1; i <= r; ++i) {
		int x, y;
		cin >> x >> y;
		c[x]=y;
		b[i]=x;
	}
	int j = 1;
	int ans = n+1;
	for(int i = 1; i <= n; ++i) {
		cnt[a[i]]++;
		while(j<=i && cnt[a[j]]-1>=c[a[j]]) {
			cnt[a[j]]--;
			j++;
		}	
		bool ok = 1;
		for(int x = 1; x <= r && ok; ++x) {
			ok &= (cnt[b[x]]>=c[b[x]]);
		}
		if(ok) {
			ans = min(ans, i-j+1);
		}
	}
	if(ans == n+1) {
		cout << "impossible";
		return 0;
	}
	cout << ans;
    return 0;
}

Subtask #1

16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	1 ms	2392 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	0 ms	2396 KB	Output is correct
7	Correct	1 ms	2644 KB	Output is correct
8	Correct	1 ms	2392 KB	Output is correct
9	Correct	1 ms	2648 KB	Output is correct

Subtask #2

24.0 / 24.0

#	결과	실행 시간	메모리	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	1 ms	2392 KB	Output is correct
5	Correct	1 ms	2392 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	1 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2512 KB	Output is correct
14	Correct	0 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct

Subtask #3

28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	2396 KB	Output is correct
2	Correct	11 ms	2512 KB	Output is correct
3	Correct	11 ms	2392 KB	Output is correct
4	Correct	10 ms	2396 KB	Output is correct
5	Correct	13 ms	2652 KB	Output is correct
6	Correct	9 ms	2516 KB	Output is correct
7	Correct	10 ms	2392 KB	Output is correct
8	Correct	14 ms	2652 KB	Output is correct
9	Correct	16 ms	2652 KB	Output is correct
10	Correct	12 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	2396 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	0 ms	2396 KB	Output is correct
19	Correct	1 ms	2392 KB	Output is correct
20	Correct	0 ms	2396 KB	Output is correct
21	Correct	0 ms	2396 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	2392 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct

Subtask #4

0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	2041 ms	2652 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-