Submission #1612757
Source Code Expand
#include<bits/stdc++.h> const int N=200007; int a[N],n,m; bool chk(int x){ int tm=a[m]<=x,tl=a[m-1]<=x,tr=a[m+1]<=x; if(tm==(tm+tl+tr>>1))return tm; for(int pl=m-1,pr=m+1;;--pl,++pr){ if(pl<1)return a[1]<=x; if((a[pl]<=x)==(a[pl-1]<=x))return a[pl]<=x; if((a[pr]<=x)==(a[pr+1]<=x))return a[pr]<=x; } } int main(){ scanf("%d",&m); n=m*2-1; for(int i=1;i<=n;++i)scanf("%d",a+i); int L=1,R=n,M; while(L<R)chk(M=L+R>>1)?R=M:(L=M+1); printf("%d",L); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Median Pyramid Hard |
User | ccz181078 |
Language | C++14 (GCC 5.4.1) |
Score | 1300 |
Code Size | 493 Byte |
Status | AC |
Exec Time | 23 ms |
Memory | 1024 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:14:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&m); ^ ./Main.cpp:16:38: 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); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1300 / 1300 | ||||
Status |
|
|
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 | 20 ms | 1024 KB |
1_04.txt | AC | 20 ms | 1024 KB |
1_05.txt | AC | 23 ms | 1024 KB |
1_06.txt | AC | 23 ms | 1024 KB |
1_07.txt | AC | 23 ms | 1024 KB |
1_08.txt | AC | 23 ms | 1024 KB |
1_09.txt | AC | 20 ms | 1024 KB |
1_10.txt | AC | 20 ms | 1024 KB |
1_11.txt | AC | 23 ms | 1024 KB |
1_12.txt | AC | 23 ms | 1024 KB |
1_13.txt | AC | 23 ms | 1024 KB |
1_14.txt | AC | 23 ms | 1024 KB |
1_15.txt | AC | 21 ms | 1024 KB |
1_16.txt | AC | 21 ms | 1024 KB |
1_17.txt | AC | 21 ms | 1024 KB |
1_18.txt | AC | 21 ms | 1024 KB |
1_19.txt | AC | 20 ms | 1024 KB |
1_20.txt | AC | 20 ms | 1024 KB |
1_21.txt | AC | 20 ms | 1024 KB |
1_22.txt | AC | 20 ms | 1024 KB |
1_23.txt | AC | 23 ms | 1024 KB |
1_24.txt | AC | 23 ms | 1024 KB |
1_25.txt | AC | 22 ms | 1024 KB |
1_26.txt | AC | 22 ms | 1024 KB |
1_27.txt | AC | 21 ms | 1024 KB |
1_28.txt | AC | 23 ms | 1024 KB |
1_29.txt | AC | 21 ms | 1024 KB |
1_30.txt | AC | 21 ms | 1024 KB |
1_31.txt | AC | 23 ms | 1024 KB |
1_32.txt | AC | 22 ms | 1024 KB |
1_33.txt | AC | 21 ms | 1024 KB |
1_34.txt | AC | 22 ms | 1024 KB |
1_35.txt | AC | 22 ms | 1024 KB |
1_36.txt | AC | 21 ms | 1024 KB |
1_37.txt | AC | 22 ms | 1024 KB |
1_38.txt | AC | 23 ms | 1024 KB |
1_39.txt | AC | 22 ms | 1024 KB |
1_40.txt | AC | 21 ms | 1024 KB |
1_41.txt | AC | 23 ms | 1024 KB |
1_42.txt | AC | 22 ms | 1024 KB |
1_43.txt | AC | 23 ms | 1024 KB |
1_44.txt | AC | 22 ms | 1024 KB |
1_45.txt | AC | 21 ms | 1024 KB |
1_46.txt | AC | 22 ms | 1024 KB |
1_47.txt | AC | 21 ms | 1024 KB |
1_48.txt | AC | 21 ms | 1024 KB |
1_49.txt | AC | 22 ms | 1024 KB |
1_50.txt | AC | 21 ms | 1024 KB |
1_51.txt | AC | 20 ms | 1024 KB |
1_52.txt | AC | 21 ms | 1024 KB |
1_53.txt | AC | 21 ms | 1024 KB |
1_54.txt | AC | 21 ms | 1024 KB |