結果
問題 | No.1147 土偶Ⅱ |
ユーザー | McGregorsh |
提出日時 | 2022-07-11 22:03:23 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 314 ms / 500 ms |
コード長 | 2,351 bytes |
コンパイル時間 | 948 ms |
コンパイル使用メモリ | 87,148 KB |
実行使用メモリ | 95,304 KB |
最終ジャッジ日時 | 2023-09-04 19:03:17 |
合計ジャッジ時間 | 8,962 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 240 ms
92,160 KB |
testcase_01 | AC | 240 ms
91,960 KB |
testcase_02 | AC | 239 ms
92,192 KB |
testcase_03 | AC | 240 ms
91,956 KB |
testcase_04 | AC | 298 ms
93,764 KB |
testcase_05 | AC | 252 ms
93,180 KB |
testcase_06 | AC | 311 ms
95,220 KB |
testcase_07 | AC | 285 ms
93,652 KB |
testcase_08 | AC | 259 ms
93,212 KB |
testcase_09 | AC | 314 ms
95,304 KB |
testcase_10 | AC | 298 ms
94,080 KB |
testcase_11 | AC | 293 ms
93,588 KB |
testcase_12 | AC | 286 ms
93,420 KB |
testcase_13 | AC | 280 ms
93,892 KB |
testcase_14 | AC | 296 ms
93,956 KB |
testcase_15 | AC | 285 ms
93,840 KB |
testcase_16 | AC | 269 ms
93,244 KB |
testcase_17 | AC | 256 ms
92,556 KB |
testcase_18 | AC | 255 ms
93,228 KB |
testcase_19 | AC | 296 ms
94,248 KB |
testcase_20 | AC | 243 ms
92,412 KB |
testcase_21 | AC | 239 ms
92,288 KB |
testcase_22 | AC | 294 ms
94,212 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, m = i_map() nums = [[] for i in range(n)] for i in range(m): a, b = i_map() a -= 1 b -= 1 nums[a].append(b) nums[b].append(a) count = [set() for i in range(n)] for i in range(n): for j in nums[i]: for k in nums[j]: if k in nums[i]: continue if k == i: continue count[i].add(k) #print(count) ans = 0 for i in range(n): for j in range(i+1, n): for k in range(j+1, n): score = 0 if i not in count[j]: score += 1 if i not in count[k]: score += 1 if j not in count[i]: score += 1 if j not in count[k]: score += 1 if k not in count[i]: score += 1 if k not in count[j]: score += 1 if score == 6: ans += 1 print(ans) if __name__ == '__main__': main()