結果
問題 | No.1120 Strange Teacher |
ユーザー | McGregorsh |
提出日時 | 2023-07-13 13:45:18 |
言語 | PyPy3 (7.3.15) |
結果 |
RE
|
実行時間 | - |
コード長 | 1,910 bytes |
コンパイル時間 | 1,778 ms |
コンパイル使用メモリ | 86,736 KB |
実行使用メモリ | 113,512 KB |
最終ジャッジ日時 | 2023-10-13 02:47:18 |
合計ジャッジ時間 | 13,892 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 246 ms
89,968 KB |
testcase_01 | AC | 248 ms
90,032 KB |
testcase_02 | AC | 251 ms
90,772 KB |
testcase_03 | AC | 251 ms
90,840 KB |
testcase_04 | AC | 286 ms
111,432 KB |
testcase_05 | AC | 285 ms
111,452 KB |
testcase_06 | AC | 281 ms
111,388 KB |
testcase_07 | AC | 286 ms
111,368 KB |
testcase_08 | AC | 280 ms
111,672 KB |
testcase_09 | AC | 242 ms
89,924 KB |
testcase_10 | AC | 282 ms
110,548 KB |
testcase_11 | AC | 284 ms
110,644 KB |
testcase_12 | AC | 279 ms
110,640 KB |
testcase_13 | AC | 278 ms
111,072 KB |
testcase_14 | AC | 283 ms
111,380 KB |
testcase_15 | AC | 282 ms
111,408 KB |
testcase_16 | AC | 285 ms
110,988 KB |
testcase_17 | AC | 282 ms
111,360 KB |
testcase_18 | AC | 244 ms
89,952 KB |
testcase_19 | AC | 281 ms
109,740 KB |
testcase_20 | RE | - |
testcase_21 | RE | - |
testcase_22 | AC | 244 ms
90,040 KB |
testcase_23 | AC | 245 ms
90,068 KB |
testcase_24 | AC | 286 ms
113,512 KB |
testcase_25 | RE | - |
testcase_26 | AC | 246 ms
90,116 KB |
testcase_27 | AC | 243 ms
89,960 KB |
testcase_28 | AC | 247 ms
89,952 KB |
testcase_29 | AC | 248 ms
89,908 KB |
ソースコード
import sys from sys import stdin from fractions import Fraction import math from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce, lru_cache from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(stdin.readline()) def i_map(): return map(int, stdin.readline().split()) def i_list(): return list(i_map()) def s_input(): return stdin.readline()[:-1] def s_map(): return s_input().split() def s_list(): return list(s_map()) def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 alpa = 'abcdefghijklmnopqrstuvwxyz' ALPA = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' def main(): N = int(input()) A = i_list() B = i_list() Asum = sum(A) Bsum = sum(B) if (Asum - Bsum) % (N-2) != 0: print(-1) exit() cost = (Asum - Bsum) // (N-2) score = 0 for i in range(N): point = B[i] - A[i] if point % 2 != cost % 2: print(-1) exit() if point >= 0: amari = cost - point if amari < 0: print(-1) exit() score += point + amari // 2 else: amari = (cost + point) // 2 if amari < 0: print(-1) exit() score += amari if score == cost: print(cost) else: print(-1) if __name__ == '__main__': main()