# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
18424 | tlwpdus | 전선 연결하기 (GA9_wire) | C++98 | 0 ms | 65536 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<stdio.h>
#include<algorithm>
#include<set>
#include<vector>
#include<string.h>
using namespace std;
vector<int> lis[300100];
struct unionfind {
int par[300100];
void init(int n) {
int i;
for (i=0;i<n;i++) par[i] = i;
}
int find(int u) {
if (u==par[u]) return u;
return (par[u] = find(par[u]));
}
bool uni(int u, int v) {
u = find(u), v = find(v);
if (u==v) return false;
par[u] = v;
return true;
}
} unf;
struct segtree {
set<int> tree[2100000];
# | 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... |