結果
問題 | No.1650 Moving Coins |
ユーザー | McGregorsh |
提出日時 | 2022-07-23 12:16:14 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,823 bytes |
コンパイル時間 | 364 ms |
コンパイル使用メモリ | 86,916 KB |
実行使用メモリ | 161,228 KB |
最終ジャッジ日時 | 2023-09-18 07:45:12 |
合計ジャッジ時間 | 16,658 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 255 ms
92,472 KB |
testcase_02 | AC | 258 ms
92,596 KB |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | AC | 421 ms
127,668 KB |
testcase_09 | WA | - |
testcase_10 | AC | 415 ms
128,364 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 | WA | - |
testcase_20 | AC | 455 ms
161,012 KB |
testcase_21 | WA | - |
testcase_22 | AC | 478 ms
156,260 KB |
testcase_23 | AC | 462 ms
156,324 KB |
testcase_24 | AC | 324 ms
94,272 KB |
testcase_25 | AC | 325 ms
94,192 KB |
testcase_26 | AC | 362 ms
161,228 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() B = i_list() ans = 0 lines = [] for i in range(n): score = B[i] - A[i] ans += abs(score) if score < 0: lines.append([0, abs(score)]) else: lines.append([1, abs(score)]) print(ans) for i in range(n): point, cost = lines[i] for j in range(cost): if point == 0: print(i+1, 'L') else: print(i+1, 'R') if __name__ == '__main__': main()