結果
問題 | No.1635 Let’s Sort Integers!! |
ユーザー | Shirotsume |
提出日時 | 2022-07-29 18:37:34 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 498 ms / 2,000 ms |
コード長 | 2,778 bytes |
コンパイル時間 | 789 ms |
コンパイル使用メモリ | 87,108 KB |
実行使用メモリ | 242,412 KB |
最終ジャッジ日時 | 2023-09-26 15:21:28 |
合計ジャッジ時間 | 30,139 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 97 ms
71,664 KB |
testcase_01 | AC | 99 ms
71,356 KB |
testcase_02 | AC | 99 ms
71,540 KB |
testcase_03 | AC | 97 ms
71,416 KB |
testcase_04 | AC | 96 ms
71,588 KB |
testcase_05 | AC | 97 ms
71,516 KB |
testcase_06 | AC | 99 ms
71,416 KB |
testcase_07 | AC | 98 ms
71,528 KB |
testcase_08 | AC | 95 ms
71,612 KB |
testcase_09 | AC | 98 ms
71,364 KB |
testcase_10 | AC | 96 ms
71,504 KB |
testcase_11 | AC | 97 ms
71,596 KB |
testcase_12 | AC | 101 ms
71,412 KB |
testcase_13 | AC | 98 ms
71,348 KB |
testcase_14 | AC | 95 ms
71,672 KB |
testcase_15 | AC | 97 ms
71,664 KB |
testcase_16 | AC | 98 ms
71,668 KB |
testcase_17 | AC | 98 ms
71,288 KB |
testcase_18 | AC | 98 ms
71,364 KB |
testcase_19 | AC | 95 ms
71,596 KB |
testcase_20 | AC | 115 ms
71,356 KB |
testcase_21 | AC | 94 ms
71,364 KB |
testcase_22 | AC | 96 ms
71,608 KB |
testcase_23 | AC | 94 ms
71,660 KB |
testcase_24 | AC | 101 ms
71,500 KB |
testcase_25 | AC | 95 ms
71,588 KB |
testcase_26 | AC | 95 ms
71,360 KB |
testcase_27 | AC | 93 ms
71,480 KB |
testcase_28 | AC | 94 ms
71,592 KB |
testcase_29 | AC | 95 ms
71,608 KB |
testcase_30 | AC | 93 ms
71,592 KB |
testcase_31 | AC | 93 ms
71,588 KB |
testcase_32 | AC | 96 ms
71,612 KB |
testcase_33 | AC | 94 ms
71,660 KB |
testcase_34 | AC | 94 ms
71,556 KB |
testcase_35 | AC | 92 ms
71,352 KB |
testcase_36 | AC | 97 ms
71,648 KB |
testcase_37 | AC | 93 ms
71,696 KB |
testcase_38 | AC | 92 ms
71,548 KB |
testcase_39 | AC | 95 ms
71,308 KB |
testcase_40 | AC | 93 ms
71,256 KB |
testcase_41 | AC | 97 ms
71,360 KB |
testcase_42 | AC | 95 ms
71,480 KB |
testcase_43 | AC | 94 ms
71,416 KB |
testcase_44 | AC | 96 ms
71,416 KB |
testcase_45 | AC | 97 ms
71,512 KB |
testcase_46 | AC | 97 ms
71,668 KB |
testcase_47 | AC | 93 ms
71,312 KB |
testcase_48 | AC | 94 ms
71,312 KB |
testcase_49 | AC | 101 ms
72,152 KB |
testcase_50 | AC | 101 ms
72,120 KB |
testcase_51 | AC | 106 ms
76,064 KB |
testcase_52 | AC | 102 ms
72,324 KB |
testcase_53 | AC | 101 ms
71,416 KB |
testcase_54 | AC | 101 ms
72,068 KB |
testcase_55 | AC | 101 ms
72,008 KB |
testcase_56 | AC | 99 ms
72,032 KB |
testcase_57 | AC | 104 ms
76,052 KB |
testcase_58 | AC | 100 ms
71,208 KB |
testcase_59 | AC | 99 ms
71,412 KB |
testcase_60 | AC | 498 ms
242,412 KB |
testcase_61 | AC | 420 ms
218,324 KB |
testcase_62 | AC | 370 ms
204,736 KB |
testcase_63 | AC | 445 ms
226,076 KB |
testcase_64 | AC | 407 ms
209,028 KB |
testcase_65 | AC | 302 ms
191,660 KB |
testcase_66 | AC | 298 ms
191,104 KB |
testcase_67 | AC | 296 ms
191,632 KB |
testcase_68 | AC | 97 ms
71,464 KB |
testcase_69 | AC | 96 ms
71,580 KB |
testcase_70 | AC | 427 ms
242,400 KB |
testcase_71 | AC | 409 ms
221,192 KB |
testcase_72 | AC | 419 ms
218,676 KB |
testcase_73 | AC | 417 ms
225,700 KB |
testcase_74 | AC | 407 ms
211,176 KB |
testcase_75 | AC | 305 ms
191,500 KB |
testcase_76 | AC | 298 ms
191,512 KB |
testcase_77 | AC | 302 ms
191,288 KB |
testcase_78 | AC | 97 ms
71,472 KB |
testcase_79 | AC | 98 ms
71,320 KB |
ソースコード
import sys input = lambda: sys.stdin.readline().rstrip() ii = lambda: int(input()) mi = lambda: map(int, input().split()) li = lambda: list(mi()) from collections import deque n, k = mi() if n % 2: if n - 1 <= k <= (n * n - 3) // 2: pass else: exit(print(-1)) if k <= n * (n - 1) // 2: q = deque(range(1, n + 1)) ans = [] ans.append(q.popleft()) p = [] f = 0 for i in range(1, n): if i % 2: now = q.pop() if f + abs(ans[-1] - now) <= k: f += abs(ans[-1] - now) ans.append(now) else: p.append(now) else: now = q.popleft() if f + abs(ans[-1] - now) <= k: f += abs(ans[-1] - now) ans.append(now) else: p.append(now) ans = [ans[0]] + list(sorted(p)) + ans[1:] else: x = (n - 1) // 2 + 2 y = 1 ans = [] for i in range(n - 3): if i % 2 == 0: ans.append(x) x += 1 else: ans.append(y) y += 1 ans.append(2 * ((n - 1) // 2) + 1) ans.append((n - 1) // 2) ans.append((n - 1) // 2 + 1) now1 = ans.index((n - 1) // 2 + 2) now2 = ans.index((n - 1) // 2 + 2 + (n * n - 3) // 2 - k) ans[now1], ans[now2] = ans[now2], ans[now1] else: if n - 1 <= k <= (n * n) // 2 - 1: pass else: exit(print(-1)) if k <= n * (n - 1) // 2: q = deque(range(1, n + 1)) ans = [] ans.append(q.popleft()) p = [] f = 0 for i in range(1, n): if i % 2: now = q.pop() if f + abs(ans[-1] - now) <= k: f += abs(ans[-1] - now) ans.append(now) else: p.append(now) else: now = q.popleft() if f + abs(ans[-1] - now) <= k: f += abs(ans[-1] - now) ans.append(now) else: p.append(now) ans = [ans[0]] + list(sorted(p)) + ans[1:] else: x = n // 2 + 1 y = 1 ans = [] for i in range(n): if i % 2: ans.append(y) y += 1 else: ans.append(x) x += 1 now1 = ans.index(n // 2 + 1) now2 = ans.index(n // 2 + 1 + (n * n) // 2 - 1 - k) ans[now1], ans[now2] = ans[now2], ans[now1] cnt = 0 for i in range(n - 1): cnt += abs(ans[i] - ans[i + 1]) assert cnt == k print(*ans)