oj.uz

Submission #521452

# Submission time Handle Problem Language Result Execution time Memory
521452 2022-02-02T07:21:44 Z Rasoul006 Doktor (COCI17_doktor) C++17
10 / 100
 1000 ms 3660 KB 
#include <bits/stdc++.h>

#define endl "\n"

typedef long long ll;

using namespace std;

const int N = 1e6+5;
ll n , a[200009] , pre[200009] ;
map < ll , ll > mp ;
int main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n ;
    for(int i = 1 ; i <= n ; i++){
        cin >> a[i] ;
        if(a[i] == i){
            pre[i]++ ;
        }
    }
    for(int i = 1 ;i <= n ;i++){
        pre[i] += pre[i-1] ;
    }
    ll mx = 0 ;
    pair < ll , ll > best=  {0 , 0} ;
    for(ll i = 1 ; i <= n ; i++){
        ll l = min(i , a[i]) , r = max(i , a[i]) ;
        ll q = pre[l - 1] + (pre[n] - pre[r]) ;
//        cout << l << " " << r << " " ;
//        cout << pre[a[i] - 1] << " " << pre[n] - pre[r]<< endl ;
        while(r > l){
            q += (a[r] == l) + (a[l] == r) ;
            l++ , r-- ;
        }
        if(l == r){
            q += (a[r] == r) ;
        }
        if(q >= mx){
            mx = q ;
            best = {max(a[i]  , i) , min(i , a[i])} ;
        }
    }
    cout << best.first << " "  << best.second ;
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Failed 0 ms 320 KB Checker failed - contact admins or jury
3 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 332 KB Output is correct
2 Incorrect 1 ms 332 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1057 ms 1612 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 18 ms 3532 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 20 ms 3660 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -