結果

問題 No.652 E869120 and TimeZone
ユーザー McGregorsh
提出日時 2022-07-01 23:49:21
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 3,013 bytes
コンパイル時間 134 ms
コンパイル使用メモリ 82,312 KB
実行使用メモリ 83,632 KB
最終ジャッジ日時 2024-11-26 07:56:01
合計ジャッジ時間 5,249 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 5
other AC * 13 WA * 17
権限があれば一括ダウンロードができます

ソースコード

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()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0