結果
問題 | No.411 昇順昇順ソート |
ユーザー | McGregorsh |
提出日時 | 2022-06-22 17:29:33 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,172 bytes |
コンパイル時間 | 389 ms |
コンパイル使用メモリ | 82,304 KB |
実行使用メモリ | 93,312 KB |
最終ジャッジ日時 | 2024-04-23 20:53:06 |
合計ジャッジ時間 | 7,195 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 109 ms
83,268 KB |
testcase_01 | AC | 109 ms
83,328 KB |
testcase_02 | AC | 107 ms
83,328 KB |
testcase_03 | AC | 110 ms
83,296 KB |
testcase_04 | AC | 113 ms
83,200 KB |
testcase_05 | AC | 107 ms
83,240 KB |
testcase_06 | AC | 108 ms
83,200 KB |
testcase_07 | AC | 108 ms
83,212 KB |
testcase_08 | AC | 108 ms
83,288 KB |
testcase_09 | AC | 110 ms
83,584 KB |
testcase_10 | AC | 111 ms
83,200 KB |
testcase_11 | AC | 106 ms
83,456 KB |
testcase_12 | AC | 116 ms
83,300 KB |
testcase_13 | AC | 107 ms
83,272 KB |
testcase_14 | AC | 109 ms
83,456 KB |
testcase_15 | AC | 119 ms
83,380 KB |
testcase_16 | AC | 122 ms
83,124 KB |
testcase_17 | AC | 110 ms
83,456 KB |
testcase_18 | AC | 109 ms
83,228 KB |
testcase_19 | AC | 111 ms
83,436 KB |
testcase_20 | AC | 107 ms
83,428 KB |
testcase_21 | AC | 106 ms
83,328 KB |
testcase_22 | AC | 108 ms
83,236 KB |
testcase_23 | AC | 110 ms
83,584 KB |
testcase_24 | AC | 110 ms
83,436 KB |
testcase_25 | AC | 107 ms
83,072 KB |
testcase_26 | AC | 108 ms
83,072 KB |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | AC | 119 ms
83,348 KB |
ソースコード
import sys, re 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 sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): n, k = i_map() nums = [i for i in range(1, n+1)] if n == 2 and k == 1: print(0) exit() def dfs(now, nokori, juge, mozi): if len(nokori) == 0: cou = 0 for i in range(len(mozi)-1): if int(mozi[i]) > int(mozi[i+1]): cou += 1 if cou == 1: ans.add(mozi) #print(mozi) return if juge == 0: for i in range(len(nokori)): if nokori[i] > now: next = nokori[i] nokori.remove(next) dfs(next, nokori, 0, mozi + str(next)) dfs(next, nokori, 1, mozi + str(next)) nokori.insert(0, next) else: next = min(nokori) nokori.remove(next) dfs(next, nokori, 1, mozi + str(next)) nokori.insert(0, next) ans = set() nums.remove(k) dfs(k, nums, 0, str(k)) if k == 1: print(len(ans)) else: print(len(ans)+1) if __name__ == '__main__': main()