Submission #453776

#	Time	Username	Problem	Language	Result	Execution time	Memory
453776		Hamed5001	Martian DNA (BOI18_dna)	C++14	100 / 100	49 ms	1900 KiB

dna

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int mxN = 2e5+10;
int N, K, R;

void solve() {
	cin >> N >> K >> R;
	vector<int> DNA(N), need(K, INT_MAX);

	for (auto& dna : DNA) 
		cin >> dna;

	for (int i = 0; i < R; i++) {
		int B, Q;
		cin >> B >> Q;
		need[B] = Q; 
	}

	int ans = INT_MAX;
	int good = 0;
	
	for (int l = 0, r = 0; l < N; l++) {
		while(good < R && r < N)
			if (--need[DNA[r++]] == 0)
				++good;

		if (good == R)
			ans = min(ans, r - l);

		if (++need[DNA[l]] == 1)
			--good;
	}

	cout << (ans == INT_MAX ? "impossible" : to_string(ans));
}	

int main() {

	ios_base::sync_with_stdio(false);
	cin.tie(0);
	solve();
}

• Subtask 1: 16 / 16
• Subtask 2: 24 / 24
• Subtask 3: 28 / 28
• Subtask 4: 32 / 32