Submission #1247534

#TimeUsernameProblemLanguageResultExecution timeMemory
1247534m5588ohammedThousands Islands (IOI22_islands)C++20
5 / 100
22 ms9072 KiB
#include "islands.h" #include <bits/stdc++.h> using namespace std; int n,m; vector <int> v[200001]; std::variant<bool, std::vector<int>> find_journey(int N, int M, std::vector<int> U, std::vector<int> V) { n=N,m=M; if(n==2){ vector <int> a,b; for(int i=0;i<m;i++){ if(U[i]==0) a.push_back(i); else b.push_back(i); } if(a.size()>=2&&b.size()>=1) return vector <int> ({a[0],b[0],a[1],a[0],b[0],a[1]}); 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...