結果

問題 No.451 575
ユーザー yuya178yuya178
提出日時 2017-10-18 05:34:36
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,376 bytes
コンパイル時間 2,663 ms
コンパイル使用メモリ 80,984 KB
実行使用メモリ 48,344 KB
最終ジャッジ日時 2024-04-29 08:50:14
合計ジャッジ時間 9,032 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
36,864 KB
testcase_01 AC 54 ms
36,892 KB
testcase_02 AC 53 ms
36,580 KB
testcase_03 AC 54 ms
37,144 KB
testcase_04 AC 53 ms
36,660 KB
testcase_05 AC 57 ms
36,984 KB
testcase_06 AC 81 ms
37,424 KB
testcase_07 AC 98 ms
39,040 KB
testcase_08 AC 53 ms
36,992 KB
testcase_09 AC 60 ms
37,020 KB
testcase_10 AC 153 ms
40,668 KB
testcase_11 AC 242 ms
48,344 KB
testcase_12 AC 225 ms
44,372 KB
testcase_13 AC 232 ms
44,280 KB
testcase_14 AC 54 ms
36,912 KB
testcase_15 AC 60 ms
36,664 KB
testcase_16 AC 82 ms
37,680 KB
testcase_17 AC 101 ms
39,020 KB
testcase_18 AC 99 ms
39,168 KB
testcase_19 AC 106 ms
38,948 KB
testcase_20 AC 103 ms
38,712 KB
testcase_21 AC 62 ms
37,160 KB
testcase_22 AC 53 ms
36,900 KB
testcase_23 AC 241 ms
44,124 KB
testcase_24 AC 194 ms
44,692 KB
testcase_25 AC 53 ms
36,900 KB
testcase_26 AC 53 ms
37,016 KB
testcase_27 AC 55 ms
36,636 KB
testcase_28 AC 55 ms
36,508 KB
testcase_29 AC 66 ms
37,144 KB
testcase_30 AC 97 ms
39,092 KB
testcase_31 AC 53 ms
36,896 KB
testcase_32 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";
    
    void solve()
    {
        int n = ni();
        long[] b = new long[n];
        for(int i = 0; i < n; i++){
            b[i] = nl();
        }
        long low = 1;
        long high = 1000000000000000000l;
        long tmp;
        for(int i = 0; i <n; i++){
            if(i%2==0){
                tmp = low;
                low = Math.max(1,b[i]-high);
                high = b[i]-tmp;
            }
            else{
                tmp = high;
                low = Math.max(low-b[i],1);
                high =tmp-b[i];
            }
        }
        if(low > high){
            out.println(-1);
            return;
        }
        long[] c = new long[n+1];
        c[n] = low;
        for(int i = n-1; i >= 0; i--){
            if(i%2==0){
                c[i] = b[i] - c[i+1];
            }
            else{
                c[i] = b[i] + c[i+1];
            }
        }
        out.println(n+1);
        for(int i = 0; i <= n; i++){
            out.println(c[i]);
        }

    }

    private static void dp(){

    }
        
    void run() throws Exception
    {
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
        
        long s = System.currentTimeMillis();
        solve();
        out.flush();
        if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
    }
    
    public static void main(String[] args) throws Exception { new Main().run(); }
    
    private byte[] inbuf = new byte[1024];
    private int lenbuf = 0, ptrbuf = 0;
    
    private int readByte()
    {
        if(lenbuf == -1)throw new InputMismatchException();
        if(ptrbuf >= lenbuf){
            ptrbuf = 0;
            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
            if(lenbuf <= 0)return -1;
        }
        return inbuf[ptrbuf++];
    }
    
    private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
    private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
    
    private double nd() { return Double.parseDouble(ns()); }
    private char nc() { return (char)skip(); }
    
    private String ns()
    {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b) && b != ' ')){
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    
    private char[] ns(int n)
    {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while(p < n && !(isSpaceChar(b))){
            buf[p++] = (char)b;
            b = readByte();
        }
        return n == p ? buf : Arrays.copyOf(buf, p);
    }
    
    private char[][] nm(int n, int m)
    {
        char[][] map = new char[n][];
        for(int i = 0;i < n;i++)map[i] = ns(m);
        return map;
    }
    
    private int[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }
    
    private int ni()
    {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private long nl()
    {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0