結果

問題 No.451 575
ユーザー GrenacheGrenache
提出日時 2016-12-02 21:06:49
言語 Java21
(openjdk 21)
結果
AC  
実行時間 352 ms / 2,000 ms
コード長 6,646 bytes
コンパイル時間 4,168 ms
コンパイル使用メモリ 84,392 KB
実行使用メモリ 59,204 KB
最終ジャッジ日時 2024-12-16 11:09:37
合計ジャッジ時間 11,350 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 55 ms
48,196 KB
testcase_01 AC 54 ms
47,996 KB
testcase_02 AC 54 ms
48,596 KB
testcase_03 AC 57 ms
48,136 KB
testcase_04 AC 51 ms
48,444 KB
testcase_05 AC 92 ms
49,640 KB
testcase_06 AC 107 ms
50,676 KB
testcase_07 AC 200 ms
52,164 KB
testcase_08 AC 51 ms
48,456 KB
testcase_09 AC 77 ms
49,392 KB
testcase_10 AC 195 ms
51,824 KB
testcase_11 AC 326 ms
54,856 KB
testcase_12 AC 352 ms
59,204 KB
testcase_13 AC 345 ms
45,336 KB
testcase_14 AC 52 ms
37,256 KB
testcase_15 AC 99 ms
40,116 KB
testcase_16 AC 147 ms
44,452 KB
testcase_17 AC 313 ms
47,960 KB
testcase_18 AC 197 ms
42,572 KB
testcase_19 AC 270 ms
50,124 KB
testcase_20 AC 115 ms
39,732 KB
testcase_21 AC 93 ms
38,424 KB
testcase_22 AC 49 ms
37,104 KB
testcase_23 AC 351 ms
48,476 KB
testcase_24 AC 257 ms
45,236 KB
testcase_25 AC 49 ms
37,240 KB
testcase_26 AC 50 ms
37,304 KB
testcase_27 AC 57 ms
37,312 KB
testcase_28 AC 74 ms
38,244 KB
testcase_29 AC 124 ms
42,144 KB
testcase_30 AC 311 ms
50,028 KB
testcase_31 AC 49 ms
37,096 KB
testcase_32 AC 118 ms
40,468 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;


public class Main_yukicoder451 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		int n = sc.nextInt();

		long[] b = new long[n];
		for (int i = 0; i < n; i++) {
			b[i] = sc.nextLong();
		}

		long[] max = new long[n + 1];
		long[] min = new long[n + 1];
		Arrays.fill(max, Long.MAX_VALUE);
		Arrays.fill(min, 0);

		for (int i = 0; i < n; i++) {
			if (i % 2 == 0) {
				max[i] = Math.min(max[i], b[i] - 1);
				max[i + 1] = Math.min(max[i + 1], b[i] - 1);
			} else {
				long tmp = b[i - 1] - b[i];
				b[i] = tmp;
				if (tmp < 2) {
					pr.println(-1);
					return;
				}
				max[i - 1] = Math.min(max[i - 1], tmp - 1);
				max[i + 1] = Math.min(max[i + 1], tmp - 1);
			}
		}
		for (int i = 0; i < n; i++) {
			if (i % 2 == 0) {
				min[i] = Math.max(min[i], b[i] - max[i + 1]);
			} else {
				min[i - 1] = Math.max(min[i - 1], b[i] - max[i + 1]);
				min[i + 1] = Math.max(min[i + 1], b[i] - max[i - 1]);
				min[i] = Math.max(min[i], b[i - 1] - max[i - 1]);
			}
		}

		long minw = max[0] - min[0];
		int mini = 0;
		for (int i = 0; i <= n; i++) {
//			pr.println(max[i]);
			if (max[i] < 1) {
				pr.println(-1);
				return;
			}
			if (minw > max[i] - min[i]) {
				minw = max[i] - min[i];
				mini = i;
			}
		}

//		long l = 0;
//		long r = 1_000_000_000_000_000_000L;
//		long r = max[0];
		/*
		while (r - l > 1) {
			long mid = l + (r - l) / 2;

			if (f(mid, b)) {
				r = mid;
			} else {
				l = mid;
			}
		}
		*/
//		if (f(1, b)) {
//			r = 1;
//		} else if (f(max[0], b)) {
//			r = max[0];
//		} else {
//			r = max[0] / 2;
//			pr.println(-1);
//			return;
//		}
//		for (long j = min[mini]; j <= max[mini]; j++) {
//			long[] a = f(j, b, mini, min, max);
			long[] a = f(min[mini], b, mini, min, max);
			if (a != null) {
				pr.println(n + 1);
				for (int i = 0; i <= n; i++) {
					pr.println(a[i]);
				}

				return;
			}

//		}

		pr.println(-1);
	}

	private static int rec = 0;

	private static long[] f(long mid, long[] b, int j, long[] min, long[] max) {
		if (rec++ > 30) {
			return null;
		}

		int n = b.length;

		long[] a = new long[n + 1];
		a[j] = mid;
		if (j % 2 == 1) {
			a[j - 1] = b[j - 1] - a[j];
		}

		long maxw = 0;
		int maxi = 0;
		for (int i = j + 1; i <= n; i++) {
			if (i % 2 == 1) {
				a[i] = b[i - 1] - a[i - 1];
			} else {
				a[i] = b[i - 1] - a[i - 2];
			}

			if (maxw > a[i] - min[i]) {
				maxw = Math.min(maxw, a[i] - min[i]);
				maxi = i;
			}
//			if (a[i] <= 0) {
//				return null;
//			}
		}
		for (int i = j - 1; i >= 1; i--) {
			if (i % 2 == 1) {
				a[i - 1] = b[i] - a[i + 1];
				a[i] = b[i - 1] - a[i - 1];
			} else {
				a[i] = b[i] - a[i + 1];
			}

			if (maxw > a[i] - min[i]) {
				maxw = Math.min(maxw, a[i] - min[i]);
				maxi = i;
			}
//			if (a[i] <= 0) {
//				return null;
//			}
		}

		if (maxw < 0) {
			return f(min[maxi], b, maxi, min, max);
		}

		return a;
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		pr = new Printer(System.out);

		solve();

		pr.close();
		sc.close();
	}

	@SuppressWarnings("unused")
	private static class Scanner {
		BufferedReader br;

		Scanner (InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		private boolean isPrintable(int ch) {
			return ch >= '!' && ch <= '~';
		}

		private boolean isCRLF(int ch) {
			return ch == '\n' || ch == '\r' || ch == -1;
		}

		private int nextPrintable() {
			try {
				int ch;
				while (!isPrintable(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}

				return ch;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String next() {
			try {
				int ch = nextPrintable();
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (isPrintable(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		int nextInt() {
			try {
				// parseInt from Integer.parseInt()
				boolean negative = false;
				int res = 0;
				int limit = -Integer.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Integer.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				int multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		long nextLong() {
			try {
				// parseLong from Long.parseLong()
				boolean negative = false;
				long res = 0;
				long limit = -Long.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Long.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				long multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		float nextFloat() {
			return Float.parseFloat(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			try {
				int ch;
				while (isCRLF(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (!isCRLF(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
//				throw new NoSuchElementException();
			}
		}
	}

	private static class Printer extends PrintWriter {
		Printer(PrintStream out) {
			super(out);
		}
	}
}
0