# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
154371 | PedroBigMan | Doktor (COCI17_doktor) | C++14 | 326 ms | 48992 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define REP(i,a,b) for(ll i=a; i<b; i++)
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define ff first
#define ss second
#define INF ((ll) pow(2,63) -1)
#define si signed
ll insig;
#define In(vecBRO, LENBRO) REP(IBRO,0,LENBRO) {cin>>insig; vecBRO.pb(insig);}
void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
ll N; cin>>N; vector<ll> a; In(a,N);
vector<ll> p; ll cur=0;
REP(i,0,N)
{
if(a[i]==i+1) {cur++;}
p.pb(cur);
}
ll ideal;
vector<vector<ll> > cen; vector<ll> xx; REP(i,0,2*N-1) {cen.pb(xx);}
REP(i,0,N)
{
ideal = i+a[i]-1;
cen[ideal].pb(abs(i+1-a[i]));
}
REP(i,0,2*N-1) {sort(cen[i].begin(),cen[i].end());}
ll A=1; ll B=1; ll best=0;
REP(c,1,2*N-1)
{
REP(i,0,cen[c].size())
{
if(c-cen[c][i]==0)
{
if(i+1-p[c]>best)
{
best=i+1-p[c]; A=a[0]; B=a[c];
}
}
else
{
if(i+1-(p[(c+cen[c][i])/2]-p[(c-cen[c][i])/2 -1]) >best)
{
best=i+1-(p[(c+cen[c][i])/2]-p[(c-cen[c][i])/2 -1]);
A=a[(c-cen[c][i])/2]; B=a[(c+cen[c][i])/2];
}
}
}
}
cout<<A<<" "<<B<<endl;
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |