結果
問題 | No.3025 Chocol∀te |
ユーザー |
|
提出日時 | 2025-02-15 12:09:44 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 784 ms / 2,000 ms |
コード長 | 4,786 bytes |
コンパイル時間 | 5,557 ms |
コンパイル使用メモリ | 333,468 KB |
実行使用メモリ | 55,412 KB |
最終ジャッジ日時 | 2025-02-15 12:10:28 |
合計ジャッジ時間 | 30,472 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 77 |
ソースコード
#include <bits/stdc++.h> #include <atcoder/all> using namespace std; using namespace atcoder; istream &operator>>(istream &is, modint &a) { long long v; is >> v; a = v; return is; } ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); } istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; } ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); } istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; } ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); } typedef long long ll; typedef vector<vector<int>> Graph; typedef pair<int, int> pii; typedef pair<ll, ll> pll; #define FOR(i,l,r) for (int i = l;i < (int)(r); i++) #define rep(i,n) for (int i = 0;i < (int)(n); i++) #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define my_sort(x) sort(x.begin(), x.end()) #define my_max(x) *max_element(all(x)) #define my_min(x) *min_element(all(x)) 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; } const int INF = (1<<30) - 1; const ll LINF = (1LL<<62) - 1; const int MOD = 998244353; const int MOD2 = 1e9+7; const double PI = acos(-1); vector<int> di = {1,0,-1,0}; vector<int> dj = {0,1,0,-1}; #ifdef LOCAL # include <debug_print.hpp> # define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__) #else # define debug(...) (static_cast<void>(0)) #endif const int B = 500; int main(){ cin.tie(0); ios_base::sync_with_stdio(false); int N, M; cin >> N >> M; vector<int> deg(N); vector<unordered_set<int>> g(N); rep(i, M){ int X, Y; cin >> X >> Y; X--; Y--; deg[X]++; deg[Y]++; g[X].insert(Y); g[Y].insert(X); } vector<ll> A(N); rep(i, N) cin >> A[i]; vector<int> isLarge(N); rep(i, N) if(deg[i] >= B) isLarge[i] = 1; vector<ll> S(N); vector<unordered_set<int>> gb(N); rep(now, N){ for(auto itr = g[now].begin(); itr != g[now].end(); itr++){ int nxt = *itr; if(isLarge[now]){ gb[nxt].insert(now); } else{ S[nxt] += A[now]; } } } int Q; cin >> Q; while(Q--){ debug(Q); int op; cin >> op; if(op == 1){ int U, V; cin >> U >> V; U--, V--; if(g[U].find(V) != g[U].end()){ g[U].erase(V); if(isLarge[V]){ gb[U].erase(V); } else{ S[U] -= A[V]; } g[V].erase(U); if(isLarge[U]){ gb[V].erase(U); } else{ S[V] -= A[U]; } } else{ deg[U]++; deg[V]++; g[U].insert(V); g[V].insert(U); if(isLarge[U]){ gb[V].insert(U); } else{ S[V] += A[U]; if(deg[U] >= B){ isLarge[U] = 1; for(auto itr = g[U].begin(); itr != g[U].end(); itr++){ int nxt = *itr; gb[nxt].insert(U); S[nxt] -= A[U]; } } } if(isLarge[V]){ gb[U].insert(V); } else{ S[U] += A[V]; if(deg[V] >= B){ isLarge[V] = 1; for(auto itr = g[V].begin(); itr != g[V].end(); itr++){ int nxt = *itr; gb[nxt].insert(V); S[nxt] -= A[V]; } } } } } if(op == 2){ int p, a; cin >> p >> a; p--; if(isLarge[p]); else{ for(auto itr = g[p].begin(); itr != g[p].end(); itr++){ S[*itr] -= A[p]; S[*itr] += (ll)a; } } A[p] = a; } if(op == 3){ int c; cin >> c; c--; ll ans = S[c]; for(auto itr = gb[c].begin(); itr != gb[c].end(); itr++){ ans += A[*itr]; } cout << ans << endl; } } }