結果
問題 | No.3104 Simple Graph Problem |
ユーザー |
👑 ![]() |
提出日時 | 2025-04-11 21:53:48 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 63 ms / 2,000 ms |
コード長 | 6,009 bytes |
コンパイル時間 | 2,199 ms |
コンパイル使用メモリ | 213,876 KB |
実行使用メモリ | 14,356 KB |
最終ジャッジ日時 | 2025-04-11 21:53:58 |
合計ジャッジ時間 | 7,860 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 65 |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll=long long; const ll ILL=2167167167167167167; const int INF=2100000000; #define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++) #define all(p) p.begin(),p.end() template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>; template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();} template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();} template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;} template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;} template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());} template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});} bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;} template<class T> void vec_out(vector<T> &p,int ty=0){ if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";} else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}} template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;} template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;} template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;} int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;} template<class T> T square(T a){return a * a;} #include <atcoder/modint> using mint = atcoder::modint998244353; namespace po167{ struct UF { using _F = int; int _n; std::vector<_F> wei; std::vector<int> q; int component; UF(int n):_n(n), wei(n), component(n), par(n){ for (int i = 0; i < n; i++){ wei[i] =1, par[i] = i; } } void intialize(){ for (auto x : q){ wei[root(x)] = 1; par[x] = x; } component = (int)par.size(); q = {}; } //根っこを返す int root(int a){ assert(0 <= a && a < _n); if (a == par[a]) return a; return par[a] = root(par[a]); } //trueなら1,falseなら0 int same(int a, int b){ assert(0 <= a && a < _n); assert(0 <= b && b < _n); if(root(a) == root(b)) return 1; else return 0; } _F size(int a){ return wei[root(a)]; } //a,bが違う根っこの元なら結合する,結合したらtrueを返す bool unite(int a,int b){ a = root(a), b = root(b); if (a == b) return false; if (wei[a] < wei[b]) std::swap(a, b); par[b] = a; q.push_back(b); wei[a] += wei[b]; component--; return true; } private: std::vector<int> par; }; } using po167::UF; std::vector<std::vector<int>> tree_in(int N){ std::vector<std::vector<int>> G(N); for(int i=0;i<N-1;i++){ int a;int b; cin>>a>>b; a--,b--; G[a].push_back(b); G[b].push_back(a); } return G; } std::tuple<std::vector<int>,std::vector<int>,std::vector<int>> tree_order_pare_depth(std::vector<std::vector<int>> &G,int root){ int n=G.size(); std::vector<int> order={root},pare(n,-1),depth(n); pare[root]=-2; for(int i=0;i<n;i++){ int a=order[i]; for(auto x:G[a]){ if(pare[x]==-1){ pare[x]=a; depth[x]=depth[a]+1; order.push_back(x); } } } return {order,pare,depth}; } std::vector<int> tree_diameter_path(std::vector<std::vector<int>> &G){ int n=G.size(); auto r=(std::get<0>(tree_order_pare_depth(G,0))).at(n-1); std::vector<int> order,pare,depth,ans; tie(order,pare,depth)=tree_order_pare_depth(G,r); int ind=order[n-1]; while(ind!=-2){ ans.push_back(ind); ind=pare[ind]; } return ans; } void solve(); // CITRUS CURIO CITY / FREDERIC int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int t = 1; // cin >> t; rep(i, 0, t) solve(); } void solve(){ int N, M; cin >> N >> M; vector<mint> B(N); rep(i, 0, N){ int b; cin >> b; B[i] = b; } UF T(N); vector<int> U(M), V(M), use(M); vector<vector<int>> G(N); vector<mint> ans(M); rep(i, 0, M){ cin >> U[i] >> V[i]; U[i]--, V[i]--; if (T.unite(U[i], V[i])){ G[U[i]].push_back(V[i]); G[V[i]].push_back(U[i]); use[i] = 1; } } auto [order, pare, depth] = tree_order_pare_depth(G, 0); mint sum = 0; rep(i, 0, N){ depth[i] = depth[i] % 2; if (depth[i]) sum += B[i]; else sum -= B[i]; } rep(i, 0, M) if (depth[U[i]] == depth[V[i]]){ if (depth[U[i]]){ ans[i] = sum / 2; B[U[i]] -= ans[i]; B[V[i]] -= ans[i]; sum = 0; } else{ ans[i] = -sum / 2; B[U[i]] -= ans[i]; B[V[i]] -= ans[i]; sum = 0; } } if (sum != 0){ cout << "-1\n"; return; } vector<int> pare_ind(N); rep(i, 0, M) if (use[i]){ if (pare[U[i]] != V[i]) swap(U[i], V[i]); pare_ind[U[i]] = i; } reverse(all(order)); order.pop_back(); for (auto id : order){ mint tmp = B[id]; // cout << id << " " << B[id].val() << endl; // cout << pare_ind[id] << endl; B[pare[id]] -= tmp; ans[pare_ind[id]] = tmp; } assert(B[0] == 0); rep(i, 0, M){ cout << ans[i].val() << (i + 1 == M ? "\n" : " "); } }