제출 #1024856

#제출 시각아이디문제언어결과실행 시간메모리
1024856Svizel_pritula가장 긴 여행 (IOI23_longesttrip)C++17
5 / 100
7 ms428 KiB
#include <bits/stdc++.h> #include "longesttrip.h" int find_opposite(std::vector<int> set, int node) { for (auto p = set.begin(); p < set.end(); p++) { if (are_connected({node}, {*p})) { return *p; } } } std::vector<int> longest_trip(int cities, int density) { std::vector<int> path; path.push_back(0); std::vector<int> unconnected; for (int i = 1; i < cities; i++) unconnected.push_back(i); while (unconnected.size() > 0) { bool found = false; for (auto p = unconnected.begin(); p < unconnected.end(); p++) { if (are_connected({path.back()}, {*p})) { path.push_back(*p); unconnected.erase(p); found = true; break; } } if (!found) { break; } } if (unconnected.size() == 0) return path; int last_join_point = -1; int best_distance = std::numeric_limits<int>::max(); int best_start = 0; int best_end = path.size() - 1; for (int i = 0; i <= path.size(); i++) { if (are_connected(unconnected, {path[i]})) { int distance = i - last_join_point - 1; if (distance < best_distance) { best_distance = distance; best_start = last_join_point; best_end = i; } last_join_point = i; } } int distance = path.size() - last_join_point - 1; if (distance < best_distance) { best_distance = distance; best_start = last_join_point; best_end = path.size(); } int start_op = best_start == -1 ? unconnected.front() : find_opposite(unconnected, path[best_start]); int end_op = best_end == path.size() ? unconnected.back() : find_opposite(unconnected, path[best_end]); }

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

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:55:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |     for (int i = 0; i <= path.size(); i++)
      |                     ~~^~~~~~~~~~~~~~
longesttrip.cpp:82:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |     int end_op = best_end == path.size() ? unconnected.back() : find_opposite(unconnected, path[best_end]);
      |                  ~~~~~~~~~^~~~~~~~~~~~~~
longesttrip.cpp:81:9: warning: unused variable 'start_op' [-Wunused-variable]
   81 |     int start_op = best_start == -1 ? unconnected.front() : find_opposite(unconnected, path[best_start]);
      |         ^~~~~~~~
longesttrip.cpp:82:9: warning: unused variable 'end_op' [-Wunused-variable]
   82 |     int end_op = best_end == path.size() ? unconnected.back() : find_opposite(unconnected, path[best_end]);
      |         ^~~~~~
longesttrip.cpp: In function 'int find_opposite(std::vector<int>, int)':
longesttrip.cpp:14:1: warning: control reaches end of non-void function [-Wreturn-type]
   14 | }
      | ^
longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:21:22: warning: control reaches end of non-void function [-Wreturn-type]
   21 |     std::vector<int> unconnected;
      |                      ^~~~~~~~~~~
#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...