結果
問題 |
No.3025 Chocol∀te
|
ユーザー |
👑 |
提出日時 | 2025-02-15 20:51:08 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,505 ms / 2,000 ms |
コード長 | 3,649 bytes |
コンパイル時間 | 4,207 ms |
コンパイル使用メモリ | 257,892 KB |
実行使用メモリ | 33,964 KB |
最終ジャッジ日時 | 2025-02-15 20:52:13 |
合計ジャッジ時間 | 46,817 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 77 |
ソースコード
#include<bits/stdc++.h> #include<atcoder/all> #define rep(i,n) for(int i=0;i<n;i++) using namespace std; using namespace atcoder; typedef long long ll; typedef vector<int> vi; typedef vector<long long> vl; typedef vector<vector<int>> vvi; typedef vector<vector<long long>> vvl; typedef long double ld; typedef pair<int, int> P; template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;} template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;} template <int m> istream& operator>>(istream& is, static_modint<m>& a) {long long x; is >> x; a = x; return is;} template <int m> istream& operator>>(istream& is, dynamic_modint<m>& a) {long long x; is >> x; a = x; return is;} template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;} template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;} template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;} template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;} template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;} template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;} template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;} template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;} template<typename T> void chmin(T& a, T b){a = min(a, b);} template<typename T> void chmax(T& a, T b){a = max(a, b);} int main(){ int n, m; cin >> n >> m; vector<unordered_set<int>> G(n); rep(i, m){ int u, v; cin >> u >> v; u--; v--; G[u].insert(v); G[v].insert(u); } vector<long long> a(n); cin >> a; int q; cin >> q; const int B = sqrt(m + q); unordered_set<int> major; vector<long long> s(n); rep(u, n){ if(int(G[u].size()) >= B){ major.insert(u); }else{ for(int v : G[u]){ s[v] += a[u]; } } } auto update = [&](int u, int c){ if(int(G[u].size()) >= B){ major.insert(u); }else{ major.erase(u); } if(major.find(u) != major.end()){ }else{ for(int v : G[u]){ s[v] += a[u] * c; } } }; rep(i, q){ int t; cin >> t; if(t == 1){ int u, v; cin >> u >> v; u--; v--; if(G[u].find(v) != G[u].end()){ update(u, -1); update(v, -1); G[u].erase(v); G[v].erase(u); update(u, +1); update(v, +1); }else{ update(u, -1); update(v, -1); G[u].insert(v); G[v].insert(u); update(u, +1); update(v, +1); } } if(t == 2){ int u, val; cin >> u >> val; u--; update(u, -1); a[u] = val; update(u, +1); } if(t == 3){ int u; cin >> u; u--; long long ans = s[u]; for(int v : major){ if(G[u].find(v) != G[u].end()){ ans += a[v]; } } cout << ans << "\n"; } } return 0; }