oj.uz

Submission #116918

# Submission time Handle Problem Language Result Execution time Memory
116918 2019-06-14T04:22:09 Z nhimnam120 Doktor (COCI17_doktor) C++14
30 / 100
 257 ms 46456 KB 
#include<bits/stdc++.h>
using namespace std;
long long fixedd[500005];
long long a[500005];
vector<long long> tam1[500005];
vector<long long> tam2[500005];
long long ans1,ans2;
signed main(){
	ios_base::sync_with_stdio(0);
	long long n;
	cin >> n;
	for(long long i=1;i<=n;i++){
		cin >> a[i];
		fixedd[i]=fixedd[i-1];
		if(a[i]==i){
			fixedd[i]++;
		}
		if((a[i]+i)%2==0){
			tam1[(a[i]+i)/2].push_back(abs(a[i]-i)/2);
		}
		else{
			tam2[(a[i]+i)/2].push_back(abs(a[i]-i)/2);
		}
	}
	ans1 = a[1];
	ans2 = a[1];
	long long mdx= -1000;
	for(long long i=1;i<=n;i++){
		if(tam1[i].size()==0){
			continue;
		}
		sort(tam1[i].begin(),tam1[i].end());
		for(long long j = tam1[i].size()-1;j>=0;j--){
			if(mdx < (j + 1 - (fixedd[i+tam1[i][j]] - fixedd[i - tam1[i][j] - 1]))){
				mdx = j + 1 - (fixedd[i+tam1[i][j]] - fixedd[i - tam1[i][j] - 1]);
				ans1 = a[i-tam1[i][j]];
				ans2 = a[i+tam1[i][j]];
			}
		}
	}
	for(long long i=0;i<n;i++){
		if(tam2[i].size()==0){
			continue;
		}
		for(long long j=tam2[i].size()-1;j>=0;j--){
			if(mdx < j + 1 - ( fixedd[ i + tam2[i][j] ] - fixedd[ i - tam2[i][j] ] ) ){
				mdx = j + 1 - ( fixedd[ i + tam2[i][j] ] - fixedd[ i - tam2[i][j] ] );
				ans1 = a[i-tam2[i][j]+1];
				ans2 = a[i+tam2[i][j]];
			}
		}
	}
	cout << ans1 << " " << ans2;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 21 ms 23800 KB Output isn't correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 23808 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 23808 KB Output is correct
2 Incorrect 21 ms 23928 KB Output isn't correct

Subtask #4
0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 24064 KB Output is correct
2 Correct 22 ms 23944 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 24088 KB Output is correct
2 Incorrect 21 ms 23812 KB Output isn't correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 24312 KB Output is correct
2 Incorrect 59 ms 32364 KB Output isn't correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 27384 KB Output is correct
2 Incorrect 33 ms 26336 KB Output isn't correct

Subtask #9
0 / 10.0

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

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 150 ms 35160 KB Output is correct
2 Correct 108 ms 46456 KB Output is correct