Submission #1235584

#TimeUsernameProblemLanguageResultExecution timeMemory
1235584Ghulam_JunaidThousands Islands (IOI22_islands)C++20
6.75 / 100
28 ms9040 KiB
#include <bits/stdc++.h> #include "islands.h" using namespace std; const int N = 2e5 + 10; int n, m, out[N]; vector<int> g[N]; variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V) { n = N, m = M; for (int i = 0; i < m; i ++){ g[U[i]].push_back(i); out[U[i]]++; } if (N == 2){ if (out[0] < 2 or out[1] < 1) return false; int e1 = g[0][0], e2 = g[0][1], e3 = g[1][0]; return vector<int>({e1, e3, e2, e1, e3, e2}); } return true; if (N == 4) { return vector<int>({0, 1, 2, 4, 0, 3, 2, 1, 4, 3}); } 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...