QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#161922 | #7103. Red Black Tree | ucup-team1198# | AC ✓ | 772ms | 22592kb | C++20 | 2.7kb | 2023-09-03 02:46:30 | 2023-09-03 02:46:30 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define ld long double
#define all(a) (a).begin(), (a).end()
const int MAXN = 100'100;
const int K = 17;
vector<pair<int, int>> G[MAXN];
bool is_red[MAXN];
long long pref_sum[MAXN];
long long weight[MAXN];
int up[MAXN][K];
int depth[MAXN];
void dfs(int v, int p, int w, long long sum) {
up[v][0] = p;
depth[v] = w;
pref_sum[v] = sum;
for (auto [u, c] : G[v]) {
if (u == p)
continue;
if (is_red[u])
weight[u] = 0;
else
weight[u] = weight[v] + c;
dfs(u, v, w + 1, sum + c);
}
}
int la(int v, int d) {
for (int k = K - 1; k >= 0; --k) {
if (d >= (1 << k)) {
d -= 1 << k;
v = up[v][k];
}
}
return v;
}
int lca(int u, int v) {
if (depth[u] > depth[v])
u = la(u, depth[u] - depth[v]);
else
v = la(v, depth[v] - depth[u]);
if (u == v)
return u;
for (int k = K - 1; k >= 0; --k) {
if (up[v][k] != up[u][k]) {
v = up[v][k];
u = up[u][k];
}
}
return up[v][0];
}
void solve() {
int n, m, q;
cin >> n >> m >> q;
fill(is_red, is_red + n, false);
for (int i = 0; i < m; ++i) {
int v;
cin >> v;
is_red[v - 1] = true;
}
for (int i = 1; i < n; ++i) {
int a, b, c;
cin >> a >> b >> c;
G[a - 1].emplace_back(b - 1, c);
G[b - 1].emplace_back(a - 1, c);
}
dfs(0, 0, 0, 0);
for (int j = 1; j < K; ++j) {
for (int v = 0; v < n; ++v)
up[v][j] = up[up[v][j - 1]][j - 1];
}
vector<int> cur;
while (q--) {
int cnt;
cin >> cnt;
cur.resize(cnt);
for (int i = 0; i < cnt; ++i) {
cin >> cur[i];
--cur[i];
}
stable_sort(cur.begin(), cur.end(), [](int a, int b) {
return weight[a] > weight[b];
});
long long ans = weight[cur[0]];
int ancestor = cur[0];
long long mx_pref_sum = pref_sum[cur[0]];
for (int i = 0; i < cur.size(); ++i) {
ancestor = lca(ancestor, cur[i]);
mx_pref_sum = max(mx_pref_sum, pref_sum[cur[i]]);
long long cur_val = mx_pref_sum - pref_sum[ancestor];
if (i + 1 < cur.size())
cur_val = max(cur_val, weight[cur[i + 1]]);
ans = min(ans, cur_val);
}
cout << ans << '\n';
}
for (int i = 0; i < n; ++i)
G[i].clear();
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
solve();
}
return 0;
}
这程序好像有点Bug,我给组数据试试?
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 7724kb
input:
2 12 2 4 1 9 1 2 1 2 3 4 3 4 3 3 5 2 2 6 2 6 7 1 6 8 2 2 9 5 9 10 2 9 11 3 1 12 10 3 3 7 8 4 4 5 7 8 4 7 8 10 11 3 4 5 12 3 2 3 1 2 1 2 1 1 3 1 1 1 2 1 2 3 1 2 3
output:
4 5 3 8 0 0 0
result:
ok 7 lines
Test #2:
score: 0
Accepted
time: 772ms
memory: 22592kb
input:
522 26 1 3 1 1 4 276455 18 6 49344056 18 25 58172365 19 9 12014251 2 1 15079181 17 1 50011746 8 9 2413085 23 24 23767115 22 2 26151339 26 21 50183935 17 14 16892041 9 26 53389093 1 20 62299200 24 18 56114328 11 2 50160143 6 26 14430542 16 7 32574577 3 16 59227555 3 15 8795685 4 12 5801074 5 20 57457...
output:
148616264 148616264 0 319801028 319801028 255904892 317070839 1265145897 1265145897 1072765445 667742619 455103436 285643094 285643094 285643094 317919339 0 785245841 691421476 605409472 479058444 371688030 303203698 493383271 919185207 910180170 919185207 121535083 181713164 181713164 181713164 181...
result:
ok 577632 lines
Extra Test:
score: 0
Extra Test Passed