Submission #3011383


Source Code Expand

#include <bits/stdc++.h>
using namespace std;																																																																																																																																							auto Nextint=[]()->int{int x;scanf("%d",&x);return x;};

int n,a[1000001];

bool check(int x)
{
	vector<int> pos;
	auto func=[x](int p)->bool{return a[p]>=x;};auto proc=[](bool a,bool b,bool c)->bool{return a==b||b==c;};
	for(int i=2;i<=2*(n-1);++i)if(proc(func(i-1),func(i),func(i+1)))pos.push_back(i);
	if(pos.empty())return func(1);
	auto res=0,maxn=INT_MAX;
	for(auto i : pos)if(abs(i-n)<maxn)res=i,maxn=abs(i-n);
	return func(res);
}

int main()
{
	n=Nextint();
	for(int i=1;i<=2*n-1;++i)[](int i)->void{a[i]=Nextint();}(i);
	auto l=1,r=2*n,ans=0;
	while(l<=r)
	{
		auto mid=(l+r)>>1;
		if(check(mid))l=mid+1,ans=mid;else r=mid-1;
	}
	printf("%d\n",ans);
}

Submission Info

Submission Time
Task D - Median Pyramid Hard
User luogu_bot4
Language C++14 (GCC 5.4.1)
Score 1300
Code Size 868 Byte
Status AC
Exec Time 58 ms
Memory 2896 KB

Compile Error

./Main.cpp: In lambda function:
./Main.cpp:2:199: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
 using namespace std;                                                                                                                                       auto Nextint=[]()->int{int x;scanf("%d",&x);return x;};
                                                                                                                                                                                                       ^

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 41 ms 2896 KB
1_04.txt AC 41 ms 2896 KB
1_05.txt AC 29 ms 1660 KB
1_06.txt AC 29 ms 1660 KB
1_07.txt AC 29 ms 1660 KB
1_08.txt AC 29 ms 1660 KB
1_09.txt AC 41 ms 2892 KB
1_10.txt AC 41 ms 2896 KB
1_11.txt AC 29 ms 1660 KB
1_12.txt AC 29 ms 1660 KB
1_13.txt AC 29 ms 1660 KB
1_14.txt AC 29 ms 1660 KB
1_15.txt AC 46 ms 2836 KB
1_16.txt AC 43 ms 2668 KB
1_17.txt AC 50 ms 2672 KB
1_18.txt AC 49 ms 2672 KB
1_19.txt AC 30 ms 1812 KB
1_20.txt AC 30 ms 1816 KB
1_21.txt AC 31 ms 1804 KB
1_22.txt AC 31 ms 1808 KB
1_23.txt AC 32 ms 1680 KB
1_24.txt AC 31 ms 1660 KB
1_25.txt AC 43 ms 2024 KB
1_26.txt AC 31 ms 1684 KB
1_27.txt AC 43 ms 2572 KB
1_28.txt AC 33 ms 1784 KB
1_29.txt AC 32 ms 1856 KB
1_30.txt AC 35 ms 2568 KB
1_31.txt AC 30 ms 1660 KB
1_32.txt AC 41 ms 1992 KB
1_33.txt AC 40 ms 2664 KB
1_34.txt AC 32 ms 1692 KB
1_35.txt AC 35 ms 1808 KB
1_36.txt AC 36 ms 1800 KB
1_37.txt AC 42 ms 1968 KB
1_38.txt AC 33 ms 1784 KB
1_39.txt AC 42 ms 1964 KB
1_40.txt AC 43 ms 2052 KB
1_41.txt AC 31 ms 1808 KB
1_42.txt AC 39 ms 1980 KB
1_43.txt AC 34 ms 1772 KB
1_44.txt AC 42 ms 1944 KB
1_45.txt AC 31 ms 1660 KB
1_46.txt AC 39 ms 1996 KB
1_47.txt AC 50 ms 2744 KB
1_48.txt AC 58 ms 2728 KB
1_49.txt AC 46 ms 2828 KB
1_50.txt AC 57 ms 2736 KB
1_51.txt AC 52 ms 2672 KB
1_52.txt AC 55 ms 2732 KB
1_53.txt AC 56 ms 2732 KB
1_54.txt AC 58 ms 2680 KB