結果
| 問題 | No.772 Dynamic Distance Sum |
| ユーザー |
 HIR180
|
| 提出日時 | 2024-04-07 01:44:45 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
RE
|
| 実行時間 | - |
| コード長 | 6,149 bytes |
| コンパイル時間 | 3,445 ms |
| コンパイル使用メモリ | 223,048 KB |
| 最終ジャッジ日時 | 2025-02-20 22:41:22 |
|
ジャッジサーバーID （参考情報） |
judge4 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 RE * 2 |
| other | AC * 1 RE * 3 TLE * 1 -- * 22 |
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:242:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
242 | scanf("%d%d",&n, &q);
| ~~~~~^~~~~~~~~~~~~~~
main.cpp:245:30: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
245 | int ty; scanf("%d",&ty);
| ~~~~~^~~~~~~~~~
main.cpp:247:43: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
247 | int a, b, c; scanf("%d%d%d",&a,&b,&c);
| ~~~~~^~~~~~~~~~~~~~~~~~~
main.cpp:254:40: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
254 | int a, b; scanf("%d%d",&a,&b);
| ~~~~~^~~~~~~~~~~~~~
main.cpp:261:37: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
261 | int a; scanf("%d",&a);
| ~~~~~^~~~~~~~~
ソースコード
//Let's join Kaede Takagaki Fan Club !!#include <bits/stdc++.h>#include <ext/pb_ds/assoc_container.hpp>#include <ext/pb_ds/tree_policy.hpp>using namespace std;typedef long long ll;typedef pair<int,int> P;typedef pair<int,P> P1;typedef pair<P,P> P2;#define pu push#define pb push_back#define mp make_pair#define eps 1e-7#define INF 1000000000#define fi first#define sc second#define rep(i,x) for(int i=0;i<x;i++)#define repn(i,x) for(int i=1;i<=x;i++)#define SORT(x) sort(x.begin(),x.end())#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())#define all(x) x.begin(),x.end()template<class T>void dmp(T a){rep(i,a.size()) cout << a[i] << " ";cout << endl;}template<class T>bool chmax(T&a, T b){if(a < b){a = b;return 1;}return 0;}template<class T>bool chmin(T&a, T b){if(a > b){a = b;return 1;}return 0;}template<class T>void g(T &a){cin >> a;}template<class T>void o(const T &a,bool space=false){cout << a << (space?' ':'\n');}//ios::sync_with_stdio(false);const ll mod = 1000000007;//998244353template<class T>void add(T&a,T b){a+=b;if(a >= mod) a-=mod;}//verified: yosupo judge (x3), AOJ 2450, Hackerrank white falcon, IJPC2012-3Astruct dat {int cnt1;ll sum, sum1, sum2;//reverseするvoid rv(){swap(sum1, sum2);}};struct node{node *l, *r, *p;int id, rev;dat D, L, S;multiset<P, greater<P>>L_sz;node(int i, int c, int w) : l(0), r(0), p(0), id(i), rev(0){D = S = {c, w, w, w};L = {0, 0, 0, 0};L_sz.clear();}};inline bool is_root(node *n){return n -> p == NULL || n -> p -> l != n && n -> p -> r != n;}inline bool left(node *n){return n == n -> p -> l;}//遅延評価//push(n)を走らせた後にはn->l と n->r の値は正しく計算されている必要ありinline void push(node *n){if(n->rev){swap(n->l, n->r);if(n->l){n->l->rev ^= 1;n->l->D.rv();}if(n->r){n->r->rev ^= 1;n->r->D.rv();}n->rev = 0;}}//値の再計算inline void update(node *n){//最初に遅延評価push(n);n->D.cnt1 = (n->l?n->l->D.cnt1:0) + (n->r?n->r->D.cnt1:0) + n->L.cnt1 + n->S.cnt1;n->D.sum = (n->l?n->l->D.sum:0) + (n->r?n->r->D.sum:0) + n->S.sum;n->D.sum1 = 0;if(n->l) n->D.sum1 += n->l->D.sum1;if(n->r) n->D.sum1 += n->r->D.sum1 + 1LL*(n->S.sum+(n->l?n->l->D.sum:0)) * n->r->D.cnt1;if(n->S.cnt1) n->D.sum1 += 1LL*(n->S.sum+(n->l?n->l->D.sum:0));n->D.sum1 += n->L.sum1 + 1LL*(n->S.sum+(n->l?n->l->D.sum:0)) * n->L.cnt1;n->D.sum2 = 0;if(n->l) n->D.sum2 += n->l->D.sum2 + 1LL*(n->S.sum+(n->r?n->r->D.sum:0)) * n->l->D.cnt1;if(n->r) n->D.sum2 += n->r->D.sum2;if(n->S.cnt1) n->D.sum2 += 1LL*(n->S.sum+(n->r?n->r->D.sum:0));n->D.sum2 += n->L.sum1 + 1LL*(n->S.sum+(n->r?n->r->D.sum:0)) * n->L.cnt1;}inline void connect(node *n, node *p, bool l){(l ? p -> l : p -> r) = n;if(n) n -> p = p;}//rotateが呼ばれる前には関与しているノードの遅延評価をする必要があるinline void rotate(node *n){node *p = n -> p, *g = p -> p;bool l = left(n);connect(l ? n -> r : n -> l, p, l);bool ex = 0;if(!is_root(p)) connect(n, g, left(p));else{//light edgeを繋ぎ変える//if(g) g->L_sz.erase(mp(p->D.cnt1, p->id));n -> p = g;//if(g) ex = 1;}connect(p, n, !l);update(p), update(n);//if(ex) g->L_sz.insert(mp(n->D.cnt1, n->id));}inline void splay(node *n){if(is_root(n)){update(n);return;}while(!is_root(n)){node *p = n -> p, *g = p -> p;//関与する頂点群の遅延評価をするif(!is_root(p)) push(g);push(p), push(n);if(!is_root(p)) rotate(left(n) ^ left(p) ? n : p);rotate(n);}}//返り値はnじゃないよinline node* expose(node *n){node *last = NULL;for(node *m = n; m; m = m -> p){splay(m);if(m->r) {m->L.cnt1 += m->r->D.cnt1;m->L.sum1 += m->r->D.sum1;m->L.sum2 += m->r->D.sum1;m->L_sz.insert(mp(m->r->D.cnt1, m->r->id));}m -> r = last;if(m->r) {m->L.cnt1 -= m->r->D.cnt1;m->L.sum1 -= m->r->D.sum1;m->L.sum2 -= m->r->D.sum1;m->L_sz.erase(mp(m->r->D.cnt1, m->r->id));}update(m);last = m;}splay(n);return last;}inline void link(node *m, node *n){expose(m), expose(n);m -> p = n;n->L.cnt1 += m->D.cnt1;n->L.sum1 += m->D.sum1;n->L.sum2 += m->D.sum1;n->L_sz.insert(mp(m->D.cnt1, m->id));update(n);}inline node* find_root(node *n){if(!n) return (node*)NULL;while(1){push(n);if(n->r) n = n->r;else break;}return n;}inline node* cut(node *n){expose(n);node *ret = n->l;n -> l -> p = NULL;n -> l = NULL;update(n);return find_root(ret);}//nを根に持っていく//updateは必要ないinline void evert(node *n){expose(n);n->rev ^= 1;n->D.rv();}const int MAXN = 300005;node *V[MAXN];int find(node *n, int sz){int lim = (sz+1)/2;while(1){push(n);if(n->r && n->r->D.cnt1 >= lim) n = n->r;else if(n->l && n->D.cnt1 - n->l->D.cnt1 < lim){lim -= (n->D.cnt1-n->l->D.cnt1); n = n->l;}else if(n->L_sz.size() && (*n->L_sz.begin()).fi >= (sz+1)/2){lim = (sz+1)/2; n = V[(*n->L_sz.begin()).sc];}else return n->id;}}int n, q;ll sum;int nxt = 100001;int main(){scanf("%d%d",&n, &q);repn(i, n) V[i] = new node(i, 1, 0);rep(i, q){int ty; scanf("%d",&ty);if(ty == 1){int a, b, c; scanf("%d%d%d",&a,&b,&c);a = (a-1+sum)%n+1; b = (b-1+sum)%n+1;evert(V[a]);V[nxt] = new node(nxt, 0, c);link(V[a], V[nxt]); link(V[nxt], V[b]); nxt++;}else if(ty == 2){int a, b; scanf("%d%d",&a,&b);a = (a-1+sum)%n+1; b = (b-1+sum)%n+1;evert(V[a]);node *mid = cut(V[b]);evert(mid); cut(V[a]);}else{int a; scanf("%d",&a);a = (a-1+sum)%n+1;evert(V[a]); V[a]->S.cnt1 ^= 1; update(V[a]);ll ans = 1e18;if(V[a]->D.cnt1 == 0){ans = 0;}else{int cent = find(V[a], V[a]->D.cnt1);evert(V[cent]); ans = V[cent]->D.sum1;}printf("%lld\n", ans);sum = (sum+ans)%n;}}}