제출 #813066

#제출 시각아이디문제언어결과실행 시간메모리
813066andrei_boacaThousands Islands (IOI22_islands)C++17
5 / 100
28 ms15700 KiB
#include "islands.h" #include <variant> #include <vector> #include <algorithm> #include <assert.h> #include <map> //#include <bits/stdc++.h> //#include "grader.cpp" using namespace std; int n,m; map<int,vector<int>> c[100005]; vector<int> muchii[100005]; vector<int> sol; void n2(int x,int y) { int A=c[1][0][0]; int B=c[0][1][0]; int C=c[0][1][1]; vector<int> aux={B,A,C,B,A,C}; for(int i:aux) sol.push_back(i); } bool use[100005]; vector<int> lant; bool good; bool inst[100005]; int from[100005]; int who; void s1(int nod) { if(good) return; use[nod]=1; inst[nod]=1; for(int i:muchii[nod]) { if(!inst[i]) { if(c[nod][i].size()>=2&&c[i][nod].size()>=1) { who=i; good=1; int x=nod; while(true) { lant.push_back(x); if(x==0) break; x=from[x]; } return; } if(!use[i]) s1(i); } } } std::variant<bool, std::vector<int>> find_journey(int N, int M, std::vector<int> U, std::vector<int> V) { n=N; m=M; for(int i=0;i<m;i++) { int a=U[i],b=V[i]; c[a][b].push_back(i); if(c[a][b].size()==1) muchii[a].push_back(b); } s1(0); if(good) { reverse(lant.begin(),lant.end()); for(int i=1;i<lant.size();i++) sol.push_back(c[lant[i-1]][lant[i]][0]); n2(lant.back(),who); reverse(lant.begin(),lant.end()); for(int i=1;i<lant.size();i++) sol.push_back(c[lant[i]][lant[i-1]][0]); return sol; } 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:74:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |         for(int i=1;i<lant.size();i++)
      |                     ~^~~~~~~~~~~~
islands.cpp:78:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |         for(int i=1;i<lant.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...