結果
| 問題 | No.3025 Chocol∀te |
| ユーザー |
 noya2
|
| 提出日時 | 2025-02-13 19:53:09 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 1,588 ms / 2,000 ms |
| コード長 | 7,519 bytes |
| コンパイル時間 | 3,477 ms |
| コンパイル使用メモリ | 300,952 KB |
| 実行使用メモリ | 54,512 KB |
| 最終ジャッジ日時 | 2025-02-14 14:58:11 |
| 合計ジャッジ時間 | 64,490 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 73 |
ソースコード
#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"using namespace std;#include<bits/stdc++.h>#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"namespace noya2 {template <typename T, typename U>ostream &operator<<(ostream &os, const pair<T, U> &p){os << p.first << " " << p.second;return os;}template <typename T, typename U>istream &operator>>(istream &is, pair<T, U> &p){is >> p.first >> p.second;return is;}template <typename T>ostream &operator<<(ostream &os, const vector<T> &v){int s = (int)v.size();for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];return os;}template <typename T>istream &operator>>(istream &is, vector<T> &v){for (auto &x : v) is >> x;return is;}void in() {}template <typename T, class... U>void in(T &t, U &...u){cin >> t;in(u...);}void out() { cout << "\n"; }template <typename T, class... U, char sep = ' '>void out(const T &t, const U &...u){cout << t;if (sizeof...(u)) cout << sep;out(u...);}template<typename T>void out(const vector<vector<T>> &vv){int s = (int)vv.size();for (int i = 0; i < s; i++) out(vv[i]);}struct IoSetup {IoSetup(){cin.tie(nullptr);ios::sync_with_stdio(false);cout << fixed << setprecision(15);cerr << fixed << setprecision(7);}} iosetup_noya2;} // namespace noya2#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"namespace noya2{const int iinf = 1'000'000'007;const long long linf = 2'000'000'000'000'000'000LL;const long long mod998 = 998244353;const long long mod107 = 1000000007;const long double pi = 3.14159265358979323;const vector<int> dx = {0,1,0,-1,1,1,-1,-1};const vector<int> dy = {1,0,-1,0,1,-1,-1,1};const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";const string alp = "abcdefghijklmnopqrstuvwxyz";const string NUM = "0123456789";void yes(){ cout << "Yes\n"; }void no(){ cout << "No\n"; }void YES(){ cout << "YES\n"; }void NO(){ cout << "NO\n"; }void yn(bool t){ t ? yes() : no(); }void YN(bool t){ t ? YES() : NO(); }} // namespace noya2#line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"#line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"namespace noya2{unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){if (a == 0 || b == 0) return a + b;int n = __builtin_ctzll(a); a >>= n;int m = __builtin_ctzll(b); b >>= m;while (a != b) {int mm = __builtin_ctzll(a - b);bool f = a > b;unsigned long long c = f ? a : b;b = f ? b : a;a = (c - b) >> mm;}return a << std::min(n, m);}template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }long long sqrt_fast(long long n) {if (n <= 0) return 0;long long x = sqrt(n);while ((x + 1) * (x + 1) <= n) x++;while (x * x > n) x--;return x;}template<typename T> T floor_div(const T n, const T d) {assert(d != 0);return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);}template<typename T> T ceil_div(const T n, const T d) {assert(d != 0);return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);}template<typename T> void uniq(std::vector<T> &v){std::sort(v.begin(),v.end());v.erase(unique(v.begin(),v.end()),v.end());}template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }} // namespace noya2#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"#define rep(i,n) for (int i = 0; i < (int)(n); i++)#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)#define all(v) (v).begin(),(v).end()using ll = long long;using ld = long double;using uint = unsigned int;using ull = unsigned long long;using pii = pair<int,int>;using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;namespace noya2{/* ~ (. _________ . /) */}using namespace noya2;#line 2 "c.cpp"void solve(){int n, m; in(n,m);unordered_set<ll> es;vector<bool> issml(n,false);vector<unordered_set<int>> sml(n), big(n);auto getkey = [&](int u, int v){if (u > v) swap(u,v);return (ll(u) << 30) + v;};rep(i,m){int u, v; in(u,v); u--, v--;es.insert(getkey(u,v));}const int sq = 500;vector<ll> a(n); in(a);vector<ll> sum(n);auto esupdate = [&](int u, int v){if (u < v){ll key = getkey(u,v);if (es.contains(key)){es.erase(key);}else {es.insert(key);}}};auto add = [&](int u, int v){if (issml[v]){sml[u].insert(v);sum[u] += a[v];}else {big[u].insert(v);if (!issml[u]){sum[u] += a[v];}}};auto del = [&](int u, int v){if (issml[v]){sml[u].erase(v);sum[u] -= a[v];}else {big[u].erase(v);if (!issml[u]){sum[u] -= a[v];}}};auto exist = [&](int u, int v){ll key = getkey(u,v);return es.contains(key);};auto getuv = [&](ll key){int u = key >> 30;int v = key & ((1LL << 30) - 1);return pii(u,v);};auto build = [&](){vector<int> deg(n,0);for (auto key : es){auto [u, v] = getuv(key);deg[u]++;deg[v]++;}rep(v,n){issml[v] = (deg[v] < sq);}rep(v,n){sml[v].clear();big[v].clear();}sum.assign(n,0);for (auto key : es){auto [u, v] = getuv(key);add(u,v);add(v,u);}};build();int q; in(q);int updtime = 10000;rep(tt,q){int t; in(t);if (t == 1){int u, v; in(u,v); u--, v--;if (exist(u,v)){del(u,v);del(v,u);}else {add(u,v);add(v,u);}esupdate(u,v);}if (t == 2){int v; in(v); v--;ll x; in(x);x -= a[v];if (issml[v]){for (int u : sml[v]){sum[u] += x;}for (int u : big[v]){sum[u] += x;}}else {for (int u : big[v]){sum[u] += x;}}a[v] += x;}if (t == 3){int v; in(v); v--;if (issml[v]){ll ans = sum[v];for (int u : big[v]){ans += a[u];}out(ans);}else {out(sum[v]);}}if ((tt+1) % updtime == 0){build();}}}int main(){int t = 1; //in(t);while (t--) { solve(); }}