# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
868396 | lovrot | One-Way Streets (CEOI17_oneway) | C++17 | 67 ms | 21756 KiB |
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 <cstdio>
#include <vector>
#include <cstring>
#define X first
#define Y second
#define MP make_pair
#define EB emplace_back
using namespace std;
typedef pair<int, int> pii;
const int N = 1e5 + 10;
int n, m, q, A[N], B[N];
int U[N];
int _find(int u) {
if(U[u] == -1) return u;
return U[u] = _find(U[u]);
}
void _union(int u, int v) {
U[_find(u)] = _find(v);
}
int PE[N], DEP[N];
vector<pii> G[N];
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |