結果
問題 | No.1604 Swap Sort:ONE |
ユーザー | McGregorsh |
提出日時 | 2022-07-21 21:14:43 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 294 ms / 2,000 ms |
コード長 | 1,533 bytes |
コンパイル時間 | 287 ms |
コンパイル使用メモリ | 86,832 KB |
実行使用メモリ | 93,596 KB |
最終ジャッジ日時 | 2023-09-16 03:52:29 |
合計ジャッジ時間 | 9,076 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 254 ms
92,088 KB |
testcase_01 | AC | 250 ms
92,172 KB |
testcase_02 | AC | 248 ms
92,364 KB |
testcase_03 | AC | 250 ms
91,984 KB |
testcase_04 | AC | 252 ms
92,316 KB |
testcase_05 | AC | 265 ms
93,120 KB |
testcase_06 | AC | 266 ms
92,992 KB |
testcase_07 | AC | 293 ms
93,228 KB |
testcase_08 | AC | 291 ms
93,552 KB |
testcase_09 | AC | 294 ms
93,424 KB |
testcase_10 | AC | 289 ms
93,252 KB |
testcase_11 | AC | 292 ms
93,448 KB |
testcase_12 | AC | 291 ms
93,440 KB |
testcase_13 | AC | 291 ms
93,348 KB |
testcase_14 | AC | 289 ms
93,244 KB |
testcase_15 | AC | 292 ms
93,596 KB |
testcase_16 | AC | 292 ms
93,236 KB |
testcase_17 | AC | 272 ms
93,316 KB |
testcase_18 | AC | 267 ms
93,268 KB |
testcase_19 | AC | 281 ms
93,036 KB |
testcase_20 | AC | 262 ms
93,388 KB |
testcase_21 | AC | 289 ms
93,452 KB |
testcase_22 | AC | 276 ms
93,176 KB |
testcase_23 | AC | 254 ms
92,792 KB |
testcase_24 | AC | 249 ms
93,196 KB |
testcase_25 | AC | 282 ms
93,172 KB |
testcase_26 | AC | 265 ms
93,396 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 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 = int(input()) p = i_list() cou = 0 for i in range(n-1): for j in range(i+1, n): if p[i] > p[j]: cou += 1 print(cou) if __name__ == '__main__': main()