Submission #3433098


Source Code Expand

#include <iostream>
#include <ctime>
#include <algorithm>
#include <cstdlib>
#include <cstdio>
#include <cstring>
using namespace std;
const int MAXN = 200005;
int a[MAXN],t[MAXN],n;
inline bool check(int limit)
{
	for(int i=1;i<=n*2-1;++i)
		t[i]=(a[i]>=limit);
	int l=-1,r=-1,lpos=-0x3f3f3f3f,rpos=0x3f3f3f3f;
	for(int i=n+1;i<=n*2-1;++i)
		if(t[i]==t[i-1]){r=t[i],rpos=i-1;break;}
	for(int i=n-1;i>0;--i)
		if(t[i]==t[i+1]){l=t[i],lpos=i+1;break;}
	if(l==-1 && r==-1)
		if(n&1)return t[n];
		else return t[n]^1;
	else return (rpos-n>n-lpos?l:r);
	return 0;
}
int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n*2-1;++i)
		scanf("%d",a+i);
	int l=1,r=n*2-1,mid,ans=0;
	while(l<=r){
		mid=(l+r)>>1;
		if(check(mid))l=mid+1,ans=mid;
		else r=mid-1;
	}
	cout<<ans<<endl;
	return 0;
}

Submission Info

Submission Time
Task D - Median Pyramid Hard
User DFPMTS
Language C++14 (GCC 5.4.1)
Score 1300
Code Size 817 Byte
Status AC
Exec Time 27 ms
Memory 1792 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:27:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:29:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",a+i);
                  ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1300 / 1300
Status
AC × 2
AC × 57
Set Name Test Cases
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
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 1 ms 256 KB
1_03.txt AC 24 ms 1792 KB
1_04.txt AC 24 ms 1792 KB
1_05.txt AC 27 ms 1792 KB
1_06.txt AC 27 ms 1792 KB
1_07.txt AC 27 ms 1792 KB
1_08.txt AC 27 ms 1792 KB
1_09.txt AC 24 ms 1792 KB
1_10.txt AC 24 ms 1792 KB
1_11.txt AC 27 ms 1792 KB
1_12.txt AC 27 ms 1792 KB
1_13.txt AC 27 ms 1792 KB
1_14.txt AC 27 ms 1792 KB
1_15.txt AC 24 ms 1792 KB
1_16.txt AC 24 ms 1792 KB
1_17.txt AC 24 ms 1792 KB
1_18.txt AC 24 ms 1792 KB
1_19.txt AC 23 ms 1792 KB
1_20.txt AC 23 ms 1792 KB
1_21.txt AC 24 ms 1792 KB
1_22.txt AC 23 ms 1792 KB
1_23.txt AC 25 ms 1792 KB
1_24.txt AC 26 ms 1792 KB
1_25.txt AC 25 ms 1792 KB
1_26.txt AC 25 ms 1792 KB
1_27.txt AC 24 ms 1792 KB
1_28.txt AC 25 ms 1792 KB
1_29.txt AC 24 ms 1792 KB
1_30.txt AC 24 ms 1792 KB
1_31.txt AC 25 ms 1792 KB
1_32.txt AC 25 ms 1792 KB
1_33.txt AC 24 ms 1792 KB
1_34.txt AC 25 ms 1792 KB
1_35.txt AC 25 ms 1792 KB
1_36.txt AC 24 ms 1792 KB
1_37.txt AC 24 ms 1792 KB
1_38.txt AC 25 ms 1792 KB
1_39.txt AC 25 ms 1792 KB
1_40.txt AC 24 ms 1792 KB
1_41.txt AC 26 ms 1792 KB
1_42.txt AC 24 ms 1792 KB
1_43.txt AC 26 ms 1792 KB
1_44.txt AC 25 ms 1792 KB
1_45.txt AC 25 ms 1792 KB
1_46.txt AC 25 ms 1792 KB
1_47.txt AC 24 ms 1792 KB
1_48.txt AC 24 ms 1792 KB
1_49.txt AC 24 ms 1792 KB
1_50.txt AC 24 ms 1792 KB
1_51.txt AC 23 ms 1792 KB
1_52.txt AC 24 ms 1792 KB
1_53.txt AC 24 ms 1792 KB
1_54.txt AC 24 ms 1792 KB