結果
| 問題 | No.2494 Sum within Components |
| ユーザー |
 siro53
|
| 提出日時 | 2023-10-06 21:37:40 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 59 ms / 2,000 ms |
| コード長 | 6,566 bytes |
| コンパイル時間 | 2,104 ms |
| コンパイル使用メモリ | 206,332 KB |
| 最終ジャッジ日時 | 2025-02-17 04:55:08 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 17 |
ソースコード
#line 1 "combined.cpp"#pragma region Macros#include <bits/stdc++.h>using namespace std;template <class T> inline bool chmax(T &a, T b) {if(a < b) {a = b;return 1;}return 0;}template <class T> inline bool chmin(T &a, T b) {if(a > b) {a = b;return 1;}return 0;}#ifdef DEBUGtemplate <class T, class U>ostream &operator<<(ostream &os, const pair<T, U> &p) {os << '(' << p.first << ',' << p.second << ')';return os;}template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {os << '{';for(int i = 0; i < (int)v.size(); i++) {if(i) { os << ','; }os << v[i];}os << '}';return os;}void debugg() { cerr << endl; }template <class T, class... Args>void debugg(const T &x, const Args &... args) {cerr << " " << x;debugg(args...);}#define debug(...) \cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl#else#define debug(...) (void(0))#define dump(x) (void(0))#endifstruct Setup {Setup() {cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(15);}} __Setup;using ll = long long;#define OVERLOAD3(_1, _2, _3, name, ...) name#define ALL(v) (v).begin(), (v).end()#define RALL(v) (v).rbegin(), (v).rend()#define REP1(i, n) for(int i = 0; i < int(n); i++)#define REP2(i, a, b) for(int i = (a); i < int(b); i++)#define REP(...) OVERLOAD3(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())#define REVERSE(v) reverse(ALL(v))#define SZ(v) ((int)(v).size())const int INF = 1 << 30;const ll LLINF = 1LL << 60;constexpr int MOD = 1000000007;constexpr int MOD2 = 998244353;const int dx[4] = {1, 0, -1, 0};const int dy[4] = {0, 1, 0, -1};void Case(int i) { cout << "Case #" << i << ": "; }int popcount(int x) { return __builtin_popcount(x); }ll popcount(ll x) { return __builtin_popcountll(x); }void solve();int main() {int T{1};// cin >> T;while(T--) solve();}#pragma endregion Macros#line 2 "/Users/siro53/kyo-pro/compro_library/data-structure/unionfind.hpp"#line 7 "/Users/siro53/kyo-pro/compro_library/data-structure/unionfind.hpp"class UnionFind {public:UnionFind() = default;explicit UnionFind(int n) : N(n), parent_or_size(n, -1) {}int leader(int u) {assert(0 <= u && u < N);if(parent_or_size[u] < 0) return u;return (parent_or_size[u] = leader(parent_or_size[u]));}bool same(int u, int v) { return (leader(u) == leader(v)); }bool merge(int u, int v) {u = leader(u);v = leader(v);if(u == v) return false;if(-parent_or_size[u] < -parent_or_size[v]) std::swap(u, v);parent_or_size[u] += parent_or_size[v];parent_or_size[v] = u;return true;}int size(int u) { return (-parent_or_size[leader(u)]); }std::vector<std::vector<int>> groups() {std::vector<int> leaders(N), group_size(N, 0);for(int i = 0; i < N; i++) {leaders[i] = leader(i);group_size[leaders[i]]++;}std::vector<std::vector<int>> g(N);for(int i = 0; i < N; i++) g[i].reserve(group_size[i]);for(int i = 0; i < N; i++) g[leaders[i]].push_back(i);g.erase(std::remove_if(g.begin(), g.end(),[&](const std::vector<int> &v) { return v.empty(); }),g.end());return g;}std::map<int, std::vector<int>> groups_with_map() {std::map<int, std::vector<int>> g;for(int i = 0; i < N; i++) {int l = leader(i);if(!g.count(l)) g[l].push_back(i);}return g;}private:int N;std::vector<int> parent_or_size;};#line 2 "/Users/siro53/kyo-pro/compro_library/modint/modint.hpp"#line 6 "/Users/siro53/kyo-pro/compro_library/modint/modint.hpp"template <int mod> class ModInt {public:ModInt() : x(0) {}ModInt(long long y): x(y >= 0 ? y % umod() : (umod() - (-y) % umod()) % umod()) {}unsigned int val() const { return x; }ModInt &operator+=(const ModInt &p) {if((x += p.x) >= umod()) x -= umod();return *this;}ModInt &operator-=(const ModInt &p) {if((x += umod() - p.x) >= umod()) x -= umod();return *this;}ModInt &operator*=(const ModInt &p) {x = (unsigned int)(1ULL * x * p.x % umod());return *this;}ModInt &operator/=(const ModInt &p) {*this *= p.inv();return *this;}ModInt operator-() const { return ModInt(-(long long)x); }ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }bool operator==(const ModInt &p) const { return x == p.x; }bool operator!=(const ModInt &p) const { return x != p.x; }ModInt inv() const {long long a = x, b = mod, u = 1, v = 0, t;while(b > 0) {t = a / b;std::swap(a -= t * b, b);std::swap(u -= t * v, v);}return ModInt(u);}ModInt pow(unsigned long long n) const {ModInt ret(1), mul(x);while(n > 0) {if(n & 1) ret *= mul;mul *= mul;n >>= 1;}return ret;}friend std::ostream &operator<<(std::ostream &os, const ModInt &p) {return os << p.x;}friend std::istream &operator>>(std::istream &is, ModInt &a) {long long t;is >> t;a = ModInt<mod>(t);return (is);}static constexpr int get_mod() { return mod; }private:unsigned int x;static constexpr unsigned int umod() { return mod; }};#line 87 "combined.cpp"using mint = ModInt<MOD2>;void solve() {int N, M;cin >> N >> M;vector<int> a(N);REP(i, N) cin >> a[i];UnionFind uf(N);REP(i, M) {int u, v;cin >> u >> v;u--, v--;uf.merge(u, v);}vector<mint> sum(N, 0);REP(i, N) sum[uf.leader(i)] += a[i];mint ans = 1;REP(x, N) ans *= sum[uf.leader(x)];cout << ans << endl;}