oj.uz

Submission #788026

# Submission time Handle Problem Language Result Execution time Memory
788026 2023-07-19T16:36:28 Z ToniB Swapping Cities (APIO20_swap) C++17
0 / 100
 2000 ms 41272 KB 
#include <bits/stdc++.h>
#include "swap.h"
#define X first
#define Y second
using namespace std;
typedef pair<int, int> pii;
const int MAXN = 1e5 + 2;
const int LOG = 18;

int n, m, cycle[MAXN], uf[MAXN], sz[MAXN];
int dep[MAXN], bl[MAXN][LOG], bl_w[MAXN][LOG];
bool uf_bio[MAXN];
vector<int> nodes[MAXN];
vector<pair<int, int> > adj[MAXN], tree[MAXN];
vector<pair<int, pii> > edges;

int f(int x){
	while(uf[x] != -1) x = uf[x];
	return x;
}
void join(int u, int v, int edge){
	if(uf_bio[u] ^ uf_bio[v]){
		if(uf_bio[v]) swap(u, v);
		for(int x : nodes[v]) cycle[x] = edge;
		uf_bio[v] = 1;
	}
	if(sz[u] > sz[v]) swap(u, v);
	sz[v] += sz[u];
	uf[u] = v;
	for(int x : nodes[u]) nodes[v].push_back(x);
}
int lift(int node, int step){
	for(int i = 0; i < LOG; ++i){
		if(step & 1 << i) node = bl[node][i];
	}
	return node;
}
int calc(int u, int v){
	if(dep[u] < dep[v]) swap(u, v);
	int ret = 0, lift = u;
	for(int i = 0; i < LOG; ++i){
		if(dep[u] - dep[v] & 1 << i){
			ret = max(ret, bl_w[lift][i]);
			lift = bl[lift][i];
		}
	}
	u = lift;

	if(u == v) return ret;

	for(int i = LOG - 1; i >= 0; --i){
		if(bl[u][i] != bl[v][i]){
			ret = max(ret, bl_w[u][i]);
			ret = max(ret, bl_w[v][i]);
			u = bl[u][i];
			v = bl[v][i];
		}
	}
	ret = max(ret, bl_w[u][0]);
	ret = max(ret, bl_w[v][0]);
	return ret;
}

void dfs(int node, int anc, int edge = 0){
	bl[node][0] = anc;
	bl_w[node][0] = edge;
	dep[node] = dep[anc] + 1;
	for(pii x : tree[node]){
		if(x.X == anc) continue;
		dfs(x.X, node, x.Y);
	}
}

void init(int _n, int _m, vector<int> u, vector<int> v, vector<int> w){
	n = _n; m = _m;
	for(int i = 0; i < n; ++i){
		uf[i] = -1; sz[i] = 1;
		nodes[i] = {i};
	}
	
	for(int i = 0; i < m; ++i){
		adj[u[i]].push_back({v[i], w[i]});
		adj[v[i]].push_back({u[i], w[i]});
		edges.push_back({w[i], {u[i], v[i]}});
	}

	sort(edges.begin(), edges.end());

	for(auto p : edges){
		int u = p.Y.X, v = p.Y.Y;
		u = f(u); v = f(v);
		if(u == v){
			if(!uf_bio[u]){
				uf_bio[u] = 1;
				for(int x : nodes[u]){
					cycle[x] = p.X;
				}
			}
		} else {
			join(u, v, p.X);
			tree[p.Y.X].push_back({p.Y.Y, p.X});
			tree[p.Y.Y].push_back({p.Y.X, p.X});
		}
	}

	dfs(0, 0);

	for(int j = 1; j < n; ++j){
		for(int i = 0; i < n; ++i){
			assert(bl[i][j - 1] >= 0);
			assert(bl[i][j - 1] < n);
			bl[i][j] = bl[bl[i][j - 1]][j - 1];
			bl_w[i][j] = max(bl_w[i][j - 1], bl_w[bl[i][j - 1]][j - 1]);
		}
	}
}
int getMinimumFuelCapacity(int x, int y){
	if(m + 1 == n) return -1;
	int val = calc(x, y);
	return max(val, min(cycle[x], cycle[y]));
}

Compilation message

swap.cpp: In function 'int calc(int, int)':
swap.cpp:42:13: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   42 |   if(dep[u] - dep[v] & 1 << i){
      |      ~~~~~~~^~~~~~~~

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7352 KB Output is correct
2 Correct 3 ms 7352 KB Output is correct
3 Correct 6 ms 7344 KB Output is correct
4 Correct 4 ms 7508 KB Output is correct
5 Correct 6 ms 7636 KB Output is correct
6 Correct 7 ms 7624 KB Output is correct
7 Correct 6 ms 7640 KB Output is correct
8 Correct 7 ms 7636 KB Output is correct
9 Execution timed out 2073 ms 36692 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7352 KB Output is correct
2 Correct 3 ms 7352 KB Output is correct
3 Execution timed out 2059 ms 41272 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7352 KB Output is correct
2 Correct 3 ms 7352 KB Output is correct
3 Correct 6 ms 7344 KB Output is correct
4 Correct 4 ms 7508 KB Output is correct
5 Correct 6 ms 7636 KB Output is correct
6 Correct 7 ms 7624 KB Output is correct
7 Correct 6 ms 7640 KB Output is correct
8 Correct 7 ms 7636 KB Output is correct
9 Correct 4 ms 7380 KB Output is correct
10 Incorrect 7 ms 7628 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 4 ms 7352 KB Output is correct
3 Correct 3 ms 7352 KB Output is correct
4 Correct 6 ms 7344 KB Output is correct
5 Correct 4 ms 7508 KB Output is correct
6 Correct 6 ms 7636 KB Output is correct
7 Correct 7 ms 7624 KB Output is correct
8 Correct 6 ms 7640 KB Output is correct
9 Correct 7 ms 7636 KB Output is correct
10 Execution timed out 2073 ms 36692 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7352 KB Output is correct
2 Correct 3 ms 7352 KB Output is correct
3 Correct 6 ms 7344 KB Output is correct
4 Correct 4 ms 7508 KB Output is correct
5 Correct 6 ms 7636 KB Output is correct
6 Correct 7 ms 7624 KB Output is correct
7 Correct 6 ms 7640 KB Output is correct
8 Correct 7 ms 7636 KB Output is correct
9 Execution timed out 2073 ms 36692 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 4 ms 7352 KB Output is correct
3 Correct 3 ms 7352 KB Output is correct
4 Correct 6 ms 7344 KB Output is correct
5 Correct 4 ms 7508 KB Output is correct
6 Correct 6 ms 7636 KB Output is correct
7 Correct 7 ms 7624 KB Output is correct
8 Correct 6 ms 7640 KB Output is correct
9 Correct 7 ms 7636 KB Output is correct
10 Execution timed out 2073 ms 36692 KB Time limit exceeded
11 Halted 0 ms 0 KB -