Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <list>
- #include <algorithm>
- #include <string>
- #include <math.h>
- #include <climits>
- //#include <chrono>
- //#include <fstream>
- //#include <bits/stdc++.h>
- #define mp make_pair
- #define pb push_back
- #define eb emplace_back
- #define x first
- #define y second
- #define sz(x) (int)x.size()
- #define all(x) begin(x), end(x)
- #define rall(x) rbegin(x), rend(x)
- #define FOR(i,a,b) for (int i = (a); i < (b); i++)
- #define RFOR(i,b,a) for (int i = (b) - 1; i >= (a); i--)
- using namespace std;
- typedef unsigned long long ull;
- typedef long long ll;
- typedef long double ld;
- typedef pair<int, int> pi;
- typedef pair<ll, ll> pl;
- typedef vector<int> veci;
- typedef vector<bool> vecb;
- typedef vector<vector<int>> vvi;
- typedef vector<vector<bool>> vvb;
- const int INF_I = 1e9;
- const ll INF_LL = 1e18;
- int n;
- veci p, sz, cost;
- int find_set(int v) {
- return (v == p[v] ? v : p[v] = find_set(p[v]));
- }
- void union_set(int a, int b, int w) {
- a = find_set(a);
- b = find_set(b);
- if (sz[a] < sz[b])
- swap(a, b);
- if (a != b) {
- p[b] = a;
- sz[a] += sz[b];
- cost[a] += w + cost[b];
- }
- else
- cost[a] += w;
- }
- int get_sum(int a) {
- return cost[find_set(a)];
- }
- int main() {
- /*ifstream cin("in.txt");
- ofstream cout("out.txt");
- auto start_time = chrono::high_resolution_clock::now();*/
- ios::sync_with_stdio(false);
- cin.tie(0);
- cout.tie(0);
- int m;
- cin >> n >> m;
- p.assign(n, 0);
- sz.assign(n, 1);
- cost.assign(n, 0);
- FOR(i, 0, n)
- p[i] = i;
- for (int i = 0; i < m; i++) {
- int cl;
- cin >> cl;
- if (cl == 1) {
- int a, b, w;
- cin >> a >> b >> w;
- union_set(--a, --b, w);
- }
- else {
- int a;
- cin >> a;
- cout << get_sum(--a) << "\n";
- }
- }
- /*auto end_time = chrono::high_resolution_clock::now();
- chrono::duration<double> duration = end_time - start_time;
- cout << duration.count() << "\n";
- cin.close();
- cout.close();*/
- return 0;
- }
Add Comment
Please, Sign In to add comment