oj.uz

Submission #116919

# Submission time Handle Problem Language Result Execution time Memory
116919 2019-06-14T04:22:23 Z nhimnam120 Doktor (COCI17_doktor) C++14
100 / 100
 277 ms 46516 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 = 1; i < n; i++){
        if(!tam2[i].size()) continue;
        sort(tam2[i].begin(), tam2[i].end());
        for(long long j = tam2[i].size() - 1; j >= 0; j--){
            if(mdx < (j + 1 - fixedd[tam2[i][j] + i + 1] + fixedd[i - tam2[i][j] - 1])){
                mdx = j + 1 - fixedd[tam2[i][j] + i + 1] + fixedd[i - tam2[i][j] - 1];
                ans1 = a[i - tam2[i][j]];
                ans2 = a[i + tam2[i][j] + 1];
            }
        }
    }
    cout << ans1 << " " << ans2;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 23800 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 23808 KB Output is correct
2 Correct 21 ms 23932 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 24064 KB Output is correct
2 Correct 31 ms 23936 KB Output is correct

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 24212 KB Output is correct
2 Correct 90 ms 32200 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 27464 KB Output is correct
2 Correct 41 ms 26352 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 277 ms 43188 KB Output is correct
2 Correct 134 ms 35684 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 157 ms 35328 KB Output is correct
2 Correct 111 ms 46516 KB Output is correct