library/WeightedLca.java

• View this file on GitHub
• Last update: 2023-03-25 01:33:47+09:00

Depends on

• library/AbstractGraph.java
• library/FastIO.java

Verified with

• library/WeightedLca_test.java

Code

package library;

import java.util.*;
import java.util.function.*;
import library.FastIO;
import library.AbstractGraph;

final class WeightedLca {
	private final long id;
	private final LongBinaryOperator f;
	private final int numNode;
	private WeightedDoubling db;
	public final int depth[];

	// O(VlogV)
	public WeightedLca(final AbstractGraph<? extends WeightedNode, WeightedEdge> g, final int root, final long id, final LongBinaryOperator f) {
		this(g.numNode, g.nodes(), root, id, f);
	}
	public WeightedLca(final int numNode, final WeightedNode[] nodes, final int root, final long id, final LongBinaryOperator f) {
		FastIO.nonNegativeCheck(numNode);
		FastIO.rangeCheck(root, numNode);
		this.numNode = numNode;
		this.id = id;
		this.f = f;
		depth = new int[numNode];
		db = new WeightedDoubling(numNode, numNode, id, f, bfs(root, nodes));
	}

	private final WeightedNode bfs(final int start, final WeightedNode[] nodes) { // O(V)
		WeightedListNode edges = new WeightedListNode(-1);
		int stack[] = new int[numNode];
		int ptr = 0;
		int size = 0;

		Arrays.fill(depth, -1);
		depth[start] = 0;
		stack[size ++] = 0;
		while(ptr != size) {
			int crt = stack[ptr ++];
			for(WeightedEdge e : nodes[crt]) {
				if(depth[e.target] == -1) {
					depth[e.target] = depth[crt] + 1;
					edges.add(e.reverse());
					stack[size ++] = e.target;
				}
			}
		}
		return edges;
	}

	public final WeightedEdge cal(int u, int v) { // O(logV)
		FastIO.rangeCheck(u, numNode);
		FastIO.rangeCheck(v, numNode);
		if(depth[u] > depth[v]) {
			int tmp = u;
			u = v;
			v = tmp;
		}
		long cost = id;
		for(int k = 0; k < db.log; k ++) {
			if((depth[v] - depth[u] & 1 << k) != 0) {
				cost = f.applyAsLong(cost, db.val[k][v]);
				v = db.next[k][v];
			}
		}
		for(int k = db.log - 1; k >= 0; k --) {
			if(u != v && db.next[k][u] != db.next[k][v]) {
				cost = f.applyAsLong(cost, db.val[k][u]);
				u = db.next[k][u];
				cost = f.applyAsLong(cost, db.val[k][v]);
				v = db.next[k][v];
			}
		}
		if(u != v) {
			cost = f.applyAsLong(cost, db.val[0][u]);
			u = db.next[0][u];
			cost = f.applyAsLong(cost, db.val[0][v]);
			v = db.next[0][v];
		}
		return new WeightedEdge(-1, u, cost);
	}
}

Traceback (most recent call last):
  File "/opt/hostedtoolcache/Python/3.11.2/x64/lib/python3.11/site-packages/onlinejudge_verify/documentation/build.py", line 71, in _render_source_code_stat
    bundled_code = language.bundle(stat.path, basedir=basedir, options={'include_paths': [basedir]}).decode()
                   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  File "/opt/hostedtoolcache/Python/3.11.2/x64/lib/python3.11/site-packages/onlinejudge_verify/languages/user_defined.py", line 71, in bundle
    return subprocess.check_output(shlex.split(command))
           ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  File "/opt/hostedtoolcache/Python/3.11.2/x64/lib/python3.11/subprocess.py", line 466, in check_output
    return run(*popenargs, stdout=PIPE, timeout=timeout, check=True,
           ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  File "/opt/hostedtoolcache/Python/3.11.2/x64/lib/python3.11/subprocess.py", line 571, in run
    raise CalledProcessError(retcode, process.args,
subprocess.CalledProcessError: Command '['false']' returned non-zero exit status 1.

Back to top page