Submission #173323


Source Code Expand

Copy
import java.util.Scanner;


public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int n = sc.nextInt();
		int[] a = new int[n];
		for (int i = 0; i < n; i++) {
				a[i] = sc.nextInt();
		}

		long cases = 0;
		int prev = Integer.MIN_VALUE;
		int prevCount = 0;
		for (int i = 0; i < n; i++) {
			if (a[i] != -1 && prev == Integer.MIN_VALUE) {
				prev = a[i];
				prevCount = 0;
				continue;
			} else if (a[i] != -1 && prev != Integer.MIN_VALUE){
				cases += conbination(a[i] - prev + prevCount, prevCount);
				prev = Integer.MIN_VALUE;
				continue;
			} else {
				prevCount++;
				continue;
			}
		}

		System.out.println(cases);
		
		sc.close();
	}
	
	static long conbination(int n, int r) {
		r = Math.min(n - r, r);

		long result = 1;
		for (int i = n; i >= n - r + 1; i--) {
			result *= i;
		}
		for (int i = 1; i <= r; i++) {
			result /= i;
		}

		return result;
	}
}

Submission Info

Submission Time
Task C - タコヤ木
User garnacha
Language Java (OpenJDK 1.7.0)
Score 0
Code Size 985 Byte
Status WA
Exec Time 565 ms
Memory 26680 KB

Judge Result

Set Name Sample Subtask1 Subtask2 Subtask3
Score / Max Score 0 / 0 0 / 50 0 / 30 0 / 20
Status
AC × 2
WA × 1
AC × 4
WA × 10
AC × 6
WA × 20
AC × 7
WA × 29
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
Subtask1 sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt
Subtask2 sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt
Subtask3 subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask3_01.txt, subtask3_02.txt, subtask3_03.txt, subtask3_04.txt, subtask3_05.txt, subtask3_06.txt, subtask3_07.txt, subtask3_08.txt, subtask3_09.txt, subtask3_10.txt, subtask3_11.txt, subtask3_12.txt
Case Name Status Exec Time Memory
sample_01.txt AC 478 ms 22048 KB
sample_02.txt AC 415 ms 22100 KB
sample_03.txt WA 423 ms 22248 KB
subtask1_01.txt AC 496 ms 22104 KB
subtask1_02.txt AC 454 ms 22244 KB
subtask1_03.txt WA 472 ms 22180 KB
subtask1_04.txt WA 439 ms 22492 KB
subtask1_05.txt WA 436 ms 22608 KB
subtask1_06.txt WA 433 ms 22352 KB
subtask1_07.txt WA 436 ms 22580 KB
subtask1_08.txt WA 431 ms 22612 KB
subtask1_09.txt WA 438 ms 22584 KB
subtask1_10.txt WA 444 ms 22356 KB
subtask1_11.txt WA 443 ms 22640 KB
subtask1_12.txt WA 435 ms 22480 KB
subtask2_01.txt AC 437 ms 22108 KB
subtask2_02.txt AC 434 ms 22108 KB
subtask2_03.txt WA 429 ms 22100 KB
subtask2_04.txt WA 479 ms 23080 KB
subtask2_05.txt WA 537 ms 24016 KB
subtask2_06.txt WA 460 ms 23144 KB
subtask2_07.txt WA 523 ms 24656 KB
subtask2_08.txt WA 551 ms 24788 KB
subtask2_09.txt WA 518 ms 24436 KB
subtask2_10.txt WA 535 ms 24696 KB
subtask2_11.txt WA 541 ms 24572 KB
subtask2_12.txt WA 537 ms 24688 KB
subtask3_01.txt AC 418 ms 22224 KB
subtask3_02.txt AC 418 ms 22100 KB
subtask3_03.txt WA 436 ms 22220 KB
subtask3_04.txt WA 559 ms 25676 KB
subtask3_05.txt WA 457 ms 22848 KB
subtask3_06.txt WA 550 ms 25308 KB
subtask3_07.txt AC 531 ms 24668 KB
subtask3_08.txt WA 544 ms 25868 KB
subtask3_09.txt WA 532 ms 24440 KB
subtask3_10.txt WA 549 ms 26680 KB
subtask3_11.txt WA 560 ms 24972 KB
subtask3_12.txt WA 565 ms 26100 KB