# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
320680 | phathnv | One-Way Streets (CEOI17_oneway) | C++11 | 126 ms | 23780 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 <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define mp make_pair
typedef long long ll;
typedef pair <int, int> ii;
const int N = 1e5 + 1;
const int logN = 17;
struct edge{
int u, v;
edge(int _u = 0, int _v = 0){
u = _u;
v = _v;
}
};
struct dsu{
int root[N], rnk[N];
void reset(int n){
for(int i = 1; i <= n; i++){
root[i] = i;
rnk[i] = 0;
}
}
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... |