#include "citymapping.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1010;
mt19937 rnd(time(NULL));
int n;
ll dis[N][N];
int A[N], B[N], W[N], tot;
ll d(int i, int j) {
if (i == j) return 0;
if (!dis[i][j]) return dis[i][j] = dis[j][i] = get_distance(i, j);
return dis[i][j];
}
void play(vector<int>& v, int U, int V) {
int m = v.size();
if (m == 1) return;
ll all = d(U, V);
vector<pair<ll, int>> in, rem;
for (auto& x : v) {
if (d(U, x) + d(x, V) == all) in.push_back({ d(V, x), x });
else {
ll extra = (d(U, x) + d(x, V) - all) / 2;
rem.push_back({ d(V, x) - extra, x });
}
}
sort(in.begin(), in.end());
sort(rem.begin(), rem.end());
vector<vector<int>> r;
vector<int> p2, p3;
int p = 0;
for (int i = 1;i < (int)in.size();i++) {
A[tot] = in[i - 1].second;
B[tot] = in[i].second;
W[tot] = in[i].first - in[i - 1].first;
tot++;
vector<int> nw;
ll mn = LLONG_MAX;
int idx = 0;
while (p < (int)rem.size() && rem[p].first == in[i].first) {
int vl = rem[p].second;
ll extra = (d(U, vl) + d(vl, V) - all) / 2;
if (extra < mn) {
mn = extra;
idx = vl;
}
nw.push_back(vl);
p++;
}
if (!nw.empty()) {
A[tot] = idx;
B[tot] = in[i].second;
W[tot] = mn;
tot++;
ll mx = -1;
int idx2 = 0;
for (auto& x : nw) {
dis[idx][x] = dis[x][idx] = d(V, x) - mn - in[i].first;
if (dis[idx][x] > mx) {
mx = dis[idx][x];
idx2 = x;
}
}
r.push_back(nw);
p2.push_back(idx);
p3.push_back(idx2);
}
}
for (int i = 0;i < (int)r.size();i++) {
play(r[i], p2[i], p3[i]);
}
}
void find_roads(int NN, int Q, int A[], int B[], int W[]) {
n = NN;
vector<int> init(n);
iota(init.begin(), init.end(), 1);
int leaf = 0, leaf2 = 0;
ll mx = -1, mx2 = -1;
for (int i = 2;i <= n;i++) {
if (d(1, i) > mx2) {
mx2 = d(1, i);
leaf2 = i;
}
if (mx2 > mx) {
swap(mx, mx2);
swap(leaf, leaf2);
}
}
play(init, leaf, leaf2);
for (int i = 0;i < n - 1;i++) {
A[i] = ::A[i];
B[i] = ::B[i];
W[i] = ::W[i];
//cout << A[i] << ' ' << B[i] << ' ' << W[i] << '\n';
}
return;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
7772 KB |
Reported list of edges differ from actual. |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
7772 KB |
Reported list of edges differ from actual. |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
8024 KB |
Reported list of edges differ from actual. |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
8024 KB |
Reported list of edges differ from actual. |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
7772 KB |
Reported list of edges differ from actual. |
| 2 |
Halted |
0 ms |
0 KB |
- |
