Submission #733863

#TimeUsernameProblemLanguageResultExecution timeMemory
733863vjudge1City Mapping (NOI18_citymapping)C++17
25 / 100
120 ms8776 KiB
#include "citymapping.h" #include <bits/stdc++.h> using namespace std; using ll = long long; void find_roads(int N, int Q, int A[], int B[], int W[]) { vector<tuple<ll, int, int>> T; for (int i = 0; i < N; i++) { for (int j = i + 1; j < N; j++) { T.emplace_back(get_distance(i + 1, j + 1), i, j); } } sort(T.begin(), T.end()); vector<int> par(N); iota(par.begin(), par.end(), 0); function<int(int)> find = [&](int x) { return x == par[x] ? x : par[x] = find(par[x]); }; int p = 0; for (int i = 0; i < T.size(); i++) { auto [z, x, y] = T[i]; if (find(x) != find(y)) { A[p] = x + 1; B[p] = y + 1; W[p] = z; p++; par[find(x)] = find(y); } } }

Compilation message (stderr)

citymapping.cpp: In function 'void find_roads(int, int, int*, int*, int*)':
citymapping.cpp:19:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::tuple<long long int, int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |  for (int i = 0; i < T.size(); i++) {
      |                  ~~^~~~~~~~~~
#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...