Submission #3011382
Source Code Expand
#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<cmath> #define ll long long #define MAXN 100010 using namespace std; ll n,a[MAXN],b[MAXN],ans; inline bool check(ll x) { for(int i=1;i<=2*n-1;i++){ if(a[i]>=x) b[i]=1; else b[i]=0; } int l=n,r=n; while(l>1&&b[l-1]!=b[l]) l--; while(r<2*n-1&&b[r]!=b[r+1]) r++; if(l==1&&r==2*n+1){ return (l+r)/2; } else{ if(n-l<r-n) return b[l]; else return b[r]; } } int main() { ll l=1,r,mid; cin>>n; r=2*n-1; for(int i=1;i<=r;i++) cin>>a[i]; while(l<=r) { mid=(l+r)/2; if(check(mid)){ ans=mid; l=mid+1; } else r=mid-1; } cout<<ans; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Median Pyramid Hard |
User | luogu_bot1 |
Language | C++ (GCC 5.4.1) |
Score | 0 |
Code Size | 697 Byte |
Status | RE |
Exec Time | 133 ms |
Memory | 1024 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | RE | 126 ms | 1024 KB |
1_04.txt | RE | 130 ms | 1024 KB |
1_05.txt | RE | 130 ms | 1024 KB |
1_06.txt | RE | 133 ms | 1024 KB |
1_07.txt | RE | 131 ms | 1024 KB |
1_08.txt | RE | 128 ms | 1024 KB |
1_09.txt | RE | 128 ms | 1024 KB |
1_10.txt | RE | 130 ms | 1024 KB |
1_11.txt | RE | 127 ms | 1024 KB |
1_12.txt | RE | 129 ms | 1024 KB |
1_13.txt | RE | 131 ms | 1024 KB |
1_14.txt | RE | 129 ms | 1024 KB |
1_15.txt | RE | 128 ms | 1024 KB |
1_16.txt | RE | 130 ms | 1024 KB |
1_17.txt | RE | 131 ms | 1024 KB |
1_18.txt | RE | 129 ms | 1024 KB |
1_19.txt | RE | 133 ms | 1024 KB |
1_20.txt | RE | 126 ms | 1024 KB |
1_21.txt | RE | 127 ms | 1024 KB |
1_22.txt | RE | 127 ms | 1024 KB |
1_23.txt | RE | 127 ms | 1024 KB |
1_24.txt | RE | 127 ms | 1024 KB |
1_25.txt | RE | 128 ms | 1024 KB |
1_26.txt | RE | 129 ms | 1024 KB |
1_27.txt | RE | 129 ms | 1024 KB |
1_28.txt | RE | 129 ms | 1024 KB |
1_29.txt | RE | 126 ms | 1024 KB |
1_30.txt | RE | 131 ms | 1024 KB |
1_31.txt | RE | 133 ms | 1024 KB |
1_32.txt | RE | 130 ms | 1024 KB |
1_33.txt | RE | 129 ms | 1024 KB |
1_34.txt | RE | 128 ms | 1024 KB |
1_35.txt | RE | 127 ms | 1024 KB |
1_36.txt | RE | 125 ms | 1024 KB |
1_37.txt | RE | 126 ms | 1024 KB |
1_38.txt | RE | 126 ms | 1024 KB |
1_39.txt | RE | 126 ms | 1024 KB |
1_40.txt | RE | 126 ms | 1024 KB |
1_41.txt | RE | 127 ms | 1024 KB |
1_42.txt | RE | 128 ms | 1024 KB |
1_43.txt | RE | 125 ms | 1024 KB |
1_44.txt | RE | 130 ms | 1024 KB |
1_45.txt | RE | 128 ms | 1024 KB |
1_46.txt | RE | 128 ms | 1024 KB |
1_47.txt | RE | 126 ms | 1024 KB |
1_48.txt | RE | 129 ms | 1024 KB |
1_49.txt | RE | 125 ms | 1024 KB |
1_50.txt | RE | 128 ms | 1024 KB |
1_51.txt | RE | 126 ms | 1024 KB |
1_52.txt | RE | 126 ms | 1024 KB |
1_53.txt | RE | 126 ms | 1024 KB |
1_54.txt | RE | 127 ms | 1024 KB |