Submission #1612742


Source Code Expand

#include<bits/stdc++.h>
const int N=200007;
int a[N],n,m,ar[N],b[N],c[N];
void upd(int x){c[x]=b[x-1]+b[x]+b[x+1]>>1;}
int main(){
	scanf("%d",&m);
	n=m*2-1;
	for(int i=1;i<=n;++i)scanf("%d",a+i),ar[a[i]]=i;
	for(int i=1;i<=n;++i){
		int x=ar[i];
		b[x]=1;
		upd(x-1),upd(x),upd(x+1);
		if(c[m])return printf("%d",i),0;
	}
}

Submission Info

Submission Time
Task D - Median Pyramid Hard
User ccz181078
Language C++14 (GCC 5.4.1)
Score 0
Code Size 338 Byte
Status WA
Exec Time 30 ms
Memory 3328 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:6:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&m);
                ^
./Main.cpp:8:49: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=n;++i)scanf("%d",a+i),ar[a[i]]=i;
                                                 ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1300
Status
AC × 2
AC × 17
WA × 40
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 21 ms 2560 KB
1_04.txt AC 21 ms 2560 KB
1_05.txt WA 21 ms 2560 KB
1_06.txt WA 22 ms 3328 KB
1_07.txt WA 21 ms 2560 KB
1_08.txt WA 21 ms 3328 KB
1_09.txt AC 21 ms 2560 KB
1_10.txt AC 21 ms 2560 KB
1_11.txt WA 21 ms 3328 KB
1_12.txt WA 21 ms 2560 KB
1_13.txt WA 21 ms 3328 KB
1_14.txt WA 21 ms 2560 KB
1_15.txt WA 25 ms 3328 KB
1_16.txt WA 24 ms 3328 KB
1_17.txt AC 24 ms 3328 KB
1_18.txt WA 23 ms 3328 KB
1_19.txt WA 24 ms 3328 KB
1_20.txt WA 23 ms 3328 KB
1_21.txt WA 22 ms 3328 KB
1_22.txt WA 24 ms 3328 KB
1_23.txt WA 23 ms 3328 KB
1_24.txt WA 23 ms 3328 KB
1_25.txt WA 22 ms 2176 KB
1_26.txt WA 23 ms 3328 KB
1_27.txt WA 25 ms 3328 KB
1_28.txt WA 22 ms 2944 KB
1_29.txt WA 22 ms 2816 KB
1_30.txt WA 30 ms 3328 KB
1_31.txt WA 22 ms 3200 KB
1_32.txt WA 24 ms 3328 KB
1_33.txt WA 22 ms 2304 KB
1_34.txt WA 22 ms 3072 KB
1_35.txt WA 24 ms 3328 KB
1_36.txt WA 21 ms 2560 KB
1_37.txt WA 22 ms 2304 KB
1_38.txt WA 22 ms 2944 KB
1_39.txt WA 25 ms 3328 KB
1_40.txt WA 22 ms 2176 KB
1_41.txt WA 24 ms 3328 KB
1_42.txt WA 24 ms 3328 KB
1_43.txt WA 24 ms 3328 KB
1_44.txt WA 22 ms 2304 KB
1_45.txt WA 24 ms 3328 KB
1_46.txt WA 24 ms 3328 KB
1_47.txt AC 23 ms 3328 KB
1_48.txt WA 24 ms 3328 KB
1_49.txt AC 23 ms 3328 KB
1_50.txt AC 25 ms 3328 KB
1_51.txt AC 22 ms 3328 KB
1_52.txt AC 23 ms 3328 KB
1_53.txt AC 23 ms 3328 KB
1_54.txt AC 24 ms 3328 KB