結果
問題 | No.652 E869120 and TimeZone |
ユーザー | McGregorsh |
提出日時 | 2023-05-16 23:20:48 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,735 bytes |
コンパイル時間 | 531 ms |
コンパイル使用メモリ | 86,984 KB |
実行使用メモリ | 92,492 KB |
最終ジャッジ日時 | 2023-08-21 10:29:16 |
合計ジャッジ時間 | 12,832 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 236 ms
92,412 KB |
testcase_02 | AC | 238 ms
92,348 KB |
testcase_03 | AC | 238 ms
92,256 KB |
testcase_04 | WA | - |
testcase_05 | AC | 254 ms
92,160 KB |
testcase_06 | AC | 263 ms
92,308 KB |
testcase_07 | AC | 247 ms
92,236 KB |
testcase_08 | AC | 247 ms
92,232 KB |
testcase_09 | AC | 239 ms
92,408 KB |
testcase_10 | AC | 241 ms
92,244 KB |
testcase_11 | AC | 243 ms
92,336 KB |
testcase_12 | AC | 242 ms
92,252 KB |
testcase_13 | AC | 244 ms
92,216 KB |
testcase_14 | AC | 241 ms
91,924 KB |
testcase_15 | AC | 243 ms
92,128 KB |
testcase_16 | AC | 244 ms
92,492 KB |
testcase_17 | AC | 242 ms
92,244 KB |
testcase_18 | AC | 247 ms
92,316 KB |
testcase_19 | AC | 239 ms
92,004 KB |
testcase_20 | AC | 239 ms
92,360 KB |
testcase_21 | AC | 238 ms
92,024 KB |
testcase_22 | AC | 237 ms
92,420 KB |
testcase_23 | AC | 238 ms
92,248 KB |
testcase_24 | AC | 236 ms
92,304 KB |
testcase_25 | AC | 237 ms
92,292 KB |
testcase_26 | AC | 239 ms
92,300 KB |
testcase_27 | AC | 237 ms
92,276 KB |
testcase_28 | AC | 237 ms
92,492 KB |
testcase_29 | AC | 236 ms
92,216 KB |
testcase_30 | AC | 240 ms
92,136 KB |
testcase_31 | AC | 257 ms
92,236 KB |
testcase_32 | AC | 259 ms
92,244 KB |
testcase_33 | AC | 240 ms
92,368 KB |
testcase_34 | AC | 239 ms
92,396 KB |
ソースコード
import sys, re from fractions import Fraction 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 from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] 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 def main(): a, b, s = s_map() a = int(a) b = int(b) if s[3] == '+': base = (float(s[4:]) - 9) * 60 else: base = -(float(s[4:]) + 9) * 60 now = a * 60 + b now += base if now < 0: now = 1440 + now now %= 1440 time1 = now // 60 time2 = now % 60 A = str(int(time1)).zfill(2) B = str(int(time2)).zfill(2) print(A + ':' + B) if __name__ == '__main__': main()