結果
問題 | No.1604 Swap Sort:ONE |
ユーザー | McGregorsh |
提出日時 | 2022-07-21 21:14:43 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 177 ms / 2,000 ms |
コード長 | 1,533 bytes |
コンパイル時間 | 201 ms |
コンパイル使用メモリ | 82,048 KB |
実行使用メモリ | 90,720 KB |
最終ジャッジ日時 | 2024-07-03 05:13:51 |
合計ジャッジ時間 | 5,924 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 132 ms
89,484 KB |
testcase_01 | AC | 130 ms
89,216 KB |
testcase_02 | AC | 136 ms
89,472 KB |
testcase_03 | AC | 132 ms
89,088 KB |
testcase_04 | AC | 130 ms
89,728 KB |
testcase_05 | AC | 141 ms
89,728 KB |
testcase_06 | AC | 146 ms
89,964 KB |
testcase_07 | AC | 171 ms
90,112 KB |
testcase_08 | AC | 177 ms
89,984 KB |
testcase_09 | AC | 172 ms
90,240 KB |
testcase_10 | AC | 166 ms
89,984 KB |
testcase_11 | AC | 173 ms
90,496 KB |
testcase_12 | AC | 169 ms
90,112 KB |
testcase_13 | AC | 176 ms
90,720 KB |
testcase_14 | AC | 166 ms
89,856 KB |
testcase_15 | AC | 174 ms
90,720 KB |
testcase_16 | AC | 171 ms
90,368 KB |
testcase_17 | AC | 147 ms
89,984 KB |
testcase_18 | AC | 149 ms
89,472 KB |
testcase_19 | AC | 165 ms
89,984 KB |
testcase_20 | AC | 141 ms
89,984 KB |
testcase_21 | AC | 169 ms
90,368 KB |
testcase_22 | AC | 152 ms
90,240 KB |
testcase_23 | AC | 136 ms
90,020 KB |
testcase_24 | AC | 134 ms
89,728 KB |
testcase_25 | AC | 171 ms
89,932 KB |
testcase_26 | AC | 147 ms
90,112 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()