oj.uz

Submission #116827

# Submission time Handle Problem Language Result Execution time Memory
116827 2019-06-14T01:54:40 Z minhcool Doktor (COCI17_doktor) C++17
40 / 100
 148 ms 34832 KB 
#include<bits/stdc++.h>
using namespace std;

#define int long long
int n, a[500001], pre[500001], mx = -1, ans1, ans2;
vector<int> change[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) continue;
        change[(a[i] + i) / 2].push_back(abs(a[i] - i) / 2);
    }
    for(int i = 1; i <= n; i++){
        if(!change[i].size()) 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]];
            }
        }
    }
    cout << ans1 << " " << ans2;
}

Subtask #1
0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 12032 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 12032 KB Output is correct
2 Incorrect 11 ms 12160 KB Output isn't correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 12160 KB Output is correct
2 Correct 12 ms 12160 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12160 KB Output is correct
2 Correct 12 ms 12160 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12288 KB Output is correct
2 Incorrect 12 ms 12132 KB Output isn't correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 12416 KB Output is correct
2 Incorrect 42 ms 16736 KB Integer 0 violates the range [1, 300000]

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 14496 KB Output is correct
2 Incorrect 21 ms 13696 KB Integer 0 violates the range [1, 100000]

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 148 ms 25636 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 86 ms 20068 KB Output is correct
2 Correct 97 ms 34832 KB Output is correct