Submission #1042395

#TimeUsernameProblemLanguageResultExecution timeMemory
1042395Alihan_8Thousands Islands (IOI22_islands)C++17
5 / 100
19 ms8280 KiB
#include "islands.h" #include <variant> #include <vector> #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) { int n = N, m = M; vector <vector<int>> id(n, vector <int> (n)); for ( int i = 0; i < m; i++ ){ id[U[i]][V[i]] = i; } if ( n == 2 ) return false; return vector <int> {id[0][1], id[1][2], id[2][0], id[0][2], id[1][2], id[0][1], id[2][0], id[0][2]}; }
#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...