oj.uz

Submission #116908

# Submission time Handle Problem Language Result Execution time Memory
116908 2019-06-14T04:12:08 Z nhimnam120 Doktor (COCI17_doktor) C++14
100 / 100
 277 ms 42780 KB 
#include<bits/stdc++.h>
using namespace std;
int n, a[500001], pre[500001], mx, ans1, ans2;
vector<int> change[500001];
vector<int> change2[500001];
 
signed main(){
    ios_base::sync_with_stdio(0);
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
        pre[i] = pre[i - 1];
        if(a[i] == i) pre[i]++;
        if((a[i] + i) % 2 == 0) change[(a[i] + i) / 2].push_back(abs(a[i] - i) / 2);
        else change2[(a[i] + i) / 2].push_back(abs(a[i] - i) / 2);
    }
    ans1 = ans2 = a[1];
    for(int i = 1; i <= n; i++){
        if(change[i].size()==0) continue;
        sort(change[i].begin(), change[i].end());
        for(int j = change[i].size() - 1; j >= 0; j--){
            if(mx < (j + 1 - pre[change[i][j] + i] + pre[i - change[i][j] - 1])){
                mx = j + 1 - pre[change[i][j] + i] + pre[i - change[i][j] - 1];
                ans1 = a[i - change[i][j]];
                ans2 = a[i + change[i][j]];
            }
        }
    }
    for(int i = 1; i < n; i++){
        if(!change2[i].size()) continue;
        sort(change2[i].begin(), change2[i].end());
        for(int j = change2[i].size() - 1; j >= 0; j--){
            if(mx < (j + 1 - pre[change2[i][j] + i + 1] + pre[i - change2[i][j] - 1])){
                mx = j + 1 - pre[change2[i][j] + i + 1] + pre[i - change2[i][j] - 1];
                ans1 = a[i - change2[i][j]];
                ans2 = a[i + change2[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 23 ms 23808 KB Output is correct

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23908 KB Output is correct
2 Correct 24 ms 23928 KB Output is correct

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 24192 KB Output is correct
2 Correct 83 ms 28016 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 26616 KB Output is correct
2 Correct 42 ms 25204 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 277 ms 39064 KB Output is correct
2 Correct 119 ms 29800 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 144 ms 32760 KB Output is correct
2 Correct 119 ms 42780 KB Output is correct