# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
2677 | gs13068 | 간선 파괴 (GA5_destroy) | C++98 | 1288 ms | 34616 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>
#define BUCKET_SIZE 6
int s[300000];
int e[300000];
struct edge
{
int s;
int e;
} temp;
std::vector<edge> pre[5000];
std::vector<edge> suf[5000];
int parent[1000];
int height[1000];
inline int root(int x)
{
return parent[x]==x?x:parent[x]=root(parent[x]);
}
inline void combine(int a,int b)
{
a=root(a);
b=root(b);
if(height[a]<height[b])parent[a]=b;
else parent[b]=a;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |