# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
701169 | Quan2003 | Swapping Cities (APIO20_swap) | C++17 | 3 ms | 7508 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;
typedef long long ll;
const int N = 3e5 + 100;
const int INF = 1e7 + 10;
long long n,m,q,dsz,E;
int timer = 1;
vector<int>adj[N + 1];
int fa[N + 1];
int deg[N + 1],deg1[N + 1],deg3[N + 1];
int up[23][N + 1],dp[N + 1],val[N + 1];
int lf[N + 1],ri[N + 1];
int in[N + 1],to[N + 1];
struct edge{
int w,u,v;
} edges[N + 1];
int find(int u){
if(u == fa[u]) return u;
return fa[u] = find(fa[u]);
}
void dfs_calc(int u,int p){
to[timer] = u;
in[u] = timer++;
// if(u == 6) cout<<val[p]<<endl;
if(!val[u]) val[u] = val[p];
for(int i = 1; i < 23 ; i++){
up[i][u] = up[i - 1][up[i - 1][u]];
}
for(int i = 0; i < adj[u].size(); i++){
int v = adj[u][i];
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |