Submission #1037620

#TimeUsernameProblemLanguageResultExecution timeMemory
1037620thinknoexitThousands Islands (IOI22_islands)C++17
10 / 100
19 ms7004 KiB
#include "islands.h" #include <bits/stdc++.h> using namespace std; using ll = long long; variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V) { if (N == 2) { vector<vector<int>> boat(2); for (int i = 0;i < M;i++) boat[U[i]].push_back(i); if ((int)boat[0].size() < 2 || (int)boat[1].size() < 1) return false; vector<int> ans = { boat[0][0], boat[1][0], boat[0][1], boat[0][0], boat[1][0], boat[0][1] }; return ans; } int n = N; vector<vector<int>> boat(n, vector<int>(n, 0)); for (int i = 0;i < M;i++) { boat[U[i]][V[i]] = i; } vector<int> ans = { boat[0][1], boat[1][0], boat[0][2], boat[2][1], boat[0][1], boat[1][0], boat[2][1], boat[0][2] }; return ans; }
#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...