提出 #69583610

ソースコード 拡げる

#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
#include<set>
#define pii pair<int,int>
#define fi first
#define se second
#define pb push_back
using namespace std;
const int N=2e5+10;
const int M=2e3+10;
const int mod=1e9+7;
const int inf=1e9+1e7;
int n,a[N],x[N],y[N],b[N],pos[N];
int main()
{
	ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin>>n,x[n*2]=y[0]=inf;
	for(int i=1;i<n*2;i++) cin>>a[i],pos[a[i]]=i;
	for(int i=n*2-1;i;i--)
	{
		x[i]=x[i+1]; int p=pos[i]; b[p]=1;
		if(b[p]&&b[p-1]) x[i]=min(x[i],min(abs(p-n),abs(p-1-n)));
		if(b[p]&&b[p+1]) x[i]=min(x[i],min(abs(p-n),abs(p+1-n)));
	}
	b[0]=b[n*2]=1;
	for(int i=1;i<n*2;i++)
	{
		y[i]=y[i-1]; int p=pos[i]; b[p]=0;
		if(!b[p]&&!b[p-1]) y[i]=min(y[i],min(abs(p-n),abs(p-1-n)));
		if(!b[p]&&!b[p+1]) y[i]=min(y[i],min(abs(p-n),abs(p+1-n)));
	}
	for(int i=n*2-1;i;i--) if(x[i]==inf&&y[i-1]==inf?a[1]>=i:x[i]<y[i-1]) {cout<<i; break;}
	return 0;
}

提出情報

提出日時
問題 D - Median Pyramid Hard
ユーザ KSCD_
言語 C++ 20 (gcc 12.2)
得点 1300
コード長 992 Byte
結果 AC
実行時間 15 ms
メモリ 7452 KiB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 1300 / 1300
結果
AC × 2
AC × 57
セット名 テストケース
Sample 0_00.txt, 0_01.txt
All 0_00.txt, 0_01.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt, 1_47.txt, 1_48.txt, 1_49.txt, 1_50.txt, 1_51.txt, 1_52.txt, 1_53.txt, 1_54.txt
ケース名 結果 実行時間 メモリ
0_00.txt AC 1 ms 3436 KiB
0_01.txt AC 1 ms 3400 KiB
1_00.txt AC 1 ms 3364 KiB
1_01.txt AC 1 ms 3428 KiB
1_02.txt AC 1 ms 3416 KiB
1_03.txt AC 11 ms 7328 KiB
1_04.txt AC 11 ms 7252 KiB
1_05.txt AC 11 ms 7368 KiB
1_06.txt AC 11 ms 7288 KiB
1_07.txt AC 11 ms 7272 KiB
1_08.txt AC 11 ms 7216 KiB
1_09.txt AC 12 ms 7316 KiB
1_10.txt AC 12 ms 7312 KiB
1_11.txt AC 11 ms 7320 KiB
1_12.txt AC 11 ms 7212 KiB
1_13.txt AC 11 ms 7292 KiB
1_14.txt AC 11 ms 7324 KiB
1_15.txt AC 13 ms 7404 KiB
1_16.txt AC 13 ms 7364 KiB
1_17.txt AC 13 ms 7452 KiB
1_18.txt AC 14 ms 7232 KiB
1_19.txt AC 12 ms 7300 KiB
1_20.txt AC 11 ms 7268 KiB
1_21.txt AC 12 ms 7252 KiB
1_22.txt AC 13 ms 7400 KiB
1_23.txt AC 12 ms 7364 KiB
1_24.txt AC 12 ms 7304 KiB
1_25.txt AC 13 ms 7280 KiB
1_26.txt AC 12 ms 7208 KiB
1_27.txt AC 14 ms 7264 KiB
1_28.txt AC 12 ms 7300 KiB
1_29.txt AC 12 ms 7276 KiB
1_30.txt AC 13 ms 7236 KiB
1_31.txt AC 11 ms 7140 KiB
1_32.txt AC 13 ms 7324 KiB
1_33.txt AC 13 ms 7324 KiB
1_34.txt AC 12 ms 7236 KiB
1_35.txt AC 12 ms 7304 KiB
1_36.txt AC 12 ms 7236 KiB
1_37.txt AC 14 ms 7292 KiB
1_38.txt AC 12 ms 7328 KiB
1_39.txt AC 13 ms 7312 KiB
1_40.txt AC 14 ms 7296 KiB
1_41.txt AC 12 ms 7372 KiB
1_42.txt AC 13 ms 7240 KiB
1_43.txt AC 13 ms 7324 KiB
1_44.txt AC 13 ms 7328 KiB
1_45.txt AC 12 ms 7368 KiB
1_46.txt AC 13 ms 7276 KiB
1_47.txt AC 15 ms 7412 KiB
1_48.txt AC 15 ms 7248 KiB
1_49.txt AC 15 ms 7432 KiB
1_50.txt AC 15 ms 7296 KiB
1_51.txt AC 15 ms 7160 KiB
1_52.txt AC 15 ms 7316 KiB
1_53.txt AC 15 ms 7364 KiB
1_54.txt AC 15 ms 7272 KiB