# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
747946 | saayan007 | City Mapping (NOI18_citymapping) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
#include "citymapping.h"
using namespace std;
using ll = long long;
#define eb emplace_back
#define nl endl
#define qry qry
void find_roads(int N, int Q, int A[], int B[], int W[]) {
deque<int> path;
vector<int> node[N + 1];
for(int i = 2; i <= N; ++i) {
int d = qry(1, i);
node[d].eb(i);
}
path.eb(1);
for(int i = 1; i <= N; ++i) {
if((int)dist[i].size() == 2) {
int a = node[i][0], b = node[i][1];
if(qry(a, path.back()) == 1) swap(a, b);
path.emplace_front(a); path.eb(b);
}
else if((int) dist[i].size() == 2) {
int a = node[i][0];
if(qry(a, path.back()) == 1) path.eb(a);
else path.emplace_front(a);
}
}
for(int i = 0; i < N - 1; ++i) {
A[i] = path[i], B[i] = path[i + 1], W[i] = 1;
}
return;
}