結果
問題 | No.2296 Union Path Query (Hard) |
ユーザー | t98slider |
提出日時 | 2023-03-07 07:17:53 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 444 ms / 7,000 ms |
コード長 | 3,829 bytes |
コンパイル時間 | 2,475 ms |
コンパイル使用メモリ | 193,364 KB |
実行使用メモリ | 37,080 KB |
最終ジャッジ日時 | 2024-05-02 14:04:54 |
合計ジャッジ時間 | 18,582 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 21 ms
28,240 KB |
testcase_02 | AC | 21 ms
28,368 KB |
testcase_03 | AC | 21 ms
28,108 KB |
testcase_04 | AC | 189 ms
31,192 KB |
testcase_05 | AC | 193 ms
31,316 KB |
testcase_06 | AC | 225 ms
32,852 KB |
testcase_07 | AC | 225 ms
34,132 KB |
testcase_08 | AC | 230 ms
34,128 KB |
testcase_09 | AC | 184 ms
21,148 KB |
testcase_10 | AC | 188 ms
21,152 KB |
testcase_11 | AC | 189 ms
21,024 KB |
testcase_12 | AC | 179 ms
18,832 KB |
testcase_13 | AC | 93 ms
5,376 KB |
testcase_14 | AC | 87 ms
5,376 KB |
testcase_15 | AC | 251 ms
33,620 KB |
testcase_16 | AC | 236 ms
26,620 KB |
testcase_17 | AC | 147 ms
10,812 KB |
testcase_18 | AC | 331 ms
35,156 KB |
testcase_19 | AC | 236 ms
19,220 KB |
testcase_20 | AC | 326 ms
35,152 KB |
testcase_21 | AC | 313 ms
33,616 KB |
testcase_22 | AC | 310 ms
33,360 KB |
testcase_23 | AC | 150 ms
36,172 KB |
testcase_24 | AC | 129 ms
19,288 KB |
testcase_25 | AC | 144 ms
34,644 KB |
testcase_26 | AC | 141 ms
34,644 KB |
testcase_27 | AC | 274 ms
34,644 KB |
testcase_28 | AC | 266 ms
34,644 KB |
testcase_29 | AC | 296 ms
35,668 KB |
testcase_30 | AC | 297 ms
35,668 KB |
testcase_31 | AC | 444 ms
32,976 KB |
testcase_32 | AC | 433 ms
32,724 KB |
testcase_33 | AC | 382 ms
31,960 KB |
testcase_34 | AC | 271 ms
31,428 KB |
testcase_35 | AC | 259 ms
31,060 KB |
testcase_36 | AC | 251 ms
29,912 KB |
testcase_37 | AC | 403 ms
23,856 KB |
testcase_38 | AC | 416 ms
23,336 KB |
testcase_39 | AC | 405 ms
23,856 KB |
testcase_40 | AC | 410 ms
23,856 KB |
testcase_41 | AC | 1 ms
5,376 KB |
testcase_42 | AC | 2 ms
5,376 KB |
testcase_43 | AC | 2 ms
5,376 KB |
testcase_44 | AC | 227 ms
36,312 KB |
testcase_45 | AC | 237 ms
36,184 KB |
testcase_46 | AC | 244 ms
37,076 KB |
testcase_47 | AC | 258 ms
37,080 KB |
testcase_48 | AC | 246 ms
36,564 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll = long long; struct problem_H { int MAX_LOGV, N; vector<vector<pair<int, int>>> G; vector<vector<int>> parent; vector<ll> dp; vector<int> depth; vector<int> parent_or_size; vector<ll> diameter; vector<array<int, 2>> diameter_vertex; queue<int> que; problem_H(int n) : N(n) { MAX_LOGV = __lg(N) + 1; G.resize(N); parent.resize(MAX_LOGV, vector<int>(N, -1)); parent_or_size.resize(N, -1); dp.resize(N), depth.resize(N); diameter.resize(N); diameter_vertex.resize(N); for(int i = 0; i < N; i++) diameter_vertex[i] = {i, i}; } int leader(int v){ return parent_or_size[v] < 0 ? v : parent_or_size[v]; } void merge(int u, int v, int w){ int x = leader(u), y = leader(v); if(-parent_or_size[x] < -parent_or_size[y]) { swap(x, y); swap(u, v); } parent_or_size[x] += parent_or_size[y]; G[u].emplace_back(v, w); G[v].emplace_back(u, w); update_parent(v, u, w); que.emplace(v); while(!que.empty()){ v = que.front(); que.pop(); parent_or_size[v] = x; for(auto &edge : G[v]){ tie(u, w) = edge; if(parent[0][v] == u) continue; update_parent(u, v, w); que.emplace(u); } } update_diameter(x, y); } void update_parent(int &v, int &par, int &w){ parent[0][v] = par; int depth_log = __lg(max(depth[v], depth[par] + 1)); depth[v] = depth[par] + 1; dp[v] = dp[par] + w; for(int i = 0; i < depth_log; i++){ parent[i + 1][v] = parent[i][v] == -1 ? -1 : parent[i][parent[i][v]]; } } void update_diameter(int &x, int &y){ ll mx; int u, v; if(diameter[x] >= diameter[y]) { mx = diameter[x]; u = diameter_vertex[x][0], v = diameter_vertex[x][1]; } else { mx = diameter[y]; u = diameter_vertex[y][0], v = diameter_vertex[y][1]; } for(int i = 0; i < 2; i++){ for(int j = 0; j < 2; j++){ ll d = dist(diameter_vertex[x][i], diameter_vertex[y][j]); if(d > mx){ mx = d; u = diameter_vertex[x][i], v = diameter_vertex[y][j]; } } } diameter[x] = mx; diameter_vertex[x] = {u, v}; } long long dist(int u, int v){ if(leader(u) != leader(v)) return -1; if(depth[v] < depth[u]) swap(v, u); long long res = dp[u] + dp[v]; int d = depth[v] - depth[u]; while(d){ v = parent[__builtin_ctz(d & -d)][v]; d -= d & -d; } if(u == v) return res - 2 * dp[v]; for(int i = __lg(depth[v]); i >= 0; i--){ if(parent[i][v] != parent[i][u]){ v = parent[i][v]; u = parent[i][u]; } } v = parent[0][v]; return res - 2 * dp[v]; } }; int main(){ ios::sync_with_stdio(false); cin.tie(0); int N, Q; ll X; cin >> N >> X >> Q; problem_H uf(N); int type, u, v, w; while(Q--){ cin >> type; if(type == 1){ cin >> v >> w; uf.merge(v, X, w); }else if(type == 2){ cin >> u >> v; ll d = uf.dist(u, v); cout << d << '\n'; if(d != -1) (X += d) %= N; }else if(type == 3){ cin >> v; cout << uf.diameter[uf.leader(v)] << '\n'; }else{ cin >> v; X += v; if(X >= N) X -= N; } } }