結果
問題 | No.1650 Moving Coins |
ユーザー | McGregorsh |
提出日時 | 2022-07-23 13:52:53 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,152 bytes |
コンパイル時間 | 859 ms |
コンパイル使用メモリ | 86,120 KB |
実行使用メモリ | 163,504 KB |
最終ジャッジ日時 | 2023-09-18 10:15:48 |
合計ジャッジ時間 | 16,494 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 238 ms
91,980 KB |
testcase_02 | AC | 241 ms
92,476 KB |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | AC | 404 ms
128,828 KB |
testcase_09 | WA | - |
testcase_10 | AC | 399 ms
129,512 KB |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | AC | 422 ms
136,032 KB |
testcase_20 | AC | 462 ms
163,256 KB |
testcase_21 | AC | 494 ms
158,036 KB |
testcase_22 | AC | 421 ms
161,536 KB |
testcase_23 | AC | 427 ms
162,644 KB |
testcase_24 | AC | 311 ms
94,128 KB |
testcase_25 | AC | 298 ms
94,200 KB |
testcase_26 | AC | 346 ms
163,504 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 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 = int(input()) A = i_list() + [INF] B = i_list() que = deque() ans = 0 lines = [] for i in range(n): if A[i] > B[i]: lines.append([i, 0, A[i] - B[i]]) ans += A[i] - B[i] else: cost = B[i] - A[i] if cost >= A[i+1] - A[i]: que.append([i, cost]) else: lines.append([i, 1, cost]) ans += cost while que: point, gree = que.pop() lines.append([point, 1, gree]) ans += cost print(ans) for i in range(len(lines)): point, muki, count = lines[i] if muki == 0: for j in range(count): print(point+1, 'L') else: for k in range(count): print(point+1, 'R') if __name__ == '__main__': main()