Submission #1028815

#TimeUsernameProblemLanguageResultExecution timeMemory
1028815MardonbekhazratovThousands Islands (IOI22_islands)C++17
6.75 / 100
21 ms6864 KiB
#include "islands.h" #include <variant> #include <vector> #include <tuple> using namespace std; int n,m; vector<int>u,v; std::variant<bool, std::vector<int>> find_journey(int N, int M, std::vector<int> U, std::vector<int> V) { tie(n,m,u,v)=tie(N,M,U,V); vector<int>c1,c2; for(int i=0;i<m;i++){ if(u[i]==0) c1.push_back(i); else c2.push_back(i); } if(c1.size()<2 || c2.size()<1) return false; return vector<int>({c1[0],c2[0],c1[1],c1[0],c2[0],c1[1]}); }
#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...