結果
問題 | No.652 E869120 and TimeZone |
ユーザー | McGregorsh |
提出日時 | 2023-05-16 23:24:41 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 241 ms / 1,000 ms |
コード長 | 1,740 bytes |
コンパイル時間 | 293 ms |
コンパイル使用メモリ | 87,196 KB |
実行使用メモリ | 92,300 KB |
最終ジャッジ日時 | 2023-08-21 10:33:40 |
合計ジャッジ時間 | 10,455 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 236 ms
92,124 KB |
testcase_01 | AC | 235 ms
92,116 KB |
testcase_02 | AC | 237 ms
91,984 KB |
testcase_03 | AC | 236 ms
92,224 KB |
testcase_04 | AC | 237 ms
92,076 KB |
testcase_05 | AC | 238 ms
92,080 KB |
testcase_06 | AC | 236 ms
92,224 KB |
testcase_07 | AC | 237 ms
92,172 KB |
testcase_08 | AC | 235 ms
92,064 KB |
testcase_09 | AC | 235 ms
92,140 KB |
testcase_10 | AC | 235 ms
92,152 KB |
testcase_11 | AC | 233 ms
92,168 KB |
testcase_12 | AC | 233 ms
92,292 KB |
testcase_13 | AC | 236 ms
92,300 KB |
testcase_14 | AC | 233 ms
92,100 KB |
testcase_15 | AC | 235 ms
91,888 KB |
testcase_16 | AC | 236 ms
92,092 KB |
testcase_17 | AC | 233 ms
92,164 KB |
testcase_18 | AC | 241 ms
92,168 KB |
testcase_19 | AC | 232 ms
92,156 KB |
testcase_20 | AC | 236 ms
91,884 KB |
testcase_21 | AC | 236 ms
92,200 KB |
testcase_22 | AC | 236 ms
91,980 KB |
testcase_23 | AC | 235 ms
92,100 KB |
testcase_24 | AC | 237 ms
92,204 KB |
testcase_25 | AC | 235 ms
92,120 KB |
testcase_26 | AC | 235 ms
92,152 KB |
testcase_27 | AC | 230 ms
91,884 KB |
testcase_28 | AC | 235 ms
91,884 KB |
testcase_29 | AC | 236 ms
92,100 KB |
testcase_30 | AC | 235 ms
92,080 KB |
testcase_31 | AC | 236 ms
92,164 KB |
testcase_32 | AC | 232 ms
91,836 KB |
testcase_33 | AC | 229 ms
92,088 KB |
testcase_34 | AC | 231 ms
92,292 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 = -int((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()