Submission #462398

#	Time	Username	Problem	Language	Result	Execution time	Memory
462398		_Avocado_	Martian DNA (BOI18_dna)	C++14	0 / 100	93 ms	9904 KiB

dna

#include <bits/stdc++.h>
#define int int64_t
using namespace std;

signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int n, k, q; cin>>n>>k>>q;
	
	vector<int>v(n);
	
	for(auto&u: v) cin>>u;
	
	vector<int>goal(k);
	
	for(int i = 0; i<q; ++i){
		int a, b; cin>>a>>b;
		goal[a] = b;
	}
	
	int ans = 1e9;
	int start = 0;
	
	vector<int>cur(k);
	map<int, int>full;
	
	for(int i = 0; i<n; ++i){
		if(full.size() == q) ans = min(ans, i-start);
		++cur[v[i]];
		if(cur[v[i]] > goal[v[i]] && v[start] == v[i]){
			++start;
			--cur[v[start]];
		}
		if(cur[v[i]] >= goal[v[i]] && goal[v[i]] != 0) full[v[i]] = 1; 
	} 
	
	
	if(ans == 1e9) cout<<"impossible";
	else cout<<ans;

	
	
	cout<<'\n';
}

Compilation message (stderr)

dna.cpp: In function 'int main()':
dna.cpp:29:18: warning: comparison of integer expressions of different signedness: 'std::map<long int, long int>::size_type' {aka 'long unsigned int'} and 'int64_t' {aka 'long int'} [-Wsign-compare]
   29 |   if(full.size() == q) ans = min(ans, i-start);
      |      ~~~~~~~~~~~~^~~~

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