結果
問題 | No.1120 Strange Teacher |
ユーザー | McGregorsh |
提出日時 | 2023-07-13 13:49:32 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 282 ms / 1,000 ms |
コード長 | 2,171 bytes |
コンパイル時間 | 393 ms |
コンパイル使用メモリ | 87,224 KB |
実行使用メモリ | 113,480 KB |
最終ジャッジ日時 | 2023-10-13 02:51:23 |
合計ジャッジ時間 | 10,346 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 240 ms
89,832 KB |
testcase_01 | AC | 235 ms
89,692 KB |
testcase_02 | AC | 245 ms
90,560 KB |
testcase_03 | AC | 245 ms
90,732 KB |
testcase_04 | AC | 271 ms
110,672 KB |
testcase_05 | AC | 273 ms
111,080 KB |
testcase_06 | AC | 276 ms
111,380 KB |
testcase_07 | AC | 276 ms
110,896 KB |
testcase_08 | AC | 276 ms
111,048 KB |
testcase_09 | AC | 241 ms
90,020 KB |
testcase_10 | AC | 265 ms
110,632 KB |
testcase_11 | AC | 278 ms
110,632 KB |
testcase_12 | AC | 273 ms
110,536 KB |
testcase_13 | AC | 271 ms
110,456 KB |
testcase_14 | AC | 272 ms
110,644 KB |
testcase_15 | AC | 282 ms
110,692 KB |
testcase_16 | AC | 275 ms
110,596 KB |
testcase_17 | AC | 271 ms
110,460 KB |
testcase_18 | AC | 236 ms
89,864 KB |
testcase_19 | AC | 280 ms
109,696 KB |
testcase_20 | AC | 237 ms
89,852 KB |
testcase_21 | AC | 234 ms
89,956 KB |
testcase_22 | AC | 239 ms
89,976 KB |
testcase_23 | AC | 239 ms
90,056 KB |
testcase_24 | AC | 274 ms
113,480 KB |
testcase_25 | AC | 240 ms
90,000 KB |
testcase_26 | AC | 241 ms
89,884 KB |
testcase_27 | AC | 235 ms
90,032 KB |
testcase_28 | AC | 240 ms
89,880 KB |
testcase_29 | AC | 241 ms
90,148 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 N == 2: if Asum == Bsum: a = B[0] - A[0] b = B[1] - A[1] if a != b and abs(a) == abs(b): print(abs(a)) exit() else: print(-1) else: print(-1) exit() 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()