Submission #837236

#TimeUsernameProblemLanguageResultExecution timeMemory
837236Sohsoh84Thousands Islands (IOI22_islands)C++17
6.75 / 100
38 ms27848 KiB
#include "islands.h" #include <bits/stdc++.h> using namespace std; const int MAXN = 1e6 + 10; int deg[MAXN], n, m; vector<int> f[MAXN]; 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++) deg[U_[i]]++, f[U_[i]].push_back(i); if (deg[0] >= 2 && deg[1] >= 1) return vector<int>({f[0][0], f[1][0], f[0][1], f[0][0], f[1][0], f[0][1]}); 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...