Submission #835860

#TimeUsernameProblemLanguageResultExecution timeMemory
835860APROHACKThousands Islands (IOI22_islands)C++17
0 / 100
2 ms4180 KiB
#include "islands.h" #include <variant> #include <vector> std::variant<bool, std::vector<int>> find_journey( int N, int M, std::vector<int> U, std::vector<int> V) { int cuenta[N][N]; if (N == 2) { for(int i = 0 ; i < M ; i ++ ){ cuenta[U[i]][V[i]] ++ ; } if(cuenta[0][1] >= 2 and cuenta[1][0] >= 1)return true; 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...