結果
問題 | No.1502 Many Simple Additions |
ユーザー | ansain |
提出日時 | 2021-05-07 23:23:20 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 1,035 ms / 2,000 ms |
コード長 | 3,574 bytes |
コンパイル時間 | 801 ms |
コンパイル使用メモリ | 11,228 KB |
実行使用メモリ | 83,064 KB |
最終ジャッジ日時 | 2023-10-13 22:40:54 |
合計ジャッジ時間 | 12,027 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 18 ms
8,848 KB |
testcase_01 | AC | 18 ms
8,812 KB |
testcase_02 | AC | 19 ms
8,816 KB |
testcase_03 | AC | 18 ms
8,856 KB |
testcase_04 | AC | 19 ms
8,796 KB |
testcase_05 | AC | 18 ms
8,952 KB |
testcase_06 | AC | 18 ms
8,740 KB |
testcase_07 | AC | 18 ms
8,828 KB |
testcase_08 | AC | 18 ms
8,824 KB |
testcase_09 | AC | 18 ms
8,800 KB |
testcase_10 | AC | 18 ms
8,756 KB |
testcase_11 | AC | 18 ms
8,940 KB |
testcase_12 | AC | 19 ms
8,920 KB |
testcase_13 | AC | 18 ms
8,828 KB |
testcase_14 | AC | 19 ms
8,824 KB |
testcase_15 | AC | 18 ms
8,952 KB |
testcase_16 | AC | 18 ms
8,796 KB |
testcase_17 | AC | 18 ms
8,764 KB |
testcase_18 | AC | 18 ms
8,816 KB |
testcase_19 | AC | 18 ms
8,820 KB |
testcase_20 | AC | 19 ms
8,776 KB |
testcase_21 | AC | 19 ms
8,832 KB |
testcase_22 | AC | 18 ms
8,832 KB |
testcase_23 | AC | 18 ms
8,768 KB |
testcase_24 | AC | 18 ms
8,808 KB |
testcase_25 | AC | 17 ms
8,820 KB |
testcase_26 | AC | 18 ms
8,820 KB |
testcase_27 | AC | 425 ms
57,568 KB |
testcase_28 | AC | 417 ms
57,624 KB |
testcase_29 | AC | 537 ms
24,588 KB |
testcase_30 | AC | 998 ms
83,064 KB |
testcase_31 | AC | 1,035 ms
82,716 KB |
testcase_32 | AC | 996 ms
82,612 KB |
testcase_33 | AC | 636 ms
69,828 KB |
testcase_34 | AC | 657 ms
71,280 KB |
testcase_35 | AC | 684 ms
69,992 KB |
testcase_36 | AC | 428 ms
59,804 KB |
testcase_37 | AC | 440 ms
59,528 KB |
testcase_38 | AC | 440 ms
63,496 KB |
testcase_39 | AC | 267 ms
40,520 KB |
testcase_40 | AC | 133 ms
19,888 KB |
testcase_41 | AC | 164 ms
13,948 KB |
testcase_42 | AC | 534 ms
63,104 KB |
testcase_43 | AC | 19 ms
8,896 KB |
ソースコード
import sys from collections import defaultdict, Counter, deque from itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate import operator from math import sqrt, gcd, factorial # from math import isqrt, prod,comb # python3.8用(notpypy) #from bisect import bisect_left,bisect_right #from functools import lru_cache,reduce #from heapq import heappush,heappop,heapify,heappushpop,heapreplace #import numpy as np #import networkx as nx #from networkx.utils import UnionFind #from numba import njit, b1, i1, i4, i8, f8 #from scipy.sparse import csr_matrix #from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError # numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1 def input(): return sys.stdin.readline().rstrip() def divceil(n, k): return 1+(n-1)//k # n/kの切り上げを返す def yn(hantei, yes='Yes', no='No'): print(yes if hantei else no) def main(): mod = 10**9+7 mod2 = 998244353 n, m, k = map(int, input().split()) graph = [[] for _ in range(n)] for i in range(m): a, b, c = map(lambda x: int(x)-1, input().split()) graph[a].append((b, c+1)) graph[b].append((a, c+1)) dist = [-1]*n kans = 1 lessk = 1 for i in range(n): if dist[i] != -1: continue dist[i] = [1, 0] d = deque() d.append(i) used = dict() point = set([i]) while d: v = d.popleft() for i, num in graph[v]: used[(v, i)] = num if dist[i] != -1: continue dist[i] = [-dist[v][0], -dist[v][1]+num] point.add(i) d.append(i) kakutei = None for (a, b), num in used.items(): aa1, aa2 = dist[a] bb1, bb2 = dist[b] if aa1+bb1 == 0: if aa2+bb2 != num: print(0) return else: if (num-aa2-bb2) % 2 == 1: print(0) return else: if kakutei == None: kakutei = (num-aa2-bb2)//(aa1+bb1) elif kakutei != (num-aa2-bb2)//(aa1+bb1): print(0) return if kakutei == None: plusmax = max(dist[p][1] if dist[p][0] == 1 else -10**10 for p in point) plusmin = min(dist[p][1] if dist[p][0] == 1 else 10**10 for p in point) minusmax = max(dist[p][1] if dist[p][0] == - 1 else -10**10 for p in point) minusmin = min(dist[p][1] if dist[p][0] == - 1 else 10**10 for p in point) kans *= max(0, min(k-plusmax, minusmin-1) - max(-plusmin+1, -k+minusmax)+1) kans %= mod lessk *= max(0, min(k-1-plusmax, minusmin-1) - max(-plusmin+1, -k+1+minusmax)+1) lessk %= mod else: kans *= int(all(1 <= dist[p][0]*kakutei + dist[p][1] <= k for p in point)) lessk *= int(all(1 <= dist[p][0]*kakutei + dist[p][1] <= k-1 for p in point)) print((kans-lessk)%mod) #print(kans,lessk,kakutei,dist,min(k-plusmax, minusmin+1),max(-plusmin-1, -k+minusmax)) if __name__ == '__main__': main()