結果

問題 No.2531 Coloring Vertices on Namori
ユーザー StanMarshStanMarsh
提出日時 2023-11-04 17:27:54
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 636 ms / 2,000 ms
コード長 6,383 bytes
コンパイル時間 535 ms
コンパイル使用メモリ 81,884 KB
実行使用メモリ 184,196 KB
最終ジャッジ日時 2023-11-04 17:28:12
合計ジャッジ時間 18,001 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 150 ms
89,520 KB
testcase_01 AC 149 ms
89,524 KB
testcase_02 AC 150 ms
89,520 KB
testcase_03 AC 150 ms
89,524 KB
testcase_04 AC 150 ms
89,524 KB
testcase_05 AC 422 ms
160,792 KB
testcase_06 AC 152 ms
89,524 KB
testcase_07 AC 447 ms
160,792 KB
testcase_08 AC 581 ms
156,568 KB
testcase_09 AC 591 ms
156,568 KB
testcase_10 AC 602 ms
156,568 KB
testcase_11 AC 339 ms
184,192 KB
testcase_12 AC 340 ms
184,196 KB
testcase_13 AC 339 ms
184,192 KB
testcase_14 AC 621 ms
158,416 KB
testcase_15 AC 597 ms
158,680 KB
testcase_16 AC 622 ms
158,416 KB
testcase_17 AC 150 ms
89,524 KB
testcase_18 AC 150 ms
89,520 KB
testcase_19 AC 150 ms
89,524 KB
testcase_20 AC 634 ms
152,404 KB
testcase_21 AC 608 ms
152,404 KB
testcase_22 AC 633 ms
150,028 KB
testcase_23 AC 610 ms
152,668 KB
testcase_24 AC 624 ms
152,140 KB
testcase_25 AC 603 ms
152,140 KB
testcase_26 AC 602 ms
150,820 KB
testcase_27 AC 617 ms
150,028 KB
testcase_28 AC 605 ms
152,668 KB
testcase_29 AC 624 ms
152,404 KB
testcase_30 AC 612 ms
150,556 KB
testcase_31 AC 630 ms
150,292 KB
testcase_32 AC 597 ms
152,664 KB
testcase_33 AC 636 ms
150,556 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

from random import getrandbits, randrange
from string import ascii_lowercase, ascii_uppercase
import sys
from math import ceil, floor, sqrt, pi, factorial, gcd, log, log10, log2, inf, cos, sin
from copy import deepcopy, copy
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 lru_cache, reduce
from decimal import Decimal, getcontext
from typing import List, Tuple, Optional


inf = float("inf")


def ceil_div(a, b):
    return (a + b - 1) // b


def isqrt(num):
    res = int(sqrt(num))
    while res * res > num:
        res -= 1
    while (res + 1) * (res + 1) <= num:
        res += 1
    return res


def int1(s):
    return int(s) - 1


from types import GeneratorType


def bootstrap(f, stack=[]):
    def wrapped(*args, **kwargs):
        if stack:
            return f(*args, **kwargs)
        else:
            to = f(*args, **kwargs)
            while True:
                if type(to) is GeneratorType:
                    stack.append(to)
                    to = next(to)
                else:
                    stack.pop()
                    if not stack:
                        break
                    to = stack[-1].send(to)
            return to

    return wrapped


import sys
import os

input = lambda: sys.stdin.readline().rstrip("\r\n")

print = lambda *args, end="\n", sep=" ": sys.stdout.write(
    sep.join(map(str, args)) + end
)


def II():
    return int(input())


def MII(base=0):
    return map(lambda s: int(s) - base, input().split())


def LII(base=0):
    return list(MII(base))


def NA():
    n = II()
    a = LII()
    return n, a


def read_graph(n, m, base=0, directed=False, return_edges=False):

    g = [[] for _ in range(n)]
    edges = []
    for _ in range(m):
        a, b = MII(base)
        if return_edges:
            edges.append((a, b))
        g[a].append(b)
        if not directed:
            g[b].append(a)
    if return_edges:
        return g, edges
    return g


def read_graph_with_weight(n, m, base=0, directed=False, return_edges=False):

    g = [[] for _ in range(n)]
    edges = []
    for _ in range(m):
        a, b, w = MII()
        a, b = a - base, b - base
        if return_edges:
            edges.append((a, b, w))
        g[a].append((b, w))
        if not directed:
            g[b].append((a, w))
    if return_edges:
        return g, edges
    return g


def iterate_tokens():
    for line in sys.stdin:
        for word in line.split():
            yield word


tokens = None


def NI():
    global tokens
    if tokens is None:
        tokens = iterate_tokens()
    return int(next(tokens))


def LNI(n):
    return [NI() for _ in range(n)]


def yes(res):
    print("Yes" if res else "No")


def YES(res):
    print("YES" if res else "NO")


def pairwise(a):
    n = len(a)
    for i in range(n - 1):
        yield a[i], a[i + 1]


def factorial(n):
    return reduce(lambda x, y: x * y, range(1, n + 1))


def cmin(dp, i, x):
    if x < dp[i]:
        dp[i] = x


def cmax(dp, i, x):
    if x > dp[i]:
        dp[i] = x


def alp_a_to_i(s):
    return ord(s) - ord("a")


def alp_A_to_i(s):
    return ord(s) - ord("A")


def alp_i_to_a(i):
    return chr(ord("a") + i)


def alp_i_to_A(i):
    return chr(ord("A") + i)


d4 = [(1, 0), (0, 1), (-1, 0), (0, -1)]
d8 = [(1, 0), (1, 1), (0, 1), (-1, 1), (-1, 0), (-1, -1), (0, -1), (1, -1)]


def ranges(n, m):
    return ((i, j) for i in range(n) for j in range(m))


def valid(i, j, n, m):
    return 0 <= i < n and 0 <= j < m


def ninj(i, j, n, m):
    return [(i + di, j + dj) for di, dj in d4 if valid(i + di, j + dj, n, m)]


def gen(x, *args):
    if len(args) == 1:
        return [x] * args[0]
    if len(args) == 2:
        return [[x] * args[1] for _ in [0] * args[0]]
    if len(args) == 3:
        return [[[x] * args[2] for _ in [0] * args[1]] for _ in [0] * args[0]]
    if len(args) == 4:
        return [
            [[[x] * args[3] for _ in [0] * args[2]] for _ in [0] * args[1]]
            for _ in [0] * args[0]
        ]


list2d = lambda a, b, v: [[v] * b for _ in range(a)]
list3d = lambda a, b, c, v: [[[v] * c for _ in range(b)] for _ in range(a)]


class Debug:
    def __init__(self, debug=False):
        self.debug = debug
        cur_path = os.path.dirname(os.path.abspath(__file__))
        self.local = os.path.exists(cur_path + "/.cph")

    def get_ic(self):
        if self.debug and self.local:
            from icecream import ic

            return ic
        else:
            return lambda *args, **kwargs: ...


from typing import List


class Namori:
    def __init__(self, G: List[List[int]]):
        n = len(G)
        deg = [0] * n
        for v in range(n):
            for x in G[v]:
                deg[x] += 1
        todo = [i for i, x in enumerate(deg) if x == 1]
        cycle = set(range(n))
        while todo:
            v = todo.pop()
            cycle.discard(v)
            for x in G[v]:
                deg[x] -= 1
                if deg[x] == 1:
                    todo.append(x)
        tree = []
        treeid = [-1] * n
        now = 0
        cycle_list = list(cycle)
        for i in cycle_list:
            tmp = []
            todo = [i]
            treeid[i] = now
            while todo:
                v = todo.pop()
                tmp.append(v)
                for x in G[v]:
                    if treeid[x] != -1 or x in cycle:
                        continue
                    todo.append(x)
                    treeid[x] = now
            now += 1
            tree.append(tmp)

        self.cycle = cycle_list
        self.tree = tree
        self.treeid = treeid

    def same_tree(self, u: int, v: int) -> bool:
        return self.treeid[u] == self.treeid[v]

    def get_cycle(self):
        return self.cycle

    def get_tree(self):
        return self.tree


ic = Debug(1).get_ic()


n, k = MII()
mod = 998244353
g = read_graph(n, n, 1)
namori = Namori(g)


m = len(namori.get_cycle())


dp = [0] * (m + 1)
dp[1] = k
dp[2] = k * (k - 1)
for i in range(3, m + 1):

    dp[i] = k * pow(k - 1, i - 1, mod) - dp[i - 1]
    dp[i] %= mod
res = dp[m]
res = res * pow(k - 1, n - m, mod)
res %= mod
print(res)
0