結果
| 問題 |
No.1054 Union add query
|
| コンテスト | |
| ユーザー |
 Thistle
|
| 提出日時 | 2020-05-15 23:32:56 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 536 ms / 2,000 ms |
| コード長 | 5,806 bytes |
| コンパイル時間 | 2,174 ms |
| コンパイル使用メモリ | 140,660 KB |
| 実行使用メモリ | 111,504 KB |
| 最終ジャッジ日時 | 2024-09-19 13:52:37 |
| 合計ジャッジ時間 | 6,241 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 8 |
ソースコード
#pragma GCC target ("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<unordered_map>
#include<climits>
#include<fstream>
#include<complex>
#include<time.h>
#include<cassert>
#include<functional>
#include<numeric>
#include<tuple>
using namespace std;
using ll = long long;
using ld = long double;
#define int long long
#define all(a) (a).begin(),(a).end()
#define fs first
#define sc second
#define xx first
#define yy second.first
#define zz second.second
#define H pair<int, int>
#define P pair<int, pair<int, int>>
#define Q(i,j,k) mkp(i,mkp(j,k))
#define rng(i,s,n) for(int i = (s) ; i < (n) ; i++)
#define rep(i,n) rng(i, 0, (n))
#define mkp make_pair
#define vec vector
#define pb emplace_back
#define crdcomp(b) sort(all((b)));(b).erase(unique(all((b))),(b).end())
#define getidx(b,i) lower_bound(all(b),(i))-b.begin()
#define ssp(i,n) (i==(int)(n)-1?"\n":" ")
#define ctoi(c) (int)(c-'0')
#define itoc(c) (char)(c+'0')
#define pp(x,y) pb(H{x,y})
#define ppp(x,y,z) pb(Q(x,y,z))
#define cyes printf("Yes\n")
#define cno printf("No\n")
#define cdf(n) int quetimes_=(n);rep(qq123_,quetimes_)
#define gcj printf("Case #%lld: ",qq123_+1)
#define readv(a,n) a.resize(n,0);rep(i,(n)) a[i]=read()
//#define endl "\n"
constexpr int mod = 1e9 + 7;
constexpr int Mod = 998244353;
constexpr int MXN = 500000 + 100;
constexpr ld EPS = 1e-10;
constexpr ll inf = 3 * 1e18;
constexpr int Inf = 15 * 1e8;
const vec<int>dx{ -1,1,0,0 }, dy{ 0,0,-1,1 };
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
ll read() { ll u, k = scanf("%lld", &u); return u; }
string reads() { string s; cin >> s; return s; }
H readh(bool g = 0) { H u; int k = scanf("%lld %lld", &u.fs, &u.sc); if (g) u.fs--, u.sc--; return u; }
bool inarea(H t, int h, int w) { return 0 <= t.fs && t.fs < h && 0 <= t.sc && t.sc < w; }
ll gcd(ll i, ll j) { return j ? gcd(j, i % j) : i; }
ll mod_pow(ll x, ll n, ll p = mod) {
ll res = 1; x %= p;
while (n > 0) {
if (n & 1) res = res * x % p;
x = x * x % p;
n >>= 1;
}
return res;
}//x^n%p
ll bitcount(ll x) {
int sum = 0; for (int i = 0; i < 60; i++)if ((1ll << i) & x) sum++;
return sum;
}
constexpr int fn_ = 5000005;
ll fact_[fn_], comp_[fn_];
ll comb(ll x, ll y, ll m) {
if (!fact_[0]) {
fact_[0] = 1; comp_[0] = 1;
for (int i = 1; i < fn_; i++)
fact_[i] = fact_[i - 1] * i % m;
comp_[fn_ - 1] = mod_pow(fact_[fn_ - 1], m - 2, m);
for (int i = fn_ - 2; i > 0; i--)
comp_[i] = comp_[i + 1] * (i + 1) % m;
}
if (x < y) return 0;
return fact_[x] * comp_[x - y] % m * comp_[y] % m;
}
//--------------------------------------------------------------
class UnionFind {
#define H pair<int, int>
#define fs first
#define sc second
public:
int size = 0;
H pa[1000010];
void init(int n) {
size = n;
for (int i = 0; i <= size; i++) pa[i] = H{ i,1 };
}
int root(int x) {
if (pa[x].fs == x) return x;
return pa[x].fs = root(pa[x].fs);
}
void unite(int x, int y) {
x = root(x); y = root(y);
if (pa[x].sc < pa[y].sc) swap(x, y);
if (x == y) return;
pa[x].sc += pa[y].sc;
pa[y].fs = x;
}
bool same(int x, int y) {
return root(x) == root(y);
}
H operator[](int x) {
x = root(x);
return pa[x];
}
};
class BIT {
int size;
int dat[5000000];
public:
BIT() {}
void init(int n) {
size = n;
for (int i = 1; i <= n; i++) dat[i] = 0;
}
void add(int i, int x) {
i++;
while (i <= size) {
dat[i] += x;
i += i & -i;
}
}//0-indexed
void add(int l, int r, int x) {
add(l, x); add(r, -x);
}//[l,r)
int query(int i) {
i++;
int sum = 0;
while (i > 0) {
sum += dat[i];
i -= i & -i;
}
return sum;
}//0-indexed
int query(int l, int r) {
return query(r - 1) - query(l - 1);
}//[l,r)
};//size, 0-indexed
BIT bit;
UnionFind uf;
vec<int>e[1000010];
int a[2000000];
int c[2000000];
int d[2000000];
int idx;
H b[1000010];
void solve(int x) {
b[x].fs = idx;
a[idx++] = x;
for (auto g : e[x]) {
solve(g);
}
b[x].sc = idx;
a[idx++] = x;
}
signed main() {
int n, q; cin >> n >> q;
uf.init(2*n);
vec<P>v;
int m = n;
rep(i, 2000000) c[i] = i;
rep(i, q) {
int t, a, b;
scanf("%lld %lld %lld", &t, &a, &b);
v.ppp(t, a, b);
if (t == 1) {
a--; b--;
if (!uf.same(a, b)) {
a = uf[a].fs, b = uf[b].fs;
e[m].pb(c[a]);
e[m].pb(c[b]);
d[c[b]]++; d[c[a]]++;
uf.unite(a, b);
c[uf[a].fs] = m++;
}
}
}
rep(i, m) {
if (d[i] == 0) {
solve(i);
}
}
uf.init(n);
bit.init(idx);
int k = n;
rep(i, m) c[i] = i;
rep(i, q) {
if (v[i].fs == 1) {
if (uf.same(v[i].yy - 1, v[i].zz - 1)) continue;
uf.unite(v[i].yy - 1, v[i].zz - 1);
c[uf[v[i].yy - 1].fs] = k++;
}
else if (v[i].fs == 2) {
int t = c[uf[v[i].yy - 1].fs];
bit.add(b[t].fs, b[t].sc, v[i].zz);
}
else {
int t = v[i].yy - 1;
printf("%lld\n", bit.query(b[t].fs));
}
}
}