結果

問題 No.1502 Many Simple Additions
ユーザー ansainansain
提出日時 2021-05-07 23:22:26
言語 Python3
(3.12.2 + numpy 1.26.4 + scipy 1.12.0)
結果
WA  
実行時間 -
コード長 3,571 bytes
コンパイル時間 428 ms
コンパイル使用メモリ 11,288 KB
実行使用メモリ 83,124 KB
最終ジャッジ日時 2023-10-13 14:44:13
合計ジャッジ時間 9,408 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 20 ms
9,028 KB
testcase_01 AC 20 ms
8,936 KB
testcase_02 AC 18 ms
9,024 KB
testcase_03 AC 18 ms
8,936 KB
testcase_04 AC 18 ms
8,792 KB
testcase_05 AC 18 ms
9,024 KB
testcase_06 AC 19 ms
8,980 KB
testcase_07 AC 18 ms
8,796 KB
testcase_08 AC 18 ms
8,860 KB
testcase_09 WA -
testcase_10 AC 18 ms
9,000 KB
testcase_11 WA -
testcase_12 AC 18 ms
8,836 KB
testcase_13 AC 18 ms
8,984 KB
testcase_14 AC 17 ms
8,980 KB
testcase_15 AC 18 ms
8,920 KB
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 AC 18 ms
8,892 KB
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 AC 18 ms
8,972 KB
testcase_25 AC 17 ms
9,000 KB
testcase_26 AC 17 ms
8,856 KB
testcase_27 AC 413 ms
57,592 KB
testcase_28 AC 404 ms
57,692 KB
testcase_29 AC 514 ms
24,428 KB
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 AC 305 ms
59,716 KB
testcase_38 AC 408 ms
63,540 KB
testcase_39 AC 245 ms
40,536 KB
testcase_40 AC 125 ms
19,856 KB
testcase_41 AC 163 ms
14,084 KB
testcase_42 AC 519 ms
63,144 KB
testcase_43 AC 18 ms
8,804 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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 (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()
0