結果
問題 | No.652 E869120 and TimeZone |
ユーザー | McGregorsh |
提出日時 | 2023-05-16 23:20:48 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,735 bytes |
コンパイル時間 | 295 ms |
コンパイル使用メモリ | 82,432 KB |
実行使用メモリ | 89,856 KB |
最終ジャッジ日時 | 2024-05-08 15:48:21 |
合計ジャッジ時間 | 7,578 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 166 ms
89,856 KB |
testcase_02 | AC | 170 ms
89,344 KB |
testcase_03 | AC | 165 ms
89,600 KB |
testcase_04 | WA | - |
testcase_05 | AC | 164 ms
89,600 KB |
testcase_06 | AC | 165 ms
89,600 KB |
testcase_07 | AC | 166 ms
89,472 KB |
testcase_08 | AC | 164 ms
89,600 KB |
testcase_09 | AC | 166 ms
89,600 KB |
testcase_10 | AC | 166 ms
89,472 KB |
testcase_11 | AC | 165 ms
89,600 KB |
testcase_12 | AC | 167 ms
89,216 KB |
testcase_13 | AC | 168 ms
89,600 KB |
testcase_14 | AC | 165 ms
89,600 KB |
testcase_15 | AC | 164 ms
89,600 KB |
testcase_16 | AC | 164 ms
89,728 KB |
testcase_17 | AC | 170 ms
89,216 KB |
testcase_18 | AC | 165 ms
89,600 KB |
testcase_19 | AC | 166 ms
89,344 KB |
testcase_20 | AC | 167 ms
89,600 KB |
testcase_21 | AC | 166 ms
89,600 KB |
testcase_22 | AC | 164 ms
89,600 KB |
testcase_23 | AC | 166 ms
89,344 KB |
testcase_24 | AC | 168 ms
89,600 KB |
testcase_25 | AC | 165 ms
89,728 KB |
testcase_26 | AC | 170 ms
89,600 KB |
testcase_27 | AC | 167 ms
89,216 KB |
testcase_28 | AC | 169 ms
89,600 KB |
testcase_29 | AC | 168 ms
89,600 KB |
testcase_30 | AC | 167 ms
89,600 KB |
testcase_31 | AC | 168 ms
89,600 KB |
testcase_32 | AC | 168 ms
89,216 KB |
testcase_33 | AC | 165 ms
89,472 KB |
testcase_34 | AC | 168 ms
89,728 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()