Submission #2875973


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-4, 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);
		int mi = abs(sum[i]-sum[st]*2);
		for(;st<i;st++){
			if(abs(sum[i]-sum[st]*2)>mi) 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++){
			if(abs(sum[n]-sum[st]-sum[st]+sum[i])>mi) break;
		}
		a[2] = sum[st] - sum[i]; a[3] = sum[n] - sum[st];
		sort(a, a+4);
		ans = min(ans, a[4] - 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 1091 Byte
Status WA
Exec Time 2103 ms
Memory 5888 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:14:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld",&n);
                  ^
./Main.cpp:15:43: 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
WA × 3
WA × 38
TLE × 5
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 WA 1 ms 2304 KB
sample_02.txt WA 2 ms 2304 KB
sample_03.txt WA 2 ms 2304 KB
subtask_1_01.txt WA 2 ms 2304 KB
subtask_1_02.txt WA 31 ms 5760 KB
subtask_1_03.txt WA 16 ms 4992 KB
subtask_1_04.txt WA 22 ms 5376 KB
subtask_1_05.txt WA 2 ms 2304 KB
subtask_1_06.txt WA 7 ms 2432 KB
subtask_1_07.txt WA 20 ms 5248 KB
subtask_1_08.txt WA 12 ms 4864 KB
subtask_1_09.txt WA 24 ms 5248 KB
subtask_1_10.txt TLE 2103 ms 5504 KB
subtask_1_11.txt WA 104 ms 5760 KB
subtask_1_12.txt WA 10 ms 4992 KB
subtask_1_13.txt WA 71 ms 5248 KB
subtask_1_14.txt WA 8 ms 2560 KB
subtask_1_15.txt WA 29 ms 2432 KB
subtask_1_16.txt WA 20 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 WA 23 ms 5760 KB
subtask_1_20.txt WA 32 ms 5760 KB
subtask_1_21.txt WA 18 ms 5120 KB
subtask_1_22.txt WA 12 ms 4864 KB
subtask_1_23.txt WA 30 ms 5632 KB
subtask_1_24.txt WA 39 ms 5888 KB
subtask_1_25.txt WA 36 ms 5888 KB
subtask_1_26.txt WA 38 ms 5888 KB
subtask_1_27.txt WA 59 ms 5888 KB
subtask_1_28.txt WA 101 ms 5888 KB
subtask_1_29.txt TLE 2103 ms 5888 KB
subtask_1_30.txt WA 1997 ms 5888 KB
subtask_1_31.txt TLE 2103 ms 5888 KB
subtask_1_32.txt TLE 2103 ms 5888 KB
subtask_1_33.txt WA 554 ms 5888 KB
subtask_1_34.txt WA 36 ms 5888 KB
subtask_1_35.txt WA 30 ms 5888 KB
subtask_1_36.txt WA 18 ms 5888 KB
subtask_1_37.txt TLE 2103 ms 5888 KB