# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
901637 | alexander707070 | Reconstruction Project (JOI22_reconstruction) | C++14 | 1460 ms | 68412 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>
#define MAXN 1000007
using namespace std;
const int inf=1e9;
struct edge{
int from,to,cost;
};
int n,m,a,b,c,pt,q,pos,l,r,mid,lt,rt;
int dsu[MAXN],sz[MAXN];
int mins[MAXN],maxs[MAXN];
long long incr[MAXN],sum,ans[MAXN],mult[MAXN],t,x[MAXN];
edge e[MAXN];
bool cmp(edge fr,edge sc){
return fr.cost<sc.cost;
}
void reset_dsu(){
for(int i=1;i<=n;i++){
dsu[i]=i; sz[i]=1;
}
}
int root(int x){
if(dsu[x]==x)return x;
dsu[x]=root(dsu[x]);
return dsu[x];
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |