oj.uz

Submission #521466

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

#define endl "\n"

typedef long long ll;

using namespace std;

const int N = 1e6+5;
ll n , a[500009] , suf[500009] , pre[500009] ;
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]++ ;
            suf[i]++ ;
        }
    }
    for(int i = 1 ;i <= n ;i++){
        pre[i] += pre[i-1] ;
    }
    for(int i = n ;i >= 1 ; i--){
        suf[i] += suf[i + 1] ;
    }
    ll mx = pre[n] ;
    pair < ll , ll > best =  {1 , 1} ;
    for(ll i = 1 ; i <= n ; i++){
        ll l = min(a[i] , i) , r = max(i , a[i]) ;
        ll q = (pre[l - 1] + suf[r + 1]) ;
//           cout << i << " " << j << " "  << q << endl ;
//           cout << suf[r + 1] << " " << pre[l - 1] << endl ;
    //        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) ;
        }
//           cout << q << endl ;
        if(q >= mx){
            mx = q ;
            best = {min(a[i] , i) , max(a[i] , i)} ;
        }
    }
    cout << a[best.first] << " "  << a[best.second] ;
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 440 KB Output is correct
2 Correct 2 ms 332 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 572 KB Output is correct
2 Execution timed out 1059 ms 9176 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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