結果
問題 | No.123 カードシャッフル |
ユーザー | McGregorsh |
提出日時 | 2023-03-16 00:39:45 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 189 ms / 5,000 ms |
コード長 | 1,609 bytes |
コンパイル時間 | 295 ms |
コンパイル使用メモリ | 81,808 KB |
実行使用メモリ | 101,352 KB |
最終ジャッジ日時 | 2023-10-18 12:39:48 |
合計ジャッジ時間 | 3,703 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 144 ms
88,512 KB |
testcase_01 | AC | 142 ms
88,516 KB |
testcase_02 | AC | 143 ms
88,512 KB |
testcase_03 | AC | 144 ms
88,516 KB |
testcase_04 | AC | 145 ms
88,516 KB |
testcase_05 | AC | 145 ms
88,512 KB |
testcase_06 | AC | 143 ms
88,520 KB |
testcase_07 | AC | 144 ms
88,524 KB |
testcase_08 | AC | 142 ms
88,512 KB |
testcase_09 | AC | 142 ms
88,508 KB |
testcase_10 | AC | 163 ms
100,564 KB |
testcase_11 | AC | 179 ms
101,352 KB |
testcase_12 | AC | 188 ms
101,260 KB |
testcase_13 | AC | 189 ms
101,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, M = i_map() a = i_list() nums = [i for i in range(1, N+1)] for i in range(M): a[i] -= 1 L = nums[:a[i]] R = nums[a[i]+1:] C = [nums[a[i]]] #print(L, R, C) nums = C + L + R #print(nums) print(nums[0]) if __name__ == '__main__': main()