結果
問題 | No.723 2つの数の和 |
ユーザー | McGregorsh |
提出日時 | 2022-07-02 16:32:20 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,493 bytes |
コンパイル時間 | 434 ms |
コンパイル使用メモリ | 87,144 KB |
実行使用メモリ | 108,428 KB |
最終ジャッジ日時 | 2023-08-18 07:36:07 |
合計ジャッジ時間 | 8,267 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 220 ms
93,652 KB |
testcase_01 | AC | 222 ms
93,652 KB |
testcase_02 | AC | 221 ms
93,664 KB |
testcase_03 | WA | - |
testcase_04 | RE | - |
testcase_05 | RE | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | RE | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | RE | - |
testcase_14 | RE | - |
testcase_15 | RE | - |
testcase_16 | RE | - |
testcase_17 | RE | - |
testcase_18 | AC | 242 ms
106,524 KB |
testcase_19 | AC | 240 ms
107,792 KB |
testcase_20 | AC | 218 ms
93,480 KB |
testcase_21 | AC | 218 ms
93,632 KB |
testcase_22 | AC | 221 ms
93,452 KB |
testcase_23 | AC | 241 ms
107,508 KB |
testcase_24 | RE | - |
ソースコード
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 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, x = i_map() a = i_list() a.sort() kazu = [0] * (10**5+1) for i in range(n): kazu[a[i]] += 1 ans = 0 for i in range(n): ans += kazu[x-a[i]] print(ans) if __name__ == '__main__': main()