제출 #473203

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
473203		_L__	Doktor (COCI17_doktor)	C++17	0 / 100	404 ms	21052 KiB

doktor

// This code is written by _L__
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define F_word ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
typedef long long ll;
typedef long double ld;
const int mod = 1e9+7, N = 2e5+13, inf = 1e9+1;
const ld E = 1e-6;
#define ff first
#define ss second

int main(void){
    F_word;
    int n; cin >> n;
    int a[n+2] = {}, doc[n+4] = {}; for(int i = 1; i <= n; ++i){cin >> a[i]; doc[a[i]] = a[i]-i;}
    map<int, int> freq_odd, freq_even;
    for(int i = 1; i <= n; ++i)
        if(!(doc[a[i]]%2))
            freq_odd[i+(doc[a[i]]/2)]++;
    for(int i = 1; i <= n; ++i)
        if(doc[a[i]]%2)
            freq_even[i+(doc[a[i]]/2)-1]++;
    ll ans_odd = 0, tar = 0, ans_even = 0;
    for(auto u: freq_odd)
        if(u.ss >= tar)
            {tar = u.ss, ans_odd = u.ff;}
    tar = 0;
    for(auto u: freq_even)
        if(u.ss >= tar)
            {tar = u.ss, ans_even = u.ff;}
    ll a_1 = ans_odd, a_2 = ans_odd, a_3 = ans_even, a_4 = ans_even+1; int i = a_1, j = a_2;
    while(i > 0 && j <= n){
        if(a[i] == i+ans_odd){a_1 = i, a_2 = j;}
        if(a[j] == j-ans_odd){a_1 = i, a_2 = j;}
        --i; ++j;
    }
    i = a_3, j = a_4;
    while(i > 0 && j <= n){
        if(a[i] == ans_even+((ans_even-i)*2)){a_3 = i, a_4 = j;}
        if(a[j] == (j-(ans_even+1))*2+ans_even+1){a_3 = i, a_4 = j;}
        ++j, --i;
    }
    if(a_3 == 0 || a_4 == 0){a_3 = 0; a_4 = 0;}
    ll sum1 = 0, sum2 = 0;
    reverse(a+a_1, a+a_2+1);
    for(int i = 1; i <= n; ++i) sum1 += (a[i] == i);
    reverse(a+a_1, a+a_2+1);
    reverse(a+a_3, a+a_4+1);
    for(int i = 1; i <= n; ++i) sum2 += (a[i] == i);
    reverse(a+a_3, a+a_4+1);
    if(sum1 >= sum2) cout << a[a_1] << ' ' << a[a_2] << endl;
    else cout << a[a_3] << ' ' << a[a_4] << endl;
} 

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10