結果
問題 | No.1486 ロボット |
ユーザー | McGregorsh |
提出日時 | 2023-05-10 12:18:22 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 261 ms / 2,000 ms |
コード長 | 2,034 bytes |
コンパイル時間 | 389 ms |
コンパイル使用メモリ | 87,068 KB |
実行使用メモリ | 100,976 KB |
最終ジャッジ日時 | 2023-08-17 18:20:35 |
合計ジャッジ時間 | 6,779 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 241 ms
92,376 KB |
testcase_01 | AC | 236 ms
92,416 KB |
testcase_02 | AC | 228 ms
92,448 KB |
testcase_03 | AC | 237 ms
92,364 KB |
testcase_04 | AC | 233 ms
92,428 KB |
testcase_05 | AC | 242 ms
92,456 KB |
testcase_06 | AC | 258 ms
100,904 KB |
testcase_07 | AC | 261 ms
100,976 KB |
testcase_08 | AC | 245 ms
97,328 KB |
testcase_09 | AC | 239 ms
92,216 KB |
testcase_10 | AC | 248 ms
92,980 KB |
testcase_11 | AC | 244 ms
93,020 KB |
testcase_12 | AC | 243 ms
92,864 KB |
testcase_13 | AC | 236 ms
92,280 KB |
testcase_14 | AC | 252 ms
95,396 KB |
testcase_15 | AC | 253 ms
93,540 KB |
testcase_16 | AC | 249 ms
94,560 KB |
testcase_17 | AC | 257 ms
94,216 KB |
testcase_18 | AC | 249 ms
94,356 KB |
testcase_19 | AC | 244 ms
93,132 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, C, D, E = i_map() E -= 1 AB = A + B CD = C + D lcmab = lcm(AB, CD) flag = [0] * lcmab ab = lcmab // AB for i in range(ab): for j in range(AB): if j < A: flag[i * AB + j] += 1 cd = lcmab // CD for i in range(cd): for j in range(CD): if j < C: flag[i * CD + j] += 1 amari = E % lcmab cycle = E // lcmab cyclecost = 0 amaricost = 0 for i in range(lcmab): if flag[i] == 2: cyclecost += 1 if i <= amari: amaricost += 1 if i == E: print(cyclecost) exit() print(cyclecost * cycle + amaricost) if __name__ == '__main__': main()