제출 #1043510

#제출 시각아이디문제언어결과실행 시간메모리
1043510jer033수천개의 섬 (IOI22_islands)C++17
9.10 / 100
16 ms4996 KiB
#include "islands.h" #include <bits/stdc++.h> #include <variant> #include <vector> using namespace std; std::variant<bool, std::vector<int>> find_journey(int N, int M, std::vector<int> U, std::vector<int> V) { vector<vector<int>> edges(N); vector<int> deg(N, 0); for (int i=0; i<M; i+=2) { int u = U[i]; int v = V[i]; edges[u].push_back(v); edges[v].push_back(u); deg[u]++; deg[v]++; } if (deg[0]>=2) return true; vector<bool> visited(N, 0); vector<int> visitlist; visited[0] = 1; visitlist.push_back(0); int curr = 0; while (curr < visitlist.size()) { for (int x: edges[visitlist[curr]]) { if (deg[x]>=3) return true; if (visited[x]==0) { visited[x] = 1; visitlist.push_back(x); } } curr++; } return false; }

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

islands.cpp: In function 'std::variant<bool, std::vector<int, std::allocator<int> > > find_journey(int, int, std::vector<int>, std::vector<int>)':
islands.cpp:26:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |     while (curr < visitlist.size())
      |            ~~~~~^~~~~~~~~~~~~~~~~~
#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...