結果
問題 | No.1635 Let’s Sort Integers!! |
ユーザー | 👑 SPD_9X2 |
提出日時 | 2021-07-30 21:22:08 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 576 ms / 2,000 ms |
コード長 | 1,807 bytes |
コンパイル時間 | 1,278 ms |
コンパイル使用メモリ | 85,936 KB |
実行使用メモリ | 230,464 KB |
最終ジャッジ日時 | 2023-10-14 03:14:36 |
合計ジャッジ時間 | 33,372 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 94 ms
71,596 KB |
testcase_01 | AC | 93 ms
71,208 KB |
testcase_02 | AC | 92 ms
71,208 KB |
testcase_03 | AC | 93 ms
71,324 KB |
testcase_04 | AC | 92 ms
71,132 KB |
testcase_05 | AC | 94 ms
71,344 KB |
testcase_06 | AC | 96 ms
71,148 KB |
testcase_07 | AC | 94 ms
71,456 KB |
testcase_08 | AC | 94 ms
71,556 KB |
testcase_09 | AC | 93 ms
71,212 KB |
testcase_10 | AC | 92 ms
71,412 KB |
testcase_11 | AC | 94 ms
71,208 KB |
testcase_12 | AC | 92 ms
71,112 KB |
testcase_13 | AC | 93 ms
71,380 KB |
testcase_14 | AC | 90 ms
71,380 KB |
testcase_15 | AC | 92 ms
71,312 KB |
testcase_16 | AC | 99 ms
71,344 KB |
testcase_17 | AC | 96 ms
71,644 KB |
testcase_18 | AC | 92 ms
71,400 KB |
testcase_19 | AC | 91 ms
71,568 KB |
testcase_20 | AC | 93 ms
71,460 KB |
testcase_21 | AC | 91 ms
71,592 KB |
testcase_22 | AC | 93 ms
71,320 KB |
testcase_23 | AC | 92 ms
71,312 KB |
testcase_24 | AC | 93 ms
71,156 KB |
testcase_25 | AC | 96 ms
71,508 KB |
testcase_26 | AC | 93 ms
71,316 KB |
testcase_27 | AC | 93 ms
71,372 KB |
testcase_28 | AC | 91 ms
71,456 KB |
testcase_29 | AC | 90 ms
71,376 KB |
testcase_30 | AC | 91 ms
71,416 KB |
testcase_31 | AC | 95 ms
71,608 KB |
testcase_32 | AC | 93 ms
71,452 KB |
testcase_33 | AC | 96 ms
71,484 KB |
testcase_34 | AC | 98 ms
71,208 KB |
testcase_35 | AC | 97 ms
71,136 KB |
testcase_36 | AC | 95 ms
71,372 KB |
testcase_37 | AC | 94 ms
71,448 KB |
testcase_38 | AC | 94 ms
71,212 KB |
testcase_39 | AC | 96 ms
71,404 KB |
testcase_40 | AC | 100 ms
71,592 KB |
testcase_41 | AC | 96 ms
71,360 KB |
testcase_42 | AC | 95 ms
71,464 KB |
testcase_43 | AC | 93 ms
71,388 KB |
testcase_44 | AC | 93 ms
71,140 KB |
testcase_45 | AC | 96 ms
71,144 KB |
testcase_46 | AC | 95 ms
71,316 KB |
testcase_47 | AC | 95 ms
71,360 KB |
testcase_48 | AC | 94 ms
71,488 KB |
testcase_49 | AC | 100 ms
71,992 KB |
testcase_50 | AC | 100 ms
72,220 KB |
testcase_51 | AC | 108 ms
76,152 KB |
testcase_52 | AC | 99 ms
72,004 KB |
testcase_53 | AC | 98 ms
71,472 KB |
testcase_54 | AC | 99 ms
72,032 KB |
testcase_55 | AC | 98 ms
72,104 KB |
testcase_56 | AC | 103 ms
72,124 KB |
testcase_57 | AC | 105 ms
75,892 KB |
testcase_58 | AC | 98 ms
71,144 KB |
testcase_59 | AC | 96 ms
71,440 KB |
testcase_60 | AC | 576 ms
228,328 KB |
testcase_61 | AC | 519 ms
216,140 KB |
testcase_62 | AC | 387 ms
209,924 KB |
testcase_63 | AC | 424 ms
212,656 KB |
testcase_64 | AC | 417 ms
213,520 KB |
testcase_65 | AC | 395 ms
223,684 KB |
testcase_66 | AC | 373 ms
223,884 KB |
testcase_67 | AC | 388 ms
219,848 KB |
testcase_68 | AC | 329 ms
181,848 KB |
testcase_69 | AC | 97 ms
71,380 KB |
testcase_70 | AC | 413 ms
230,464 KB |
testcase_71 | AC | 430 ms
182,120 KB |
testcase_72 | AC | 432 ms
213,876 KB |
testcase_73 | AC | 422 ms
181,800 KB |
testcase_74 | AC | 430 ms
210,160 KB |
testcase_75 | AC | 455 ms
222,016 KB |
testcase_76 | AC | 471 ms
222,196 KB |
testcase_77 | AC | 373 ms
219,176 KB |
testcase_78 | AC | 243 ms
181,980 KB |
testcase_79 | AC | 94 ms
71,520 KB |
ソースコード
""" """ import sys from sys import stdin import itertools from collections import deque N,K = map(int,stdin.readline().split()) OK = K if K < N-1: print (-1) sys.exit() q = deque([i+1 for i in range(N)]) l = [1] q.popleft() r = [N] q.pop() K -= N-1 rem = [] cnt = 0 while q: if cnt % 2 == 0: x = q.popleft() if K-abs(r[-1]-x) >= 0: K -= abs(r[-1]-x) r.append(x) elif (K-abs(l[-1]-x) == 0): K -= abs(l[-1]-x) l.append(x) else: rem.append(x) if len(q) == 0: break x = q.pop() if K-abs(l[-1]-x) >= 0: K -= abs(l[-1]-x) l.append(x) elif (K-abs(r[-1]-x) == 0): K -= abs(r[-1]-x) r.append(x) else: rem.append(x) else: x = q.pop() if K-abs(r[-1]-x) >= 0: K -= abs(r[-1]-x) r.append(x) elif (K-abs(l[-1]-x) == 0): K -= abs(l[-1]-x) l.append(x) else: rem.append(x) if len(q) == 0: break x = q.popleft() if K-abs(l[-1]-x) >= 0: K -= abs(l[-1]-x) l.append(x) elif (K-abs(r[-1]-x) == 0): K -= abs(r[-1]-x) r.append(x) else: rem.append(x) cnt += 1 if K != 0: print (-1) sys.exit() rem.sort() l.reverse() ans = l + rem + r print (*ans) check = 0 for i in range(N-1): check += abs(ans[i]-ans[i+1]) assert check == OK """ p = itertools.permutations([i+1 for i in range(N)], N) maxi = 0 for np in p: lis = list(np) now = 0 for i in range(N-1): now += abs(lis[i+1]-lis[i]) print (now,lis) maxi = max(now,maxi) print (maxi) """