Submission #1234273

#TimeUsernameProblemLanguageResultExecution timeMemory
1234273trimkusThousands Islands (IOI22_islands)C++20
1.75 / 100
16 ms3148 KiB
#include "islands.h" #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) { vector<vector<array<int, 3>>> adj(N); vector<int> deg(N); for (int i = 0; i < M; ++i) { deg[U[i]] += 1; } if (deg[0] >= 2) return true; 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...