oj.uz

Submission #97828

# Submission time Handle Problem Language Result Execution time Memory
97828 2019-02-18T18:39:20 Z dalgerok Doktor (COCI17_doktor) C++17
30 / 100
 320 ms 42700 KB 
#include<bits/stdc++.h>
using namespace std;


const int N = 5e5 + 5;


int n, a[N], pref[N];
vector < pair < int, int > > q[2 * N];


int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
        pref[i] = pref[i - 1] + (a[i] == i);
        int l = i, r = a[i];
        if(l > r){
            swap(l, r);
        }
        q[l + r].push_back(make_pair(l, r));
    }
    pair < int, pair < int, int > > ans = make_pair(pref[n], make_pair(1, 1));
    for(int i = 1; i <= 2 * n; i++){
        if(q[i].empty()){
            continue;
        }
        for(int j = 0; j < (int)q[i].size(); j++){
            int l = q[i][j].first,
                r = q[i][j].second;
            int val = j + 1 + pref[n] - (pref[r] - pref[l - 1]);
            ans = max(ans, make_pair(val, q[i][j]));
        }
    }
    cout << a[ans.second.first] << " " << a[ans.second.second];
}

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 25 ms 23928 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 24 ms 24084 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 24 ms 23976 KB Output is correct
2 Correct 23 ms 23908 KB Output is correct

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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