QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#456859 | #7103. Red Black Tree | ucup-team3282 | WA | 1514ms | 118788kb | C++14 | 3.0kb | 2024-06-28 15:54:21 | 2024-06-28 15:54:22 |
Judging History
answer
#include <bits/stdc++.h>
#define fi first
#define se second
#define int long long
using namespace std;
const int N = 2e5+9;
int fa[N][21], dep[N], dis[N], n, m, q, r[N], isred[N], anc[N], nr = 1, node[N], k, tot, dfn[N], LG[N], st[N][21], rev[N][21], pos[N];
vector<pair<int, int>> adj[N];
void dfs1(int u, int f, int d) {
fa[u][0] = f; dfn[++tot] = u; dep[tot] = d; pos[u] = tot;
if (!isred[u]) anc[u] = nr;
int tmp = nr;
for (auto i : adj[u]) {
if (i.fi == f) continue;
if (isred[i.fi]) nr = i.fi;
dis[i.fi] = dis[u] + i.se;
dfs1(i.fi, u, d + 1);
dfn[++tot] = u; dep[tot] = d;
}
nr = tmp;
}
void init() {
for (int i = 2; i < N; i++) LG[i] = LG[i >> 1] + 1;
for (int i = 1; i <= tot; i++) {
st[i][0] = dep[i];
rev[i][0] = dfn[i];
}
for (int j = 1; j <= LG[tot]; j++) {
for (int i = 1; i + (1 << j) - 1 <= tot; i++) {
if (st[i][j - 1] < st[i + (1 << (j - 1))][j - 1]) st[i][j] = st[i][j - 1], rev[i][j] = rev[i][j - 1];
else st[i][j] = st[i + (1 << (j - 1))][j - 1], rev[i][j] = rev[i + (1 << (j - 1))][j - 1];
}
}
}
int query(int l, int r) {
int k = LG[r - l + 1];
return st[l][k] < st[r - (1 << k) + 1][k] ? rev[l][k] : rev[r - (1 << k) + 1][k];
}
int lca(int x, int y) {
if (pos[x] > pos[y]) swap(x, y);
return query(pos[x], pos[y]);
}
bool check(int lim) {
int cc = 0;
for (int i = 1; i <= k; i++) {
int u = node[i];
if (dis[u] - dis[anc[u]] <= lim) continue;
cc++;
}
if (cc == 0) return true;
int zx = 0;
for (int i = 1; i <= k; i++) {
int u = node[i];
if (dis[u] - dis[anc[u]] > lim) {
if (!zx) {
zx = u;
continue;
}
zx = lca(zx, u);
}
}
int mx = -1;
for (int i = 1; i <= k; i++) {
int u = node[i];
if (dis[u] - dis[anc[u]] > lim) {
mx = max(mx, dis[u]);
}
}
return mx - dis[zx] <= lim;
}
void solve() {
tot = 0;
cin >> n >> m >> q;
memset(dis, 0, sizeof(int) * (n + 9));
memset(isred, 0, sizeof(int) * (n + 9));
memset(dep, 0, sizeof(int) * (n + 9));
memset(anc, 0, sizeof(int) * (n + 9));
memset(pos, 0, sizeof(int) * (n + 9));
memset(dfn, 0, sizeof(int) * (2 * n + 9));
nr = 1;
for (int i = 0; i <= n; i++) adj[i].clear();
for (int i = 1; i <= m; i++) {
cin >> r[i];
isred[r[i]] = true;
anc[r[i]] = r[i];
}
for (int i = 1, u, v, w; i < n; i++) {
cin >> u >> v >> w;
adj[u].push_back({v, w});
adj[v].push_back({u, w});
}
dfs1(1, 0, 1);
init();
while (q--) {
cin >> k;
for (int i = 1; i <= k; i++) {
cin >> node[i];
}
int l = 0, r = 1e16, ans = 0;
while (l <= r) {
int mid = (l + r) >> 1;
if (check(mid)) {
ans = mid;
r = mid - 1;
} else l = mid + 1;
}
cout << ans << "\n";
}
}
signed main() {
//freopen("B.in", "r", stdin);
ios::sync_with_stdio(false);
cin.tie(nullptr);
int T; cin >> T;
while (T--) {
solve();
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 4ms
memory: 25672kb
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: -100
Wrong Answer
time: 1514ms
memory: 118788kb
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 691421476 691421476 289748355 479058444 371688030 303203698 316137286 872323324 872323324 872323324 121535083 181713164 181713164 181713164 181...
result:
wrong answer 18th lines differ - expected: '785245841', found: '691421476'