#516453 (Java21) No.1120 Strange Teacher

• 問題: No.1120 Strange Teacher
• ユーザー: Apass
• 提出日時: 2020-07-22 22:33:36
• 言語: Java21 (openjdk 21)
• 結果: WA
• 実行時間: -
• コード長: 1,276 bytes
• コンパイル時間: 3,316 ms
• コンパイル使用メモリ: 79,072 KB
• 実行使用メモリ: 49,220 KB
• 最終ジャッジ日時: 2024-06-22 23:17:28
• 合計ジャッジ時間: 9,335 ms
• ジャッジサーバーID （参考情報）: judge4 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	55 ms; 37,320 KB
testcase_01	AC	67 ms; 37,772 KB
testcase_02	WA	-
testcase_03	WA	-
testcase_04	WA	-
testcase_05	AC	264 ms; 47,460 KB
testcase_06	AC	259 ms; 47,468 KB
testcase_07	AC	254 ms; 47,508 KB
testcase_08	AC	257 ms; 46,856 KB
testcase_09	AC	44 ms; 36,416 KB
testcase_10	AC	236 ms; 46,336 KB
testcase_11	AC	253 ms; 46,376 KB
testcase_12	AC	238 ms; 46,656 KB
testcase_13	AC	288 ms; 47,508 KB
testcase_14	AC	281 ms; 47,440 KB
testcase_15	AC	267 ms; 46,868 KB
testcase_16	WA	-
testcase_17	WA	-
testcase_18	AC	64 ms; 37,184 KB
testcase_19	AC	289 ms; 49,220 KB
testcase_20	AC	45 ms; 37,212 KB
testcase_21	AC	44 ms; 36,968 KB
testcase_22	AC	44 ms; 37,168 KB
testcase_23	AC	52 ms; 37,652 KB
testcase_24	AC	255 ms; 47,848 KB
testcase_25	AC	45 ms; 37,092 KB
testcase_26	AC	51 ms; 37,688 KB
testcase_27	WA	-
testcase_28	AC	51 ms; 37,752 KB
testcase_29	AC	45 ms; 37,020 KB

ソースコード

import java.io.*;
import java.math.MathContext;
import java.util.*;

public class StrangeTeacher {
    private static final BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    private static final PrintWriter pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
    private static StringTokenizer st;

    private static int readInt() throws IOException {
        while (st == null || !st.hasMoreTokens()) st = new StringTokenizer(br.readLine());
        return Integer.parseInt(st.nextToken());
    }

    public static void main(String[] args) throws IOException {
        pw.println(solve());
        pw.close();
    }

    private static long solve() throws IOException {
        int N = readInt();
        long[] A = new long[N];
        for (int i = 0; i < N; i++) A[i] = readInt();
        for (int i = 0; i < N; i++) A[i] -= readInt();

        if (N == 2) {
            if (A[0] + A[1] == 0) return Math.abs(A[0]);
            else return -1;
        }

        for (int i = 1; i < N; i++) {
            if ((A[i] - A[0]) % 2 != 0) return -1;
        }

        long sum = Arrays.stream(A).sum();

        if (sum < 0 || sum % (N - 2) != 0 || (sum - A[0]) % 2 != 0) return -1;

        return sum / (N - 2);
    }
}