oj.uz

답안 #250497

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
250497 2020-07-18T08:30:40 Z leaked Doktor (COCI17_doktor) C++14
0 / 100
 136 ms 35512 KB 
#include<bits/stdc++.h>
using namespace std;
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
////
//    #pragma GCC optimize("unroll-loops")
//    #pragma GCC optimize("Ofast")
//    #pragma GCC optimize("-O3")
//    #pragma GCC optimize("no-stack-protector")
//    #pragma GCC optimize("fast-math")
//////#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cout << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cout << endl; }
eni(!=) cout << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
	*this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int>a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
//#define ull unsigned long long
typedef unsigned long long ull;
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define getfiles    ifstream cin("input.txt");ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (ll)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
#define len(a) (ll)a.size()
#define rep(x,l,r) for(ll x=l;x<r;x++)

//using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
ll inf = 1e18,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
void binary(ll val,int to) {for(int i=0;i<to;i++) cerr<<(pw(i) & val ? 1 : 0); cerr<<endl;}
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }
ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll R=1e4;
const ll tx[4]={1,0,-1,0};
const ll ty[4]={0,1,0,-1};
const char rev_to[4]={'E','W','N','S'};
const int N=5e5+1;
const int M=1e9+7;
//typedef tree<pii,null_type,less<pii>,rb_tree_tag,tree_order_statistics_node_update> st;
map<int,ll>dp[N];
int s[N];
pii pp[N][2];
signed main()
{
    fast_io;
//    freopen("in.txt","r",stdin);
//    freopen("out.txt","w",stdout);
    int n;
    cin>>n;
    vector<int>a(n);
    for(auto &z : a) cin>>z,z--;
    vector<int>p(n);
    for(int i=0;i<n;i++)p[a[i]]=i;
   // int ans=0;
    vector<pii>to[2];
    for(int i=0;i<n;i++){
        to[(i+p[i])%2].p_b({max(i,p[i])-(i+p[i])/2,(i+p[i])/2});
    }
    for(auto &z : to) sort(all(z));
    vector<int>pref(n,0);
    pref[0]=a[0]==0;
    for(int i=1;i<n;i++){
        pref[i]=pref[i-1];
        pref[i]+=a[i]==i;
    }
    int ans=pref[n-1];
    int pr=pref[n-1];
    pii a1={0,0};
    auto get=[&](int l,int r){
        return pref[r]-(l ? pref[l-1] : 0);
    };
    for(auto &g : to[0]){
        s[g.s]++;
        int got_it=pr+s[g.s]-get(g.s-g.f,g.s+g.f);
//        debug()<<imie(ans)<<imie(s[g.s])<<imie(g.s-g.f)<<imie(get(g.s-g.f,g.s+g.f))<<imie(got_it)<<imie(g)<<endl;
        if(got_it>ans){
            ans=got_it;
            a1=pii(g.s-g.f,g.s+g.f);
        }
    }
//    cout<<ans<<endl;
    for(int i=0;i<n;i++) s[i]=0;
    for(auto &g : to[1]){
        s[g.s]++;
        int got_it=pr+s[g.s]-get(g.s-g.f+1,g.s+g.f);
//        debug()<<imie(ans)<<imie(s[g.s])<<imie(g.s-g.f+1)<<imie(get(g.s-g.f+1,g.s+g.f))<<imie(got_it)<<endl;
        if(got_it>ans){
            ans=got_it;
            a1=pii(g.s-g.f+1,g.s+g.f);
        }
    }
//    cout<<ans<<endl;
    cout<<a[a1.s]+1<<' '<<a[a1.f]+1;
    return 0;
}
/*
    3 6 5 7 4 1 2
    2 1 4 7 5 6 3
*/

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Failed 14 ms 23808 KB Checker failed - contact admins or jury

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Failed 17 ms 23808 KB Checker failed - contact admins or jury

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Failed 15 ms 23808 KB Checker failed - contact admins or jury
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Failed 14 ms 23936 KB Checker failed - contact admins or jury
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Failed 15 ms 23936 KB Checker failed - contact admins or jury
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Failed 18 ms 23936 KB Checker failed - contact admins or jury
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Failed 16 ms 24064 KB Checker failed - contact admins or jury
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Failed 38 ms 26072 KB Checker failed - contact admins or jury
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Failed 136 ms 35512 KB Checker failed - contact admins or jury
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Failed 84 ms 30696 KB Checker failed - contact admins or jury
2 Halted 0 ms 0 KB -