Submission #2872689


Source Code Expand


import java.util.Scanner;

public class Main{

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		long sum = 0;
		long[] sums = new long[4];
		long[] a = new long[n];
		
		for(int i=0;i<n;i++) {
			long input = in.nextLong();
			sum = sum + input;
			a[i] = input;
		}
		
		long ave = sum/4;
		
		int[] lastIdx = new int[4];
		
		long min = Long.MAX_VALUE;
		
		for(int i=0;i<8;i++) {
			sums[0]=sums[1]=sums[2]=0;
			for(int j=0;j<3;j++) {
				if(j==0) lastIdx[j] = -1;
				else lastIdx[j] = lastIdx[j-1];
				if(((i>>j)&1)==0) {
					while(lastIdx[j]<n+j-4 && sums[j]+a[lastIdx[j]+1]<ave) {
						lastIdx[j]++;
						sums[j] = sums[j] + a[lastIdx[j]];
					}
				}else {
					while(lastIdx[j]<n+j-4 && sums[j]<ave) {
						lastIdx[j]++;
						sums[j] = sums[j] + a[lastIdx[j]];
					}
				}
			}
			sums[3] = sum - sums[0] - sums[1] - sums[2];
			long absDif = getAbsoluteDifference(sums);
			if(absDif<min) min=absDif;
		}
		System.out.println(min);
	}
	
	public static long getAbsoluteDifference(long[] sums) {
		long min = Math.min(Math.min(sums[0], sums[1]), Math.min(sums[2], sums[3]));
		long max = Math.max(Math.max(sums[0], sums[1]), Math.max(sums[2], sums[3]));
		return max - min;
	}

}

Submission Info

Submission Time
Task D - Equal Cut
User kiyokiyo
Language Java8 (OpenJDK 1.8.0)
Score 0
Code Size 1313 Byte
Status WA
Exec Time 576 ms
Memory 81284 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 600
Status
AC × 3
AC × 22
WA × 21
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 93 ms 19284 KB
sample_02.txt AC 93 ms 20560 KB
sample_03.txt AC 92 ms 19796 KB
subtask_1_01.txt AC 93 ms 21716 KB
subtask_1_02.txt AC 572 ms 69988 KB
subtask_1_03.txt AC 400 ms 47884 KB
subtask_1_04.txt AC 497 ms 61116 KB
subtask_1_05.txt WA 102 ms 20820 KB
subtask_1_06.txt WA 272 ms 39244 KB
subtask_1_07.txt AC 450 ms 53244 KB
subtask_1_08.txt WA 370 ms 46324 KB
subtask_1_09.txt AC 439 ms 52160 KB
subtask_1_10.txt AC 498 ms 61020 KB
subtask_1_11.txt AC 553 ms 63248 KB
subtask_1_12.txt WA 412 ms 48884 KB
subtask_1_13.txt WA 453 ms 62876 KB
subtask_1_14.txt WA 282 ms 42672 KB
subtask_1_15.txt AC 272 ms 40472 KB
subtask_1_16.txt WA 394 ms 49792 KB
subtask_1_17.txt WA 381 ms 50920 KB
subtask_1_18.txt WA 172 ms 28152 KB
subtask_1_19.txt WA 501 ms 63972 KB
subtask_1_20.txt AC 576 ms 59360 KB
subtask_1_21.txt AC 414 ms 48892 KB
subtask_1_22.txt WA 404 ms 45692 KB
subtask_1_23.txt AC 518 ms 59016 KB
subtask_1_24.txt WA 532 ms 64532 KB
subtask_1_25.txt WA 545 ms 63636 KB
subtask_1_26.txt WA 517 ms 63792 KB
subtask_1_27.txt AC 543 ms 63748 KB
subtask_1_28.txt AC 536 ms 64800 KB
subtask_1_29.txt WA 528 ms 63812 KB
subtask_1_30.txt AC 552 ms 63108 KB
subtask_1_31.txt WA 518 ms 62616 KB
subtask_1_32.txt WA 531 ms 64512 KB
subtask_1_33.txt WA 533 ms 63684 KB
subtask_1_34.txt WA 515 ms 62320 KB
subtask_1_35.txt WA 526 ms 81284 KB
subtask_1_36.txt WA 496 ms 63480 KB
subtask_1_37.txt AC 530 ms 62724 KB