// todo
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pi = array<int, 2>;
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
const int MAX = 4050000;
int n, k, q, t, r1, r2;
int a[MAX], b[MAX], c[MAX], d[MAX];
vector<int> ids;
struct tree1 {
int dep[MAX], par[20][MAX];
vector<int> gph[MAX];
vector<pi> adj[MAX];
lint dist[MAX];
bool seen[MAX];
void add(int u, int v) {
gph[u].push_back(v);
gph[v].push_back(u);
}
void dfs(int x, int px) {
cout << "dfs " << x << " " << px << endl;
if (sz(ids) < k) {
ids.push_back(x);
}
dep[x] = dep[px] + 1;
par[0][x] = px;
for (int i = 1; i < 20; i++)
par[i][x] = par[i - 1][par[i - 1][x]];
for (auto& y : gph[x]) {
if (y == px) continue;
dfs(y, x);
}
}
int getlca(int s, int e) {
if (dep[s] < dep[e]) swap(s, e);
for (int i = 19; i >= 0; i--)
if (dep[par[i][s]] >= dep[e])
s = par[i][s];
if (s == e) return s;
for (int i = 19; i >= 0; i--)
if (par[i][s] != par[i][e])
s = par[i][s], e = par[i][s];
return par[0][s];
}
void dfs(int x) {
seen[x] = true;
for (auto& y : adj[x]) {
if (seen[y[0]]) continue;
dist[y[0]] = dist[x] + y[1];
dfs(y[0]);
}
}
void build() {
for (int i = 0; i + 1 < k; i++) {
int x = ids[i];
int y = ids[i + 1];
int z = getlca(ids[i], ids[i + 1]);
adj[x].push_back({z, -a[i]});
adj[z].push_back({x, a[i]});
adj[y].push_back({z, -b[i]});
adj[z].push_back({y, b[i]});
}
dfs(r1);
}
lint query(int x, int y) {
return dist[x] + dist[y] - 2 * dist[getlca(x, y)];
}
} tree1;
struct tree2 {
int dfn[MAX], T;
int pl[MAX], pr[MAX];
vector<int> gph[MAX];
lint pref[MAX];
void add(int u, int v) {
gph[u].push_back(v);
gph[v].push_back(u);
}
void dfs(int x, int px) {
dfn[x] = ++T;
for (auto& y : gph[x]) {
if (y == px) continue;
dfs(y, x);
}
}
void order() {
sort(all(ids), [&](int i, int j) { return dfn[i] < dfn[j]; });
}
void build() {
// ...
}
lint query(int x, int y) {
// ...
return 0;
}
} tree2;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> k >> q >> t;
for (int i = 0; i < n; i++) {
int p;
cin >> p;
if (p == -1) {
r1 = i;
} else {
--p;
tree1.add(i, p);
}
}
for (int i = 0; i < n; i++) {
int p;
cin >> p;
if (p == -1) {
r2 = i;
} else {
--p;
tree2.add(i, p);
}
}
tree1.dfs(r1, r1);
tree2.dfs(r2, r2);
tree2.order();
for (int i = 0; i < k; i++) {
cout << ids[i] + 1 << " ";
}
cout << endl;
for (int i = 0; i + 1 < k; i++) {
cout << "? " << ids[i] + 1 << " " << ids[i + 1] + 1 << "\n";
}
cout << "!" << endl;
for (int i = 0; i + 1 < k; i++) {
cin >> a[i] >> b[i] >> c[i] >> d[i];
}
tree1.build();
tree2.build();
vector<int> x(t), y(t);
for (int i = 0; i < t; i++) {
cin >> x[i] >> y[i];
--x[i]; --y[i];
}
for (int i = 0; i < t; i++) {
cout << tree1.query(x[i], y[i]) << " " << tree2.query(x[i], y[i]) << "\n";
}
cout << endl;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
471 ms |
362040 KB |
Execution killed with signal 13 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
465 ms |
368184 KB |
Execution killed with signal 13 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
467 ms |
362048 KB |
Execution killed with signal 13 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
931 ms |
448644 KB |
Execution killed with signal 13 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
929 ms |
436356 KB |
Execution killed with signal 13 |
| 2 |
Halted |
0 ms |
0 KB |
- |
