Submission #1024439

#TimeUsernameProblemLanguageResultExecution timeMemory
1024439thinknoexitCity Mapping (NOI18_citymapping)C++17
13 / 100
2 ms4444 KiB
#include "citymapping.h" #include <bits/stdc++.h> using namespace std; using ll = long long; const int N = 1010; int dis[N][N]; int n; int 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 find_roads(int NN, int Q, int A[], int B[], int W[]) { n = NN; int mx = 0, idx = 0; for (int i = 2;i <= n;i++) { if (d(1, i) > mx) { mx = d(1, i); idx = i; } } vector<pair<int, int>> v; for (int i = 1;i <= n;i++) { v.push_back({ d(idx, i), i }); } sort(v.begin(), v.end()); int tot = 0; for (int i = 1;i < n;i++) { A[tot] = v[i - 1].second; B[tot] = v[i].second; W[tot] = v[i].first - v[i - 1].first; tot++; } return; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...