結果
| 問題 | No.3025 Chocol∀te |
| ユーザー |
 woodywoody
|
| 提出日時 | 2025-02-16 16:05:02 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 776 ms / 2,000 ms |
| コード長 | 7,753 bytes |
| コンパイル時間 | 5,536 ms |
| コンパイル使用メモリ | 266,136 KB |
| 実行使用メモリ | 40,116 KB |
| 最終ジャッジ日時 | 2025-02-16 16:05:44 |
| 合計ジャッジ時間 | 24,666 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 77 |
ソースコード
#include<bits/stdc++.h>#include<atcoder/all>#define rep(i,b) for(int i=0;i<b;i++)#define rrep(i,b) for(int i=b-1;i>=0;i--)#define rep1(i,b) for(int i=1;i<b;i++)#define repx(i,x,b) for(int i=x;i<b;i++)#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)#define fore(i,a) for(auto& i:a)#define rng(x) (x).begin(), (x).end()#define rrng(x) (x).rbegin(), (x).rend()#define sz(x) ((int)(x).size())#define pb push_back#define fi first#define se second#define pcnt __builtin_popcountllusing namespace std;using namespace atcoder;using std::cout;using ll = long long;using ull = unsigned long long;using ld = long double;template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}#define retval(x) {cout << #x << endl; return;}#define cout2(x,y) cout << x << " " << y << endl;#define coutp(p) cout << p.fi << " " << p.se << endl;#define out cout << ans << endl;#define outd cout << fixed << setprecision(20) << ans << endl;#define outm cout << ans.val() << endl;#define outv fore(yans , ans) cout << yans << "\n";#define outmv fore(yans , ans) cout << yans.val() << "\n";#define assertmle(x) if (!(x)) {vi v(3e8);}#define asserttle(x) if (!(x)) {while(1){}}#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}#define coutv2(v) fore(vy , v) cout << vy << "\n";#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;using mint = modint998244353;//using mint = modint1000000007;//using mint = dynamic_modint<0>;using vm = vector<mint>;using vvm = vector<vector<mint>>;vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}#define yes {cout <<"Yes"<<endl;}#define no {cout <<"No"<<endl;}const double eps = 1e-10;const ll LINF = 2001002003004005006ll;const int INF = 1001001001;#ifdef MY_LOCAL_DEBUG#include "./debug/local_debug.h"#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl#define show1(a) cerr<<#a<<" = "<<a<<endl#define show2(a,b) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<endl#define show3(a,b,c) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<endl#define show4(a,b,c,d) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<endl#define show5(a,b,c,d,e) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<" : "<<#e<<" = "<<e<<endl#define DEBUG_LINE cout << "DEBUG_LINE : " << __LINE__ << endl#define showv(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy << " ";} cout << endl;}#define showv2(v) {cout<<#v<<endl; fore(vy , v) cout << vy << "\n";}#define showvm(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy.val() << " ";} cout << endl;}#define showvm2(v) {cout<<#v<<endl; fore(vy , v) cout << vy.val() << "\n";}#define showmat(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg << " "; cout << endl;}}#define showmatm(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg.val() << " "; cout << endl;}}#define showsg(sg) {cout<<#sg<<" : "; rep(i,sg.get_size_for_localdebug()) {cout << sg.get(i) << " ";} cout << endl;}#define showfw(fw) {cout<<#fw<<" : "; rep(i,fw.get_size_for_localdebug()) {cout << fw.sum(i,i+1) << " ";} cout << endl;}#else#define showp(p)#define show1(a)#define show2(a,b)#define show3(a,b,c)#define show4(a,b,c,d)#define show5(a,b,c,d,e)#define DEBUG_LINE#define showv(v)#define showv2(v)#define showvm(v)#define showvm2(v)#define showmat(v)#define showmatm(v)#define showsg(sg)#define showfw(fw)#endif#define overload5(a,b,c,d,e,f, ...) f#define show(...) overload5(__VA_ARGS__, show5, show4, show3, show2, show1)(__VA_ARGS__)void solve(){int n,m; cin>>n>>m;const int c = 500;vector<unordered_set<int>> e(n);rep(i,m){int a,b; cin>>a>>b;a--; b--;e[a].insert(b);e[b].insert(a);}vb isBig(n);rep(i,n){if (sz(e[i])>=c){isBig[i] = true;}}vi bigs;rep(i,n){if (isBig[i]) bigs.pb(i);}vvb lazy(n);rep(i,n){if (!isBig[i]) continue;lazy[i].resize(n);fore(y , e[i]) lazy[i][y] = true;}vl aa(n);rep(i,n) cin>>aa[i];vl st(n);rep(i,n){fore(y, bigs){if (!lazy[y][i]) continue;st[y] += aa[i];}}int q; cin>>q;vl ans;rep(i,q){int t; cin>>t;if (t==1){int a,b; cin>>a>>b;a--; b--;if (e[a].count(b)){e[a].erase(b);e[b].erase(a);if (isBig[a]){lazy[a][b] = false;st[a] -= aa[b];}if (isBig[b]){lazy[b][a] = false;st[b] -= aa[a];}}else{e[a].insert(b);e[b].insert(a);if (isBig[a]){lazy[a][b] = true;st[a] += aa[b];}if (isBig[b]){lazy[b][a] = true;st[b] += aa[a];}}}else if(t==2){int p; cin>>p;p--;ll x; cin>>x;fore(y , bigs){if (!lazy[y][p]) continue;st[y] -= aa[p];st[y] += x;}aa[p] = x;}else{int c; cin>>c;c--;if (isBig[c]){ll tmp = st[c];ans.pb(tmp);}else{ll tmp = 0;fore(y , e[c]) tmp += aa[y];ans.pb(tmp);}}// if (i%c==c-1){// vb isBig2(n);// rep(j,n){// if (sz(e[j])>=c){// isBig2[j] = true;// if (isBig2[j] != isBig[j]){// fore(y, e[j]){// st[j] += aa[y];// bigs[y].pb(j);// }// }// }else{// isBig2[j] = false;// if (isBig2[j] != isBig[j]){// st[j] = 0;// fore(y, e[j]){// erase(bigs[y], j);// }// }// }// }// swap(isBig, isBig2);// }}outv;return;}int main(){ios::sync_with_stdio(false);cin.tie(0);int t = 1;//cin>>t;rep(i,t){solve();}return 0;}