結果
問題 | No.1054 Union add query |
ユーザー | ir5 |
提出日時 | 2024-06-21 01:59:17 |
言語 | C++23(gcc13) (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 824 ms / 2,000 ms |
コード長 | 3,400 bytes |
コンパイル時間 | 2,136 ms |
コンパイル使用メモリ | 152,468 KB |
実行使用メモリ | 50,364 KB |
最終ジャッジ日時 | 2024-06-21 01:59:27 |
合計ジャッジ時間 | 9,328 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 641 ms
18,904 KB |
testcase_04 | AC | 824 ms
50,364 KB |
testcase_05 | AC | 594 ms
14,336 KB |
testcase_06 | AC | 617 ms
27,080 KB |
testcase_07 | AC | 556 ms
26,952 KB |
testcase_08 | AC | 514 ms
26,952 KB |
testcase_09 | AC | 756 ms
48,220 KB |
testcase_10 | AC | 351 ms
48,176 KB |
ソースコード
#include <algorithm> #include <cassert> #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath> #include <iostream> #include <numeric> #include <vector> #include <map> #include <set> #include <queue> #include <functional> #include <iomanip> #include <type_traits> using namespace std; using ll = long long; class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n; public:range(int n_):i({0}),n({n_}){}range(int i_,int n_):i({i_}),n({n_}){}I& begin(){return i;}I& end(){return n;}}; template<typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << "{" << p.first << ", " << p.second << "}"; } template<typename T> ostream& operator<<(ostream& os, const vector<T>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}"; } template<typename T> ostream& operator<<(ostream& os, const set<T>& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}"; } template<typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& obj) { os << "map{"; for (const auto& e : obj) os << e << ", "; return os << "}"; } #ifdef ONLINE_JUDGE #define dump(expr) ; #else #define dump(expr) { cerr << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; } #endif struct UnionFindWithWeights { vector<int> data, weights; vector<vector<ll>> members; vector<ll> adding; vector<ll> vals; UnionFindWithWeights(int n) : data(n, -1), weights(n, 1) { members.resize(n); for (int i : range(n)) members[i].push_back(i); adding.assign(n, 0); vals.assign(n, 0); } int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); } bool find(int x, int y) { return root(x) == root(y); } void uni(int x, int y) { x = root(x); y = root(y); if (x != y) { int x0 = x, y0 = y; if (weights[x0] < weights[y0]) swap(x0, y0); int new_weight = weights[x] + weights[y]; data[y0] = x0; weights[x0] = new_weight; for (auto& m : members[y0]) vals[m] += adding[y0] - adding[x0]; members[x0].insert(members[x0].end(), members[y0].begin(), members[y0].end()); } } int weight(int x) { return weights[root(x)]; } }; namespace solver { int n, q; vector<int> ts, as, bs; void read() { cin >> n >> q; ts.resize(q); as.resize(q); bs.resize(q); for (int i : range(q)) cin >> ts[i] >> as[i] >> bs[i]; } using RetType = void; RetType run() { UnionFindWithWeights uf(n + 1); for (int i : range(q)) { int t = ts[i], a = as[i], b = bs[i]; dump("Q " << t << " " << a << " " << b); dump("MEM " << uf.members); dump("VAL " << uf.vals); dump("ADD " << uf.adding); if (t == 1) uf.uni(a, b); if (t == 2) { a = uf.root(a); dump("ROOT " << a << " " << b); uf.adding[a] += b; } if (t == 3) { int root = uf.root(a); ll val = uf.vals[a] + uf.adding[root]; cout << val << endl; } } } } // namespace template <typename F> void run(F f) { if constexpr (std::is_same_v<decltype(f()), void>) f(); else cout << f() << endl; } int main(int argc, char** argv) { cerr << fixed << setprecision(12); cout << fixed << setprecision(12); int testcase = 1; if (argc > 1) testcase = atoi(argv[1]); while (testcase--) { solver::read(); } run(solver::run); }