oj.uz

Submission #462504

# Submission time Handle Problem Language Result Execution time Memory
462504 2021-08-10T16:27:19 Z _Avocado_ Martian DNA (BOI18_dna) C++14
100 / 100
 95 ms 12272 KB 
#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;
	}
	
	//for(auto u: goal) cout<<u<<" ";
	//cout<<endl;
	
	int ans = 1e9;
	int start = 0;
	
	vector<int>cur(k);
	map<int, int>full;
	
	for(int i = 0; i<n; ++i){
		++cur[v[i]];
		while(cur[v[start]] > goal[v[start]] || !goal[v[start]]){
			if(cur[v[start]] > goal[v[start]]){
				--cur[v[start]];
				++start;
			}
			else if(!goal[v[start]]) ++start;
			else break;
			if(start == i) break;
			
			//cout<<start<<endl;
		}
		if(cur[v[i]] >= goal[v[i]] && goal[v[i]] != 0) full[v[i]] = 1; 
		if(full.size() == q) ans = min(ans, i-start+1);
		
	} 
	
	
	if(ans == 1e9) cout<<"impossible";
	else cout<<ans;

	
	
	cout<<'\n';
}

Compilation message

dna.cpp: In function 'int main()':
dna.cpp:45: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]
   45 |   if(full.size() == q) ans = min(ans, i-start+1);
      |      ~~~~~~~~~~~~^~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 312 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 2264 KB Output is correct
2 Correct 19 ms 2260 KB Output is correct
3 Correct 20 ms 2252 KB Output is correct
4 Correct 20 ms 2252 KB Output is correct
5 Correct 23 ms 4180 KB Output is correct
6 Correct 18 ms 2252 KB Output is correct
7 Correct 19 ms 2460 KB Output is correct
8 Correct 27 ms 6192 KB Output is correct
9 Correct 21 ms 2904 KB Output is correct
10 Correct 20 ms 2256 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 9712 KB Output is correct
2 Correct 82 ms 7872 KB Output is correct
3 Correct 41 ms 5304 KB Output is correct
4 Correct 17 ms 2252 KB Output is correct
5 Correct 41 ms 4804 KB Output is correct
6 Correct 95 ms 12272 KB Output is correct
7 Correct 39 ms 3468 KB Output is correct
8 Correct 51 ms 4292 KB Output is correct
9 Correct 18 ms 2252 KB Output is correct
10 Correct 22 ms 2252 KB Output is correct
11 Correct 24 ms 2260 KB Output is correct
12 Correct 21 ms 2252 KB Output is correct
13 Correct 24 ms 4156 KB Output is correct
14 Correct 17 ms 2256 KB Output is correct
15 Correct 19 ms 2380 KB Output is correct
16 Correct 26 ms 6212 KB Output is correct
17 Correct 21 ms 2908 KB Output is correct
18 Correct 23 ms 2264 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 328 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct