結果
問題 | No.1486 ロボット |
ユーザー | nephrologist |
提出日時 | 2021-04-24 12:44:41 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,934 bytes |
コンパイル時間 | 297 ms |
コンパイル使用メモリ | 86,708 KB |
実行使用メモリ | 77,776 KB |
最終ジャッジ日時 | 2023-09-17 13:34:36 |
合計ジャッジ時間 | 3,218 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 86 ms
71,552 KB |
testcase_01 | AC | 81 ms
71,448 KB |
testcase_02 | AC | 81 ms
71,564 KB |
testcase_03 | AC | 82 ms
71,352 KB |
testcase_04 | AC | 79 ms
71,500 KB |
testcase_05 | AC | 82 ms
71,452 KB |
testcase_06 | AC | 125 ms
77,776 KB |
testcase_07 | AC | 129 ms
77,596 KB |
testcase_08 | AC | 118 ms
77,472 KB |
testcase_09 | AC | 79 ms
71,368 KB |
testcase_10 | AC | 88 ms
75,788 KB |
testcase_11 | WA | - |
testcase_12 | AC | 79 ms
71,296 KB |
testcase_13 | WA | - |
testcase_14 | AC | 121 ms
77,612 KB |
testcase_15 | AC | 106 ms
76,548 KB |
testcase_16 | AC | 113 ms
77,416 KB |
testcase_17 | AC | 116 ms
77,304 KB |
testcase_18 | AC | 98 ms
76,216 KB |
testcase_19 | AC | 96 ms
75,924 KB |
ソースコード
import sys from heapq import heappop, heappush from math import gcd input = sys.stdin.buffer.readline a, b, c, d, e = map(int, input().split()) g = gcd(a + b, c + d) lcm = (a + b) * (c + d) // g temp = 0 events = [] while temp < lcm: heappush(events, (temp, 1)) heappush(events, (temp + a, -1)) temp += a + b temp = 0 while temp < lcm: heappush(events, (temp, 2)) heappush(events, (temp + c, -2)) temp += c + d # print("events1", events) score_cycle = 0 flag1 = 0 flag2 = 0 now = 0 onflag = 0 while events: temp, num = heappop(events) # print("tn", temp, num) if num == 1: flag1 = 1 elif num == 2: flag2 = 1 elif num == -1: flag1 = 0 else: flag2 = 0 if flag1 == 1 and flag2 == 1: onflag = 1 now = temp elif flag1 == 0: if onflag: score_cycle += temp - now onflag = 0 elif flag2 == 0: if onflag: score_cycle += temp - now onflag = 0 events = [] lim = e % lcm temp = 0 while temp < lim: heappush(events, (temp, 1)) temp += a if temp > lim: break heappush(events, (temp, -1)) temp += b temp = 0 while temp < lim: heappush(events, (temp, 2)) temp += c if temp > lim: break heappush(events, (temp, -2)) temp += d # print("events2", events) score_rem = 0 flag1 = 0 flag2 = 0 now = 0 onflag = 0 while events: temp, num = heappop(events) if num == 1: flag1 = 1 elif num == 2: flag2 = 1 elif num == -1: flag1 = 0 else: flag2 = 0 if flag1 == 1 and flag2 == 1: onflag = 1 now = temp elif flag1 == 0: if onflag: score_rem += temp - now onflag = 0 elif flag2 == 0: if onflag: score_rem += temp - now onflag = 0 ans = (e // lcm) * score_cycle + score_rem print(ans)