제출 #515986

#제출 시각아이디문제언어결과실행 시간메모리
515986JooCity Mapping (NOI18_citymapping)C++17
13 / 100
2 ms460 KiB
#include "citymapping.h" #include <bits/stdc++.h> using namespace std; void find_roads(int N, int Q, int A[], int B[], int W[]) { int leaf = 0; long long mx = 0; for(int i = 2; i <= N; i++){ long long res = get_distance(1, i); if(res > mx){ mx = res; leaf = i; } } vector<pair<int, int>> vec; for(int i = 1; i <= N; i++){ long long res = get_distance(leaf, i); vec.emplace_back(res, i); } sort(vec.begin(), vec.end()); for(int i = 0; i+1 < vec.size(); i++){ A[i] = vec[i].second; B[i] = vec[i+1].second; W[i] = vec[i+1].first-vec[i].first; } return; }

컴파일 시 표준 에러 (stderr) 메시지

citymapping.cpp: In function 'void find_roads(int, int, int*, int*, int*)':
citymapping.cpp:23:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |  for(int i = 0; i+1 < vec.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...