oj.uz

Submission #927099

# Submission time Handle Problem Language Result Execution time Memory
927099 2024-02-14T09:21:16 Z vjudge1 Martian DNA (BOI18_dna) C++17
0 / 100
 2000 ms 2648 KB 
#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]]) {
			j++;
			cnt[a[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
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2392 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2068 ms 2648 KB Time limit exceeded
2 Halted 0 ms 0 KB -