提出 #12315031

---

ソースコード 拡げる

//%std
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
inline int read()
{
	int out = 0, fh = 1;
	char jp = getchar();
	while ((jp > '9' || jp < '0') && jp != '-')
		jp = getchar();
	if (jp == '-')
		fh = -1, jp = getchar();
	while (jp >= '0' && jp <= '9')
		out = out * 10 + jp - '0', jp = getchar();
	return out * fh;
}
const int P = 998244353;
int add(int a, int b)
{
	return a + b >= P ? a + b - P : a + b;
}
void inc(int &a, int b)
{
	a = add(a, b);
}
int mul(int a, int b)
{
	return 1LL * a * b % P;
}
int fpow(int a, int b)
{
	int res = 1;
	while (b)
	{
		if (b & 1)
			res = mul(res, a);
		a = mul(a, a);
		b >>= 1;
	}
	return res;
}
const int N = 1e5 + 10;
vector<int> G[3][N];
int n, m[3], mx = 0, SG[3][N], sum[3][N], cnt[3][N], bucket[N]; 
int main()
{
	n = read();
	for (int k = 0; k < 3; ++k)
	{
		m[k] = read();
		for (int i = 1; i <= m[k]; ++i)
		{
			int u = read(), v = read();
			if (u > v)
				swap(u, v);
			G[k][u].push_back(v);
		}
		for (int i = n; i >= 1; --i)
		{
			for (int x : G[k][i])
				bucket[SG[k][x]] = 1;
			for (int val = 0; val <= mx + 1; ++val)
				if (!bucket[val])
				{
					SG[k][i] = val;
					mx = max(mx, val);
					break;
				}
			inc(sum[k][SG[k][i]], fpow(10, 18 * i));
			for (int x : G[k][i])
				bucket[SG[k][x]] = 0;
		}
	}
	int ans = 0;
	for (int x = 0; x <= mx; ++x) if (sum[0][x])
		for (int y = 0; y <= mx; ++y) if (sum[1][y])
			inc(ans, mul(sum[0][x], mul(sum[1][y], sum[2][x ^ y])));
	printf("%d\n", ans);
	return 0;
}

提出情報

ジャッジ結果