oj.uz

답안 #256134

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
256134 2020-08-02T10:13:36 Z islingr 공장들 (JOI14_factories) C++17
33 / 100
 8000 ms 132084 KB 
#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define per(i, a, b) for (auto i = (b); i-- > (a); )
#define sz(x...) int((x).size())
#define all(x) begin(x), end(x)
#define eb(x...) emplace_back(x)

template<class T> bool ckmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; }

using ll = int64_t;

const ll inf = 1e18;
const int B = 19, N = 1 << B;
int dep[N], p[N][B], in[N];
ll dist[N];

void Init(int n, int a[], int b[], int d[]) {
	vector<vector<int>> g(n);
	rep(e, 0, n - 1) g[a[e]].eb(e), g[b[e]].eb(e);
	int timer = 0;
	function<void(int)> dfs = [&](int u) {
		in[u] = timer++;
		for (int e : g[u]) {
			int v = u != a[e] ? a[e] : b[e];
			if (v == p[u][0]) continue;
			dist[v] = dist[u] + d[e];
			dep[v] = dep[u] + 1;
			p[v][0] = u;
			rep(j, 0, B - 1) p[v][j + 1] = p[p[v][j]][j];
			dfs(v);
		}
	};
	dfs(0);
}

int lca(int u, int v) {
	if (dep[u] < dep[v]) swap(u, v);
	per(j, 0, B) if (dep[v] <= dep[p[u][j]]) u = p[u][j];
	if (u == v) return u;
	per(j, 0, B) if (p[u][j] != p[v][j]) u = p[u][j], v = p[v][j];
	return p[u][0];
}

vector<int> g[N];
short col[N];
ll s[N], t[N];

ll Query(int S, int X[], int T, int Y[]) {
	vector<int> V; V.reserve(2 * (S + T));
	rep(i, 0, S) col[X[i]] = +1, V.eb(X[i]);
	rep(i, 0, T) col[Y[i]] = -1, V.eb(Y[i]);
	auto cmp = [&](int x, int y) { return in[x] < in[y]; };
	sort(all(V), cmp);
	rep(i, 1, S + T) V.eb(lca(V[i - 1], V[i]));
	sort(all(V), cmp);
	V.erase(unique(all(V)), end(V));
	rep(i, 1, sz(V)) g[lca(V[i - 1], V[i])].eb(V[i]);
	ll ans = inf;
	function<void(int)> dfs = [&](int u) {
		s[u] = t[u] = inf;
		if (col[u] > 0) s[u] = 0;
		if (col[u] < 0) t[u] = 0;
		for (int v : g[u]) {
			dfs(v);
			ckmin(s[u], dist[v] - dist[u] + s[v]);
			ckmin(t[u], dist[v] - dist[u] + t[v]);
		}
		ckmin(ans, s[u] + t[u]);
	};
	dfs(V[0]);
	for (int v : V) g[v].clear(), col[v] = 0;
	return ans;
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 44 ms 13304 KB Output is correct
2 Correct 1597 ms 31092 KB Output is correct
3 Correct 1766 ms 31124 KB Output is correct
4 Correct 1640 ms 30908 KB Output is correct
5 Correct 1363 ms 31336 KB Output is correct
6 Correct 1239 ms 31088 KB Output is correct
7 Correct 1754 ms 30948 KB Output is correct
8 Correct 1641 ms 31204 KB Output is correct
9 Correct 1361 ms 31292 KB Output is correct
10 Correct 1236 ms 30932 KB Output is correct
11 Correct 1777 ms 30948 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 12928 KB Output is correct
2 Correct 2488 ms 99064 KB Output is correct
3 Correct 4467 ms 102904 KB Output is correct
4 Correct 1547 ms 100712 KB Output is correct
5 Correct 3715 ms 132084 KB Output is correct
6 Correct 4666 ms 102600 KB Output is correct
7 Correct 4417 ms 51812 KB Output is correct
8 Correct 1707 ms 52188 KB Output is correct
9 Correct 3586 ms 56560 KB Output is correct
10 Correct 4083 ms 53228 KB Output is correct

Subtask #3
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 44 ms 13304 KB Output is correct
2 Correct 1597 ms 31092 KB Output is correct
3 Correct 1766 ms 31124 KB Output is correct
4 Correct 1640 ms 30908 KB Output is correct
5 Correct 1363 ms 31336 KB Output is correct
6 Correct 1239 ms 31088 KB Output is correct
7 Correct 1754 ms 30948 KB Output is correct
8 Correct 1641 ms 31204 KB Output is correct
9 Correct 1361 ms 31292 KB Output is correct
10 Correct 1236 ms 30932 KB Output is correct
11 Correct 1777 ms 30948 KB Output is correct
12 Correct 13 ms 12928 KB Output is correct
13 Correct 2488 ms 99064 KB Output is correct
14 Correct 4467 ms 102904 KB Output is correct
15 Correct 1547 ms 100712 KB Output is correct
16 Correct 3715 ms 132084 KB Output is correct
17 Correct 4666 ms 102600 KB Output is correct
18 Correct 4417 ms 51812 KB Output is correct
19 Correct 1707 ms 52188 KB Output is correct
20 Correct 3586 ms 56560 KB Output is correct
21 Correct 4083 ms 53228 KB Output is correct
22 Correct 4568 ms 102124 KB Output is correct
23 Correct 5234 ms 103032 KB Output is correct
24 Correct 7059 ms 105060 KB Output is correct
25 Correct 5707 ms 106624 KB Output is correct
26 Correct 7952 ms 105548 KB Output is correct
27 Correct 5409 ms 128784 KB Output is correct
28 Correct 2603 ms 104424 KB Output is correct
29 Execution timed out 8087 ms 105204 KB Time limit exceeded
30 Halted 0 ms 0 KB -