This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "islands.h"
#include <variant>
#include <vector>
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
variant<bool, vi> find_journey(int n, int m, vi U, vi V) {
vi InDeg(n, 0), OutDeg(n, 0);
for(int i = 0; i < m; ++i) {
++OutDeg[U[i]];
++InDeg[V[i]];
}
bool ok = true;
ok &= (OutDeg[0] > 1);
// for(int i = 1; i < n; ++i) {
// if(!InDeg[i] || !OutDeg[i]) ok = false;
// }
return ok;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |