結果
問題 | No.139 交差点 |
ユーザー | McGregorsh |
提出日時 | 2022-10-26 14:14:29 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 243 ms / 5,000 ms |
コード長 | 1,803 bytes |
コンパイル時間 | 392 ms |
コンパイル使用メモリ | 87,300 KB |
実行使用メモリ | 92,476 KB |
最終ジャッジ日時 | 2023-09-17 07:10:34 |
合計ジャッジ時間 | 9,393 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 239 ms
92,304 KB |
testcase_01 | AC | 239 ms
92,336 KB |
testcase_02 | AC | 233 ms
92,320 KB |
testcase_03 | AC | 236 ms
92,284 KB |
testcase_04 | AC | 234 ms
92,416 KB |
testcase_05 | AC | 238 ms
92,308 KB |
testcase_06 | AC | 237 ms
92,304 KB |
testcase_07 | AC | 239 ms
92,292 KB |
testcase_08 | AC | 235 ms
92,412 KB |
testcase_09 | AC | 236 ms
92,320 KB |
testcase_10 | AC | 232 ms
92,196 KB |
testcase_11 | AC | 234 ms
92,132 KB |
testcase_12 | AC | 231 ms
92,376 KB |
testcase_13 | AC | 237 ms
92,388 KB |
testcase_14 | AC | 236 ms
92,476 KB |
testcase_15 | AC | 235 ms
92,416 KB |
testcase_16 | AC | 234 ms
92,112 KB |
testcase_17 | AC | 236 ms
92,376 KB |
testcase_18 | AC | 236 ms
92,424 KB |
testcase_19 | AC | 243 ms
92,132 KB |
testcase_20 | AC | 241 ms
92,324 KB |
testcase_21 | AC | 239 ms
92,188 KB |
testcase_22 | AC | 236 ms
92,300 KB |
testcase_23 | AC | 241 ms
92,388 KB |
testcase_24 | AC | 237 ms
92,436 KB |
testcase_25 | AC | 234 ms
92,196 KB |
testcase_26 | AC | 234 ms
92,392 KB |
testcase_27 | AC | 234 ms
92,308 KB |
testcase_28 | AC | 233 ms
92,264 KB |
testcase_29 | AC | 235 ms
92,272 KB |
testcase_30 | AC | 236 ms
92,264 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(): N, L = i_map() time = 0 point = 0 for i in range(N): X, W, T = i_map() time += X - point gree = time // T if gree % 2 == 0: if T - time % T >= W: time += W else: time += (T - time % T) + T + W else: matitime = T - time % T time += matitime time += W point = X + W time += L - point print(time) if __name__ == '__main__': main()