oj.uz

Submission #526292

# Submission time Handle Problem Language Result Execution time Memory
526292 2022-02-14T08:01:18 Z bebecanvas Martian DNA (BOI18_dna) C++14
0 / 100
 66 ms 7144 KB 
#include <bits/stdc++.h>

using namespace std;
#define int long long
#define endl '\n'
#define sz(x) (int) (x).size()

signed main(){
 
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    
	int n, k, r; cin >> n >> k >> r;
	int v[200005]={0};
	int arr[200005];
	for(int i=0; i<n; i++){cin >> arr[i];}
	//for(int i=0; i<k; i++){v[i]= 1;}
	for(int i=0; i<r; i++){
		int a, b; cin >> a >> b;
		v[a]= b;
	}
	
	int s= 1;
	int e= n;
	bool yeaa= false;
	while(s<e){
		int mid= s+ (e-s)/2;
		int c[200005]={0};
		int count= 0;
		for(int i=0; i<mid; i++){
			c[arr[i]]++;
			if(c[arr[i]]==v[arr[i]]){count++;}
		}
		bool yea= false;
		if(count==r){yea= true;}
		for(int i=0; i<n- mid; i++){
			if(count==r){yea= true; yeaa= true; break;}
			c[arr[i]]--; 
			if(c[arr[i]]==v[arr[i]]-1){count--;}
			c[arr[i+mid]]++; 
			if(c[arr[i+mid]]==v[arr[i+mid]]){count++;}
		}
		if(count==r){yea= true; yeaa= true;}
		if(yea){e= mid;}
		else{s= mid+1;}
	}
	
	if(yeaa){cout << e << endl;}
	else{cout << "impossible" << endl;}
	
	
}

Subtask #1
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4940 KB Output is correct
2 Correct 4 ms 4940 KB Output is correct
3 Incorrect 4 ms 4940 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 4 ms 4940 KB Output is correct
4 Correct 5 ms 5012 KB Output is correct
5 Correct 3 ms 5016 KB Output is correct
6 Correct 4 ms 4992 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Incorrect 3 ms 5000 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 5004 KB Output is correct
2 Correct 24 ms 4992 KB Output is correct
3 Correct 17 ms 4996 KB Output is correct
4 Correct 23 ms 4940 KB Output is correct
5 Correct 31 ms 4984 KB Output is correct
6 Incorrect 22 ms 5252 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 4940 KB Output is correct
2 Correct 40 ms 6540 KB Output is correct
3 Correct 45 ms 6256 KB Output is correct
4 Correct 14 ms 5316 KB Output is correct
5 Correct 56 ms 7144 KB Output is correct
6 Correct 66 ms 7056 KB Output is correct
7 Correct 30 ms 5908 KB Output is correct
8 Correct 48 ms 6156 KB Output is correct
9 Correct 26 ms 5260 KB Output is correct
10 Correct 25 ms 5324 KB Output is correct
11 Correct 19 ms 5516 KB Output is correct
12 Correct 27 ms 5372 KB Output is correct
13 Correct 31 ms 6120 KB Output is correct
14 Incorrect 21 ms 5380 KB Output isn't correct
15 Halted 0 ms 0 KB -