結果

問題 No.904 サメトロ
ユーザー OlandOland
提出日時 2019-10-12 01:10:15
言語 Java21
(openjdk 21)
結果
AC  
実行時間 93 ms / 1,000 ms
コード長 5,953 bytes
コンパイル時間 2,040 ms
コンパイル使用メモリ 78,220 KB
実行使用メモリ 38,676 KB
最終ジャッジ日時 2024-05-04 13:29:09
合計ジャッジ時間 5,193 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 63 ms
37,348 KB
testcase_01 AC 48 ms
36,872 KB
testcase_02 AC 78 ms
38,604 KB
testcase_03 AC 52 ms
37,312 KB
testcase_04 AC 84 ms
38,308 KB
testcase_05 AC 48 ms
37,088 KB
testcase_06 AC 77 ms
38,416 KB
testcase_07 AC 50 ms
37,088 KB
testcase_08 AC 78 ms
38,276 KB
testcase_09 AC 49 ms
37,268 KB
testcase_10 AC 61 ms
37,300 KB
testcase_11 AC 56 ms
37,256 KB
testcase_12 AC 53 ms
36,980 KB
testcase_13 AC 53 ms
36,908 KB
testcase_14 AC 52 ms
37,248 KB
testcase_15 AC 52 ms
36,960 KB
testcase_16 AC 62 ms
37,308 KB
testcase_17 AC 52 ms
37,292 KB
testcase_18 AC 52 ms
37,288 KB
testcase_19 AC 51 ms
37,268 KB
testcase_20 AC 49 ms
36,716 KB
testcase_21 AC 51 ms
37,248 KB
testcase_22 AC 82 ms
38,676 KB
testcase_23 AC 55 ms
37,288 KB
testcase_24 AC 81 ms
37,608 KB
testcase_25 AC 49 ms
37,192 KB
testcase_26 AC 57 ms
36,908 KB
testcase_27 AC 93 ms
38,524 KB
testcase_28 AC 48 ms
36,784 KB
testcase_29 AC 47 ms
36,912 KB
testcase_30 AC 47 ms
37,164 KB
testcase_31 AC 47 ms
36,948 KB
testcase_32 AC 48 ms
37,320 KB
testcase_33 AC 48 ms
36,940 KB
testcase_34 AC 49 ms
37,388 KB
testcase_35 AC 52 ms
37,044 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.lang.reflect.Array;
import java.util.*;

@SuppressWarnings("unused")
public class Main {
    private FastScanner in = new FastScanner(System.in);
    private PrintWriter out = new PrintWriter(System.out);
    final int MOD = (int)1e9+7;
    long ceil(long a, long b){return (a + b - 1) / b;}

    //A + sumA = B + sumB
    void solve() throws Exception{
        int N = in.nextInt();
        int[] A = new int[N], B = new int[N];
        int sumA = 0, sumB = 0;
        for(int i = 1; i < N; i++){
            A[i] = in.nextInt();
            B[i] = in.nextInt();
            sumA += A[i];
            sumB += B[i];
        }
        int cnt = 0;
        LOOP:for(int a = 0; a <= sumB; a++){
            A[0] = a;
            B[0] = a + sumA - sumB;
            if(B[0] < 0) continue LOOP;
            for(int i = 0; i < N; i++){
                if(!(A[i] <= (B[0] + sumB - B[i]))) continue  LOOP;
                if(!(B[i] <= (A[0] + sumA - A[i]))) continue  LOOP;
            }
            cnt++;
        }
        out.println(cnt);
    }

    //end solve

    public static void main(String[] args) throws Exception {
        new Main().m();
    }

    private void m() throws Exception {
        solve();
        out.flush();
    }

    static class FastScanner {
        Reader input;

        FastScanner() {this(System.in);}
        FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}

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

        long nextLong() {
            try {
                int sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                long ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) return ret * sign;
                    ret *= 10;
                    ret += b - '0';
                }
            } catch (IOException e) {
                e.printStackTrace();
                return -1;
            }
        }

        double nextDouble() {
            try {
                double sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                double ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) break;
                    ret *= 10;
                    ret += b - '0';
                }
                if (b != '.') return sign * ret;
                double div = 1;
                b = input.read();
                while ('0' <= b && b <= '9') {
                    ret *= 10;
                    ret += b - '0';
                    div *= 10;
                    b = input.read();
                }
                return sign * ret / div;
            } catch (IOException e) {
                e.printStackTrace();
                return Double.NaN;
            }
        }

        char nextChar() {
            try {
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                return (char) b;
            } catch (IOException e) {
                e.printStackTrace();
                return 0;
            }
        }

        String nextStr() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                while (b != -1 && !Character.isWhitespace(b)) {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }

        public int[] nextIntArray(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt();
            }
            return res;
        }

        public int[] nextIntArrayDec(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt() - 1;
            }
            return res;
        }

        public int[] nextIntArray1Index(int n) {
            int[] res = new int[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextInt();
            }
            return res;
        }

        public long[] nextLongArray(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong();
            }
            return res;
        }

        public long[] nextLongArrayDec(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong() - 1;
            }
            return res;
        }

        public long[] nextLongArray1Index(int n) {
            long[] res = new long[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextLong();
            }
            return res;
        }

        public double[] nextDoubleArray(int n) {
            double[] res = new double[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextDouble();
            }
            return res;
        }
    }
}
0