Submission #628284

#TimeUsernameProblemLanguageResultExecution timeMemory
628284MarkBcc168Thousands Islands (IOI22_islands)C++17
0 / 100
2 ms468 KiB
#include <bits/stdc++.h> using namespace std; std::variant<bool, std::vector<int>> find_journey( int n, int m, std::vector<int> u, std::vector<int> v){ assert(n==2); vector<int> a, b; for(int i=0;i<n;++i){ if(u[i]==0) a.push_back(i); if(u[i]==1) b.push_back(i); } if(a.size() < 2 || b.size() < 1) return false; else return vector<int>{a[0], b[0], a[1], a[0], b[0], a[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...