結果

問題 No.451 575
コンテスト
ユーザー hiromi_ayase
提出日時 2016-12-26 13:39:43
言語 Java
(openjdk 23)
結果
WA  
実行時間 -
コード長 3,502 bytes
コンパイル時間 2,371 ms
コンパイル使用メモリ 77,868 KB
実行使用メモリ 57,604 KB
最終ジャッジ日時 2024-12-16 11:04:24
合計ジャッジ時間 9,536 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3 WA * 1
other AC * 12 WA * 17
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.util.NoSuchElementException;


public class Main {

	public static void main(String[] args) {
		FastScanner sc = new FastScanner();
		int N = sc.nextInt();
		long[] b = sc.nextLongList(N);
		
		long max = b[0] - 1;
		long min = 1;
		for (int i = 0; i < N; i ++) {
			long nextMax, nextMin;
			if (i % 2 == 0) {
				nextMax = Math.max(b[i] - min, 1);
				nextMin = Math.max(b[i] - max, 1);
			} else {
				nextMax = Math.max(max - b[i], 1);
				nextMin = Math.max(min - b[i], 1);
			}
			if (nextMin > nextMax) {
				System.out.println(-1);
				return;
			}
			max = nextMax;
			min = nextMin;
		}
		
		long[] a = new long[N + 1];
		a[N] = min;
		for (int i = N - 1; i >= 0; i --) {
			if (i % 2 == 0) {
				a[i] = b[i] - a[i + 1];
			} else {
				a[i] = a[i + 1] + b[i];
			}
		}
		
		StringBuilder sb = new StringBuilder();
		sb.append(N + 1);
		sb.append("\n");
		for (int i = 0; i < N + 1; i ++) {
			sb.append(a[i]);
			sb.append("\n");
		}
		System.out.println(sb);
	}
}



class FastScanner {
	public static String debug = null;

	private final InputStream in = System.in;
	private int ptr = 0;
	private int buflen = 0;
	private byte[] buffer = new byte[1024];
	private boolean eos = false;

	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		} else {
			ptr = 0;
			try {
				if (debug != null) {
					buflen = debug.length();
					buffer = debug.getBytes();
					debug = "";
					eos = true;
				} else {
					buflen = in.read(buffer);
				}
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen < 0) {
				eos = true;
				return false;
			} else if (buflen == 0) {
				return false;
			}
		}
		return true;
	}

	private int readByte() {
		if (hasNextByte())
			return buffer[ptr++];
		else
			return -1;
	}

	private static boolean isPrintableChar(int c) {
		return 33 <= c && c <= 126;
	}

	private void skipUnprintable() {
		while (hasNextByte() && !isPrintableChar(buffer[ptr]))
			ptr++;
	}

	public boolean isEOS() {
		return this.eos;
	}

	public boolean hasNext() {
		skipUnprintable();
		return hasNextByte();
	}

	public String next() {
		if (!hasNext())
			throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while (isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}

	public long nextLong() {
		if (!hasNext())
			throw new NoSuchElementException();
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while (true) {
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			} else if (b == -1 || !isPrintableChar(b)) {
				return minus ? -n : n;
			} else {
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}

	public int nextInt() {
		return (int) nextLong();
	}

	public long[] nextLongList(int n) {
		return nextLongTable(1, n)[0];
	}

	public int[] nextIntList(int n) {
		return nextIntTable(1, n)[0];
	}

	public long[][] nextLongTable(int n, int m) {
		long[][] ret = new long[n][m];
		for (int i = 0; i < n; i ++) {
			for (int j = 0; j < m; j ++) {
				ret[i][j] = nextLong();
			}
		}
		return ret;
	}

	public int[][] nextIntTable(int n, int m) {
		int[][] ret = new int[n][m];
		for (int i = 0; i < n; i ++) {
			for (int j = 0; j < m; j ++) {
				ret[i][j] = nextInt();
			}
		}
		return ret;
	}
}
0