結果

問題 No.2531 Coloring Vertices on Namori
ユーザー ゆにぽけゆにぽけ
提出日時 2023-11-04 10:45:59
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 157 ms / 2,000 ms
コード長 3,434 bytes
コンパイル時間 1,417 ms
コンパイル使用メモリ 131,620 KB
実行使用メモリ 36,064 KB
最終ジャッジ日時 2024-09-25 21:55:01
合計ジャッジ時間 6,062 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 6 ms
9,600 KB
testcase_01 AC 5 ms
9,600 KB
testcase_02 AC 5 ms
9,600 KB
testcase_03 AC 5 ms
9,728 KB
testcase_04 AC 5 ms
9,600 KB
testcase_05 AC 84 ms
36,056 KB
testcase_06 AC 6 ms
9,600 KB
testcase_07 AC 84 ms
36,052 KB
testcase_08 AC 157 ms
36,056 KB
testcase_09 AC 152 ms
36,060 KB
testcase_10 AC 146 ms
36,052 KB
testcase_11 AC 53 ms
16,840 KB
testcase_12 AC 52 ms
17,004 KB
testcase_13 AC 54 ms
16,876 KB
testcase_14 AC 137 ms
35,932 KB
testcase_15 AC 135 ms
36,064 KB
testcase_16 AC 136 ms
36,064 KB
testcase_17 AC 5 ms
9,600 KB
testcase_18 AC 4 ms
9,472 KB
testcase_19 AC 5 ms
9,472 KB
testcase_20 AC 101 ms
17,664 KB
testcase_21 AC 98 ms
17,536 KB
testcase_22 AC 124 ms
17,456 KB
testcase_23 AC 112 ms
17,664 KB
testcase_24 AC 123 ms
17,664 KB
testcase_25 AC 113 ms
17,408 KB
testcase_26 AC 114 ms
17,408 KB
testcase_27 AC 115 ms
17,536 KB
testcase_28 AC 116 ms
17,664 KB
testcase_29 AC 127 ms
17,664 KB
testcase_30 AC 121 ms
17,536 KB
testcase_31 AC 116 ms
17,616 KB
testcase_32 AC 126 ms
17,664 KB
testcase_33 AC 122 ms
17,536 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cassert>
#include<cmath>
#include<ctime>
#include<iomanip>
#include<numeric>
#include<stack>
#include<queue>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<bitset>
#include<random>
#include<functional>
#include<utility>
using namespace std;
template<int m> struct modint
{
	private:
	unsigned int value;
	static constexpr int mod() {return m;}

	public:
	constexpr modint(const long long x = 0) noexcept
	{
		long long y = x;
		if(y < 0 || y >= mod())
		{
			y %= mod();
			if(y < 0) y += mod();
		}
		value = (unsigned int)y;
	}
	constexpr unsigned int val() noexcept {return value;}
	constexpr modint &operator+=(const modint &other) noexcept
	{
		value += other.value;
		if(value >= mod()) value -= mod();
		return *this;
	}
	constexpr modint &operator-=(const modint &other) noexcept
	{
		unsigned int x = value;
		if(x < other.value) x += mod();
		x -= other.value;
		value = x;
		return *this;
	}
	constexpr modint &operator*=(const modint &other) noexcept
	{
		unsigned long long x = value;
		x *= other.value;
		value = (unsigned int) (x % mod());
		return *this;
	}
	constexpr modint &operator/=(const modint &other) noexcept
	{
		return *this *= other.inverse();
	}
	constexpr modint inverse() const noexcept
	{
		assert(value);
		long long a = value,b = mod(),x = 1,y = 0;
		while(b)
		{
			long long q = a/b;
			a -= q*b; swap(a,b);
			x -= q*y; swap(x,y);
		}
		return modint(x);
	}
	constexpr modint power(long long N) const noexcept
	{
		assert(N >= 0);
		modint p = *this,ret = 1;
		while(N)
		{
			if(N & 1) ret *= p;
			p *= p;
			N >>= 1;
		}
		return ret;
	}
	constexpr modint operator+() {return *this;}
	constexpr modint operator-() {return modint() - *this;}
	constexpr modint &operator++(int) noexcept {return *this += 1;}
	constexpr modint &operator--(int) noexcept {return *this -= 1;}
	friend modint operator+(const modint& lhs, const modint& rhs) {return modint(lhs) += rhs;}
	friend modint operator-(const modint& lhs, const modint& rhs) {return modint(lhs) -= rhs;}
	friend modint operator*(const modint& lhs, const modint& rhs) {return modint(lhs) *= rhs;}
	friend modint operator/(const modint& lhs, const modint& rhs) {return modint(lhs) /= rhs;}
	friend ostream &operator<<(ostream &os,const modint &x) {return os << x.value;}
};
using mint = modint<998244353>;
/* using mint = modint<1000000007>; */
int N,K,seen[2 << 17],fin[2 << 17];
vector<int> G[2 << 17];
void dfs(int u,int p,int &s,vector<int> &path)
{
	seen[u] = 1;
	path.push_back(u);
	for(int v:G[u])if(!fin[v] && v != p)
	{
		if(seen[v])
		{
			s = v;
			return;
		}
		else
		{
			dfs(v,u,s,path);
			if(s >= 0) return;
		}
	}
	fin[u] = 1;
	path.pop_back();
}
void solve()
{
	cin >> N >> K;
	for(int i = 0;i < N;i++)
	{
		int u,v;
		cin >> u >> v;
		u--; v--;
		G[u].push_back(v);
		G[v].push_back(u);
	}
	int s = -1;
	vector<int> path;
	dfs(0,-1,s,path);
	int C = (int)path.size();
	for(int i = 0;i < (int)path.size();i++) if(path[i] == s)
	{
		C -= i;
		break;
	}
	mint ans = 0;
	mint P = mint(K-1).power(C-1),inv = mint(K-1).inverse();
	for(int i = C;i > 1;i--)
	{
		mint p = mint(K)*P;
		if((C-i) & 1) ans -= p;
		else ans += p;
		P *= inv;
	}
	ans *= mint(K-1).power(N-C);
	cout << ans << endl;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	/* cin >> tt; */
	while(tt--) solve();
}
0