oj.uz

Submission #639432

# Submission time Handle Problem Language Result Execution time Memory
639432 2022-09-10T00:05:03 Z inksamurai Doktor (COCI17_doktor) C++17
100 / 100
 172 ms 43832 KB 
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define rng(i,c,n) for(int i=c;i<n;i++)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3xaMC2q ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vector<int>;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}
//e
 
signed main(){
_3xaMC2q;
	int n;
	cin>>n;
	vi a(n);
	rep(i,n){
		cin>>a[i];
	}
	rep(i,n){
		a[i]-=1;
	}
	vec(vi) mp(2*n+11);
	rep(i,n){
		mp[a[i]+i].pb(i);
	}
	vi dl(n);
	rep(i,n){
		if(i)dl[i]=dl[i-1];
		if(a[i]==i){
			dl[i]++;
		}
	}
	vi dr(n);
	per(i,n){
		if(i<n-1)dr[i]=dr[i+1];
		if(a[i]==i){
			dr[i]++;
		}
	}
	int ma=dr[0];
	pii p={0,0};
	rep(i,n){
		int j=a[i];
		if(i!=j){
			int now=0;
			if(i<j){
				int v=i+a[i];
				auto it=prev(lower_bound(mp[v].begin(),mp[v].end(),j));
				now=(int)(it-mp[v].begin());
				now-=(int)(lower_bound(mp[v].begin(),mp[v].end(),i)-mp[v].begin());
				now+=1;
			}else{
				int v=i+a[i];
				auto it=lower_bound(mp[v].begin(),mp[v].end(),j);
				now=(int)(it-mp[v].begin());
				now=(int)(lower_bound(mp[v].begin(),mp[v].end(),i)-mp[v].begin())-now;
				now+=1;
			}
			now+=dl[min(i,j)];
			now+=dr[max(i,j)];
			if(ma<now){
				ma=now;
				p={i,j};	
			}
		}
	}
	if(p.fi>p.se)swap(p.fi,p.se);
	p.fi=a[p.fi]+1;
	p.se=a[p.se]+1;
	cout<<p.fi<<" "<<p.se<<"\n";
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1108 KB Output is correct
2 Correct 74 ms 19152 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 7676 KB Output is correct
2 Correct 26 ms 6724 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 172 ms 40268 KB Output is correct
2 Correct 110 ms 31772 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 23912 KB Output is correct
2 Correct 73 ms 43832 KB Output is correct