Submission #1358675


Source Code Expand

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

class Main {
	public static void main(String args[]) throws IOException {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		Solver solver = new Solver();
		solver.init();
		solver.readHead(in.readLine());
		for (; solver.hasNext();) {
			solver.readBody(in.readLine());
		}
	}
}

class Solver {
	int N;
	int cnt;

	public void init() {
		N = 0;
		cnt = 0;
	}

	public void readHead(String str) {
		String[] strArr = str.split(" ");
		N = Integer.parseInt(strArr[0]);
		// System.out.println(N);
	}

	public boolean hasNext() {
		// return cnt < N;
		return cnt < 1;
	}

	public void readBody(String str) {
		// System.out.println(str);
		cnt++;
		String[] strArr = str.split(" ");
		long sum = 0;
		for (int i = 0; i < N; i++) {
			sum += Long.parseLong(strArr[i]);
		}
		long k = sum / ((long) N * ((long) N + 1) / 2);

		boolean able = true;
		long edge = 0;
		for (int i = 0; i < N; i++) {
			long d = -Long.parseLong(strArr[i]) - k;
			if (i == N - 1)
				d += Long.parseLong(strArr[0]);
			else
				d += Long.parseLong(strArr[i + 1]);
			// System.out.println(d);
			if (d > 0) {
				able = false;
				break;
			}
			if (d < 0) {
				if (d % N != 0) {
					able = false;
					break;
				}
				edge -= d;
			}
		}
		if (able) {
			// System.out.println(edge);
			able = (edge == N * k);
		}

		if (able)
			System.out.println("YES");
		else
			System.out.println("NO");
	}

}

Submission Info

Submission Time
Task B - Boxes
User idon
Language Java8 (OpenJDK 1.8.0)
Score 0
Code Size 1581 Byte
Status WA
Exec Time 215 ms
Memory 38168 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 3
AC × 32
WA × 1
Set Name Test Cases
Sample sample1.txt, sample2.txt, sample3.txt
All sample1.txt, sample2.txt, sample3.txt, in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in2.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt, sample3.txt
Case Name Status Exec Time Memory
in1.txt AC 185 ms 34732 KB
in10.txt AC 111 ms 22612 KB
in11.txt AC 174 ms 35924 KB
in12.txt AC 201 ms 35080 KB
in13.txt AC 169 ms 33364 KB
in14.txt AC 68 ms 19284 KB
in15.txt AC 68 ms 19668 KB
in16.txt WA 70 ms 21076 KB
in17.txt AC 68 ms 19156 KB
in18.txt AC 71 ms 21204 KB
in19.txt AC 69 ms 20180 KB
in2.txt AC 215 ms 34556 KB
in20.txt AC 68 ms 18772 KB
in21.txt AC 166 ms 37588 KB
in22.txt AC 171 ms 37716 KB
in23.txt AC 173 ms 37460 KB
in24.txt AC 91 ms 18644 KB
in25.txt AC 103 ms 24148 KB
in26.txt AC 164 ms 34388 KB
in27.txt AC 163 ms 34772 KB
in3.txt AC 192 ms 36160 KB
in4.txt AC 191 ms 37016 KB
in5.txt AC 191 ms 38168 KB
in6.txt AC 164 ms 37716 KB
in7.txt AC 165 ms 37588 KB
in8.txt AC 111 ms 23636 KB
in9.txt AC 118 ms 21588 KB
sample1.txt AC 68 ms 21076 KB
sample2.txt AC 68 ms 21076 KB
sample3.txt AC 67 ms 18132 KB