結果

問題 No.451 575
コンテスト
ユーザー ぴろず
提出日時 2016-12-02 00:45:03
言語 Java
(openjdk 23)
結果
AC  
実行時間 233 ms / 2,000 ms
コード長 4,876 bytes
コンパイル時間 2,273 ms
コンパイル使用メモリ 78,116 KB
実行使用メモリ 45,092 KB
最終ジャッジ日時 2024-12-16 09:43:05
合計ジャッジ時間 7,601 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 29
権限があれば一括ダウンロードができます

ソースコード

diff # 

package no451;

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

public class Main {
	public static long MAX = 1_000_000_000_000_000_000L;
	public static void main(String[] args) {
		IO io = new IO();
		int n = io.nextInt();
		long[] b = new long[n+1];
		for(int i=1;i<=n;i++) {
			b[i] = io.nextLong();
		}
		long[] a = new long[n+2];
		calc(n,a,b);
		
		long plusMax = Long.MIN_VALUE;
		long plusMin = Long.MAX_VALUE;
		long minusMax = Long.MIN_VALUE;
		long minusMin = Long.MAX_VALUE;
		for(int i=1;i<=n+1;i++) {
			if (i % 4 <= 1) {
				plusMax = Math.max(plusMax, a[i]);
				plusMin = Math.min(plusMin, a[i]);
			}else{
				minusMax = Math.max(minusMax, a[i]);
				minusMin = Math.min(minusMin, a[i]);
			}
		}
		long max = MAX;
		long min = 1;
		max = Math.min(max, MAX - plusMax);
		max = Math.min(max, minusMin - 1);
		min = Math.max(min, 1 - plusMin);
		min = Math.max(min, minusMax - MAX);
		if (min > max) {
			System.out.println(-1);
			return;
		}else{
			a[1] = max;
			calc(n,a,b);
		}
		io.println(n+1);
		for(int i=1;i<=n+1;i++) {
			io.println(a[i]);
		}
		io.flush();
	}
	
	public static void calc(int n,long[] a,long[] b) {
		for(int i=2;i<=n+1;i++) {
			if (i % 2 == 0) {
				a[i] = b[i-1] - a[i-1];
			}else{
				a[i] = a[i-1] - b[i-1];
			}
		}
	}

}
class IO extends PrintWriter {
	private final InputStream in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;
	
	public IO() { this(System.in);}
	public IO(InputStream source) { super(System.out); this.in = source;}
	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		}else{
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			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 static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
	public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
	public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; 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 char[] nextCharArray(int len) {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		char[] s = new char[len];
		int i = 0;
		int b = readByte();
		while(isPrintableChar(b)) {
			if (i == len) {
				throw new InputMismatchException();
			}
			s[i++] = (char) b;
			b = readByte();
		}
		return s;
	}
	public String nextLine() {
		if (!hasNextLine()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(!isNewLine(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() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {
			throw new NumberFormatException();
		}
		return (int) nl;
	}
	public char nextChar() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		return (char) readByte();
	}
	public double nextDouble() { return Double.parseDouble(next());}
	public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}
	public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}
	public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
	public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
	public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}
	public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
	public void close() { super.close(); try {in.close();} catch (IOException e) {}}
}
0