Submission #2872662


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-2 && sums[j]+a[lastIdx[j]+1]<ave) {
						lastIdx[j]++;
						sums[j] = sums[j] + a[lastIdx[j]];
					}
				}else {
					while(lastIdx[j]<n-2 && 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 1306 Byte
Status WA
Exec Time 577 ms
Memory 76668 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 20820 KB
sample_02.txt AC 93 ms 18900 KB
sample_03.txt AC 94 ms 18900 KB
subtask_1_01.txt AC 92 ms 19796 KB
subtask_1_02.txt AC 561 ms 62684 KB
subtask_1_03.txt AC 424 ms 48912 KB
subtask_1_04.txt AC 494 ms 62828 KB
subtask_1_05.txt WA 111 ms 19796 KB
subtask_1_06.txt WA 279 ms 37336 KB
subtask_1_07.txt AC 452 ms 50680 KB
subtask_1_08.txt WA 366 ms 48728 KB
subtask_1_09.txt AC 448 ms 52296 KB
subtask_1_10.txt AC 480 ms 61372 KB
subtask_1_11.txt AC 536 ms 71336 KB
subtask_1_12.txt WA 384 ms 45880 KB
subtask_1_13.txt WA 447 ms 54000 KB
subtask_1_14.txt WA 305 ms 44864 KB
subtask_1_15.txt AC 261 ms 41264 KB
subtask_1_16.txt WA 391 ms 44516 KB
subtask_1_17.txt WA 389 ms 46512 KB
subtask_1_18.txt WA 160 ms 25296 KB
subtask_1_19.txt WA 469 ms 62640 KB
subtask_1_20.txt AC 577 ms 76384 KB
subtask_1_21.txt AC 413 ms 45320 KB
subtask_1_22.txt WA 387 ms 44360 KB
subtask_1_23.txt AC 523 ms 58984 KB
subtask_1_24.txt WA 532 ms 63600 KB
subtask_1_25.txt WA 550 ms 63440 KB
subtask_1_26.txt WA 546 ms 61772 KB
subtask_1_27.txt AC 534 ms 63116 KB
subtask_1_28.txt AC 540 ms 62644 KB
subtask_1_29.txt WA 533 ms 63492 KB
subtask_1_30.txt AC 545 ms 61604 KB
subtask_1_31.txt WA 547 ms 64128 KB
subtask_1_32.txt WA 540 ms 64336 KB
subtask_1_33.txt WA 522 ms 64100 KB
subtask_1_34.txt WA 496 ms 58920 KB
subtask_1_35.txt WA 498 ms 60856 KB
subtask_1_36.txt WA 510 ms 61468 KB
subtask_1_37.txt AC 496 ms 76668 KB