結果
問題 | No.1623 三角形の制作 |
ユーザー | McGregorsh |
提出日時 | 2022-07-22 13:55:14 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,592 bytes |
コンパイル時間 | 1,258 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 149,696 KB |
最終ジャッジ日時 | 2024-07-03 21:14:26 |
合計ジャッジ時間 | 21,499 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 130 ms
89,572 KB |
testcase_01 | AC | 131 ms
89,756 KB |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | AC | 132 ms
89,644 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()) R = i_list() G = i_list() B = i_list() count_r = Counter(R) count_g = Counter(G) count_b = Counter(B) set_R = list(set(R)) set_G = list(set(G)) set_B = list(set(B)) set_R.sort() set_G.sort() set_B.sort() #print(set_R) #print(set_G) #print(set_B) cost_R = [0] * 10000 cost_G = [0] * 10000 cost_B = [0] * 10000 for i in range(len(set_R)): cost_R[set_R[i]] += count_r[set_R[i]] for i in range(len(set_G)): cost_G[set_G[i]] += count_g[set_G[i]] for i in range(len(set_B)): cost_B[set_B[i]] += count_b[set_B[i]] accumu_cost_b = list(accumulate(cost_B)) #print(cost_R) #print(cost_G) #print(cost_B) #print(accumu_cost_b) ans = 0 for i in range(len(set_R)): point1 = set_R[i] for j in range(len(set_G)): point2 = set_G[j] if point1 < point2: break left_num = abs(point1 - point2) left_point = bisect_right(set_B, left_num) right_point = bisect_right(set_B, point1) #print(left_point, right_point) ans += accumu_cost_b[right_point] - accumu_cost_b[left_point] #print(ans) print(ans) if __name__ == '__main__': main()