Submission #2888149
Source Code Expand
#include <iostream> #include <string.h> #include <stdio.h> #include <algorithm> #include <math.h> using namespace std; typedef long long int LL; const int maxn = 1e6 + 10; const int mod = 998244353; const LL inf = 1e15; LL n, a[maxn], sum[maxn]; int main() { scanf("%lld",&n); for(int i=1;i<=n;i++) scanf("%lld",&a[i]); for(int i=1;i<=n;i++) sum[i] = sum[i-1] + a[i]; LL ans = inf; int st = lower_bound(sum+1, sum+1+n, sum[n]/2) - sum; st = max(st-100, 2); for(int i=st; i<n-1; i++){ st = lower_bound(sum+1, sum+1+i, sum[i]/2) - sum; st = max(st-4, 1); LL mi = abs(sum[i]-sum[st]*2); for(;st<i;st++){ LL val = abs(sum[i]-sum[st+1]*2); if(val > mi) break; mi = val; if(st == i-1) break; } a[0] = sum[st]; a[1] = sum[i] - sum[st]; st = lower_bound(sum+1+i+1, sum+1+n, (sum[n]-sum[i])/2+sum[i]) - sum; st = max(st-4, i+1); mi = abs(sum[n]-sum[st]-sum[st]+sum[i]); for(;st<n;st++){ LL val = abs(sum[n]-sum[st+1]-sum[st+1]+sum[i]); if(val > mi) break; mi = val; if(st == n-1) break; } a[2] = sum[st] - sum[i]; a[3] = sum[n] - sum[st]; sort(a, a+4); ans = min(ans, a[3] - a[0]); } printf("%lld\n", ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Equal Cut |
User | w123456 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1404 Byte |
Status | WA |
Exec Time | 42 ms |
Memory | 5888 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:14:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%lld",&n); ^ ./Main.cpp:15:46: 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("%lld",&a[i]); ^
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 600 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt, subtask_1_30.txt, subtask_1_31.txt, subtask_1_32.txt, subtask_1_33.txt, subtask_1_34.txt, subtask_1_35.txt, subtask_1_36.txt, subtask_1_37.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 2304 KB |
sample_02.txt | AC | 1 ms | 2304 KB |
sample_03.txt | AC | 1 ms | 2304 KB |
subtask_1_01.txt | AC | 1 ms | 2304 KB |
subtask_1_02.txt | AC | 32 ms | 5760 KB |
subtask_1_03.txt | AC | 15 ms | 4992 KB |
subtask_1_04.txt | AC | 23 ms | 5376 KB |
subtask_1_05.txt | AC | 1 ms | 2304 KB |
subtask_1_06.txt | AC | 5 ms | 2432 KB |
subtask_1_07.txt | AC | 19 ms | 5248 KB |
subtask_1_08.txt | AC | 12 ms | 4864 KB |
subtask_1_09.txt | AC | 18 ms | 5248 KB |
subtask_1_10.txt | WA | 26 ms | 5504 KB |
subtask_1_11.txt | AC | 27 ms | 5760 KB |
subtask_1_12.txt | AC | 10 ms | 4992 KB |
subtask_1_13.txt | AC | 19 ms | 5248 KB |
subtask_1_14.txt | AC | 8 ms | 2560 KB |
subtask_1_15.txt | AC | 5 ms | 2432 KB |
subtask_1_16.txt | AC | 18 ms | 5120 KB |
subtask_1_17.txt | WA | 10 ms | 4992 KB |
subtask_1_18.txt | WA | 2 ms | 2304 KB |
subtask_1_19.txt | AC | 22 ms | 5760 KB |
subtask_1_20.txt | AC | 34 ms | 5760 KB |
subtask_1_21.txt | AC | 17 ms | 5120 KB |
subtask_1_22.txt | AC | 12 ms | 4864 KB |
subtask_1_23.txt | AC | 28 ms | 5632 KB |
subtask_1_24.txt | AC | 36 ms | 5888 KB |
subtask_1_25.txt | AC | 34 ms | 5888 KB |
subtask_1_26.txt | AC | 36 ms | 5888 KB |
subtask_1_27.txt | WA | 32 ms | 5888 KB |
subtask_1_28.txt | AC | 42 ms | 5888 KB |
subtask_1_29.txt | AC | 39 ms | 5888 KB |
subtask_1_30.txt | AC | 30 ms | 5888 KB |
subtask_1_31.txt | AC | 36 ms | 5888 KB |
subtask_1_32.txt | AC | 39 ms | 5888 KB |
subtask_1_33.txt | AC | 36 ms | 5888 KB |
subtask_1_34.txt | AC | 33 ms | 5888 KB |
subtask_1_35.txt | AC | 28 ms | 5888 KB |
subtask_1_36.txt | WA | 17 ms | 5888 KB |
subtask_1_37.txt | AC | 34 ms | 5888 KB |