結果

問題 No.1054 Union add query
ユーザー 👑 tute7627tute7627
提出日時 2020-11-16 18:19:41
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 353 ms / 2,000 ms
コード長 5,566 bytes
コンパイル時間 2,620 ms
コンパイル使用メモリ 217,020 KB
実行使用メモリ 57,992 KB
最終ジャッジ日時 2024-07-23 01:40:34
合計ジャッジ時間 5,989 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,812 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 208 ms
31,500 KB
testcase_04 AC 353 ms
57,992 KB
testcase_05 AC 167 ms
25,360 KB
testcase_06 AC 201 ms
49,148 KB
testcase_07 AC 170 ms
49,056 KB
testcase_08 AC 197 ms
49,208 KB
testcase_09 AC 267 ms
49,484 KB
testcase_10 AC 183 ms
49,032 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//#define _GLIBCXX_DEBUG

#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};
template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}
template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;}
template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;}
template<typename T>void rearrange(vector<ll>&ord, vector<T>&v){
  auto tmp = v;
  for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];
}
template<typename Head, typename... Tail>void rearrange(vector<ll>&ord,Head&& head, Tail&&... tail){
  rearrange(ord, head);
  rearrange(ord, tail...);
}
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int popcount(ll x){return __builtin_popcountll(x);};
int poplow(ll x){return __builtin_ctzll(x);};
int pophigh(ll x){return 63 - __builtin_clzll(x);};
struct MergeTree{
  vector<int> data;
  vector<int>current;
  vector<vector<int>> graph;
  vector<int>in, out;
  vector<int>ord;
  int num;
  int time;
  MergeTree(int size) : data(size, -1), current(size), graph(size),
  time(size - 1), num(size){    
    iota(current.begin(), current.end(), 0);
  }
  int unite(int x, int y) {
    x = root(x); y = root(y);
    if(x != y){
      graph.emplace_back();
      time++;
      graph[time].push_back(current[x]);
      graph[time].push_back(current[y]);
      if (data[y] < data[x]) swap(x, y);
      current[x] = time;
      data[x] += data[y]; data[y] = x;
      num--;
    }
    return time;
  }
  void build(){
    graph.emplace_back();
    in.resize(graph.size());
    out.resize(graph.size());
    time++;
    for(int i = 0; i < data.size(); i++){
      if(root(i) == i)graph[time].push_back(current[i]);
    }
    int t = 0;
    build_dfs(time, t);
  }
  void build_dfs(int pos, int &t){
    in[pos] = t;
    if(graph[pos].size() == 0){
      ord.push_back(pos);
      t++;
    }
    for(auto to:graph[pos]){
      build_dfs(to, t);
    }
    out[pos] = t;
  }
  int component(int x){
    return current[root(x)];
  }
  bool find(int x, int y) {
    return root(x) == root(y);
  }
  int root(int x) {
    return data[x] < 0 ? x : data[x] = root(data[x]);
  }
  int size(int x) {
    return -data[root(x)];
  }
};
template<typename T>
struct BIT{
  ll n;
  ll k=1;
  vector<T>data;
  BIT() = default;
  BIT(ll size):n(size){
    n++;
    data.assign(n,0);
    while(k*2<=n)k*=2;
  }
  void add(ll a,T w){
    for(ll i=a+1;i<=n;i+=i&-i)data[i-1]+=w;
  }
  void add(ll l,ll r,T w){
    add(l,w);add(r+1,-w);
  }
  T sum(ll a){
	  if(a<0)return 0;
    T ret = 0;
    for(ll i=a+1;i>0;i-=i&-i)ret+=data[i-1];
    return ret;
  }
  T sum(ll a,ll b){return a>b?0:sum(b)-sum(a-1);}
  T operator[](ll pos){
    return sum(pos,pos);
  }
  ll lower_bound(ll x){
    ll ret=0;    
    for(ll i=k;i>0;i/=2){
      if(ret+i<=n&&data[ret+i-1]<x){
        x-=data[ret+i-1];
        ret+=i;
      }
    }
    return ret;
  }
  void print(){
    for(ll i=0;i<n;i++){
      if(i!=0)cout<<" ";
      cout<<sum(i);
    }
    cout<<endl;
  }
};

int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll n,q;cin>>n>>q;
  MergeTree uf(n);
  vector<ll>t(q),a(q),b(q),c(q);
  rep(i,0,q){
    cin>>t[i]>>a[i]>>b[i];
    if(t[i]==1){
      a[i]--;b[i]--;
      uf.unite(a[i],b[i]);
    }
    if(t[i]==2){
      a[i]--;
      c[i]=uf.component(a[i]);
    }
    if(t[i]==3){
      a[i]--;
      c[i]=uf.component(a[i]);
    }
  }
  uf.build();
  BIT<ll>bit(n);
  rep(i,0,q){
    if(t[i]==1)continue;
    if(t[i]==2){
      bit.add(uf.in[c[i]],uf.out[c[i]]-1,b[i]);
    }
    else cout<<bit.sum(uf.in[a[i]])<<endl;
  }
  return 0;
}
0