結果
問題 | No.366 ロボットソート |
ユーザー | McGregorsh |
提出日時 | 2022-06-21 18:13:58 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 148 ms / 2,000 ms |
コード長 | 1,849 bytes |
コンパイル時間 | 190 ms |
コンパイル使用メモリ | 82,600 KB |
実行使用メモリ | 89,640 KB |
最終ジャッジ日時 | 2024-10-14 12:28:36 |
合計ジャッジ時間 | 4,339 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 127 ms
83,232 KB |
testcase_01 | AC | 126 ms
83,128 KB |
testcase_02 | AC | 127 ms
83,072 KB |
testcase_03 | AC | 127 ms
83,052 KB |
testcase_04 | AC | 124 ms
83,432 KB |
testcase_05 | AC | 125 ms
83,492 KB |
testcase_06 | AC | 123 ms
83,428 KB |
testcase_07 | AC | 125 ms
83,340 KB |
testcase_08 | AC | 125 ms
83,320 KB |
testcase_09 | AC | 124 ms
83,512 KB |
testcase_10 | AC | 126 ms
83,364 KB |
testcase_11 | AC | 145 ms
89,240 KB |
testcase_12 | AC | 145 ms
89,308 KB |
testcase_13 | AC | 128 ms
83,640 KB |
testcase_14 | AC | 143 ms
88,700 KB |
testcase_15 | AC | 124 ms
83,328 KB |
testcase_16 | AC | 144 ms
89,324 KB |
testcase_17 | AC | 148 ms
89,580 KB |
testcase_18 | AC | 147 ms
89,288 KB |
testcase_19 | AC | 146 ms
89,456 KB |
testcase_20 | AC | 139 ms
88,932 KB |
testcase_21 | AC | 144 ms
89,200 KB |
testcase_22 | AC | 145 ms
89,640 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() a = i_list() sort_a = sorted(a) ans = 0 count = [0] * n for i in range(k): num = [] number = [] for j in range(i, n, k): num.append(a[j]) number.append(j) #print(num) tentou = 0 for aa in range(len(num)-1): for bb in range(aa+1, len(num)): #print(aa, bb) if num[aa] > num[bb]: tentou += 1 num.sort() for i in range(len(num)): count[number[i]] = num[i] ans += tentou #print(ans) #print(count) if sort_a == count: print(ans) else: print(-1) if __name__ == '__main__': main()