Submission #745238

#TimeUsernameProblemLanguageResultExecution timeMemory
745238math_rabbit_1028Thousands Islands (IOI22_islands)C++17
3.50 / 100
99 ms7436 KiB
#include "islands.h" #include <bits/stdc++.h> using namespace std; int n, m; vector<int> adj[101010]; std::variant<bool, std::vector<int>> find_journey( int N, int M, std::vector<int> U, std::vector<int> V) { n = N; m = M; for (int i = 0; i < m; i++) { adj[U[i]].push_back(V[i]); } if (adj[0].size() >= 2 && adj[1].size() >= 1) { vector<int> ret = {0, 1, 0, 1, 0, 1, 0}; return ret; } 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...