Submission #1235573

#TimeUsernameProblemLanguageResultExecution timeMemory
1235573Ghulam_JunaidThousands Islands (IOI22_islands)C++20
1.75 / 100
36 ms8820 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(V[i]); out[U[i]]++; } if (N == 2){ if (out[0] < 2 or out[1] < 2) return false; return true; } 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...