Submission #1235708

#TimeUsernameProblemLanguageResultExecution timeMemory
1235708Muhammad_Aneeq수천개의 섬 (IOI22_islands)C++20
5 / 100
18 ms4456 KiB
#include "islands.h" #include <variant> #include <vector> using namespace std; variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V) { if (N ==2) { vector<int>ind[2]={}; for (int i=0;i<M;i++) ind[U[i]].push_back(i); if (ind[0].size()>1&&ind[1].size()) { vector<int>ans; ans.push_back(ind[0][0]); ans.push_back(ind[1][0]); ans.push_back(ind[0][1]); ans.push_back(ind[0][0]); ans.push_back(ind[1][0]); ans.push_back(ind[0][1]); return ans; } else return false; } return false; }
#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...