# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
254682 | Mahdi_Jfri | Bridges (APIO19_bridges) | C++14 | 3022 ms | 24844 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 ll long long
#define pb push_back
#define lb(a) ((a)&(-(a)))
const int maxn = 1e5 + 20;
const int sq = 1000;
int from[maxn] , to[maxn] , w[maxn];
bool has[maxn];
int e[maxn] , nw[maxn] , s[maxn] , tmpw[maxn] , ans[maxn] , type[maxn];
vector<int> edges[maxn * 2] , query[maxn * 2];
vector<pair<int , int> > history;
int par[maxn / 2];
int root(int v , bool compress = 1)
{
if(compress)
return (par[v] < 0? v : par[v] = root(par[v]));
while(par[v] >= 0)
v = par[v];
return v;
# | 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... |