結果

問題 No.652 E869120 and TimeZone
ユーザー McGregorshMcGregorsh
提出日時 2022-07-01 23:49:21
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 3,013 bytes
コンパイル時間 352 ms
コンパイル使用メモリ 86,836 KB
実行使用メモリ 93,432 KB
最終ジャッジ日時 2023-08-17 11:36:07
合計ジャッジ時間 11,895 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 WA -
testcase_02 AC 239 ms
93,160 KB
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 AC 242 ms
92,964 KB
testcase_08 WA -
testcase_09 WA -
testcase_10 AC 238 ms
93,164 KB
testcase_11 WA -
testcase_12 WA -
testcase_13 AC 240 ms
93,220 KB
testcase_14 AC 239 ms
93,028 KB
testcase_15 WA -
testcase_16 AC 240 ms
92,868 KB
testcase_17 AC 245 ms
93,172 KB
testcase_18 AC 244 ms
93,164 KB
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 AC 236 ms
93,200 KB
testcase_24 WA -
testcase_25 AC 239 ms
93,216 KB
testcase_26 AC 239 ms
92,972 KB
testcase_27 WA -
testcase_28 AC 243 ms
93,140 KB
testcase_29 AC 240 ms
92,872 KB
testcase_30 AC 243 ms
93,032 KB
testcase_31 AC 241 ms
92,868 KB
testcase_32 AC 240 ms
92,972 KB
testcase_33 AC 239 ms
93,272 KB
testcase_34 AC 243 ms
93,144 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys, re
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
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 = input().split()
   ia = int(a)
   ib = int(b)
   base = 9
   
   if s[3] == '+':
   	  hugou = 1
   else:
   	  hugou = -1
   
   zisa = base - (hugou * float(s[4:]))
   zisa *= -1
   #print(zisa)
   if zisa.is_integer():
   	  numa = ia + zisa
   	  if numa >= 24:
   	  	  numa -= 24
   	  if numa < 0:
   	  	  numa = 24 + numa
   	  if numa >= 10:
   	  	  print(str(int(numa)) + ':' + b)
   	  else:
   	  	  print('0' + str(int(numa)) + ':' + b)
   else:
   	  hour_zisa = int(zisa)
   	  mini_zisa = zisa - int(zisa)
   	  mini_zisa *= 60
   	  if hour_zisa > 0:
   	  	  ib += mini_zisa
   	  	  if ib > 59:
   	  	  	  ib -= 60
   	  	  	  hour_zisa += 1
   	  	  ia += hour_zisa
   	  	  if ia > 23:
   	  	  	  ia -= 24
   	  	  ia = int(ia)
   	  	  ib = int(ib)
   	  	  if ia >= 10 and ib >= 10:
   	  	  	  print(str(ia) + ':' + str(ib))
   	  	  elif ia >= 10 and ib < 10:
   	  	  	  print(str(ia) + ':' + '0' + str(ib))
   	  	  elif ia < 10 and ib >= 10:
   	  	  	  print('0' + str(ia) + ':' +  str(ib))
   	  	  elif ia < 10 and ib < 10:
   	  	  	  print('0' + str(ia) + ':' + '0' + str(ib))
   	  else:
   	  	  ib += mini_zisa
   	  	  if ib < 0:
   	  	  	  ib = 60 + ib
   	  	  	  hour_zisa -= 1
   	  	  ia += hour_zisa
   	  	  if ia < 0:
   	  	  	  ia = 24 + ia
   	  	  ia = int(ia)
   	  	  ib = int(ib)
   	  	  if ia >= 10 and ib >= 10:
   	  	  	  print(str(ia) + ':' + str(ib))
   	  	  elif ia >= 10 and ib < 10:
   	  	  	  print(str(ia) + ':' + '0' + str(ib))
   	  	  elif ia < 10 and ib >= 10:
   	  	  	  print('0' + str(ia) + ':' +  str(ib))
   	  	  elif ia < 10 and ib < 10:
   	  	  	  print('0' + str(ia) + ':' + '0' + str(ib))
   	  
   	  
   	  
   
   
if __name__ == '__main__':
    main()
0