oj.uz

답안 #363688

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
363688 2021-02-06T20:48:52 Z shivensinha4 공장들 (JOI14_factories) C++17
100 / 100
 7188 ms 345884 KB 
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include "bits/stdc++.h"
using namespace std;
#define for_(i, s, e) for (int i = s; i < e; i++)
#define for__(i, s, e) for (ll i = s; i < e; i++)
#define SSTR(x) static_cast<std::ostringstream&>((std::ostringstream() << std::dec << x)).str()
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
#define endl '\n'
#ifndef mlocal
#include "factories.h"
#endif

class SparseTable {
	vector<vector<array<int, 2>>> st;
	int n;
	
	void buildTable(vector<array<int, 2>> &raw) {
		int k = __lg(n)+1;
		st.resize(n, vector<array<int, 2>> (k));
		for_(i, 0, n) st[i][0] = raw[i];
		for_(p, 1, k+1) for_(i, 0, n - (1<<p) + 1)
				st[i][p] = min(st[i][p-1], st[i + (1 << (p-1))][p-1]);
	}

public:
	void build(vector<array<int, 2>> &nums) {
		n = nums.size();
		buildTable(nums);
	}
	
	int mn(int l, int r) {
		int p = __lg(r-l+1);
		return min(st[l][p], st[r - (1<<p) + 1][p])[1];
	}
};


int n;
vector<vector<array<ll, 2>>> adjList;
vi removed, subtreeSize, centroid, tin, depth;
vector<ll> rootDist, whiteDist;
vector<array<int, 2>> tour;
SparseTable st;
const ll INF = 1e15;

int dfs(int p, int parent) {
	int s = 1;
	tin[p] = tour.size();
	tour.push_back({depth[p], p});
	
	for (auto &i: adjList[p]) if (i[0] != parent) {
			rootDist[i[0]] = rootDist[p]+i[1];
			depth[i[0]] = depth[p]+1;
			s += dfs(i[0], p);
			tour.push_back({depth[p], p});
		}
	
	subtreeSize[p] = s;
	return s;
}

int lca(int u, int v) {
	return st.mn(min(tin[u], tin[v]), max(tin[u], tin[v]));
}

ll dist(int u, int v) {
	int lc = lca(u, v);
	return rootDist[u] + rootDist[v] - 2*rootDist[lc];
}

void decompose(int p, int c) {
	int invalidChild = -1, sizeLimit = (subtreeSize[p] >> 1);
	for (auto &i: adjList[p]) if (!removed[i[0]] and subtreeSize[i[0]] > sizeLimit) {
			invalidChild = i[0];
			break;
		}
	
	if (invalidChild != -1) {
		subtreeSize[p] -= subtreeSize[invalidChild];
		subtreeSize[invalidChild] += subtreeSize[p];
		return decompose(invalidChild, c);
	}
	
	removed[p] = true;
	centroid[p] = c;
	for (auto &i: adjList[p]) if (!removed[i[0]]) {
		centroid[i[0]] = p;
		decompose(i[0], p);
	}
}

vi updated;
int pt = 0;

void update(int p) {
	int v = p;
	ll d;
	while (v != -1) {
		d = dist(p, v);
		whiteDist[v] = min(whiteDist[v], d);
		updated[pt++] = v;
		v = centroid[v];
	}
}

ll ans(int p) {
	ll val = INF;
	int v = p;
	while (v != -1) {
		val = min(val, whiteDist[v] + dist(p, v));
		v = centroid[v];
	}
	return (val == 1e9 ? -1 : val);
}

void Init(int N, int A[], int B[], int D[]) {
	n = N;
	adjList.resize(n); subtreeSize.resize(n); removed.resize(n); centroid.resize(n, -1); depth.resize(n); tin.resize(n); rootDist.resize(n); whiteDist.resize(n, INF); updated.resize(10*n);
	for_(i, 0, n-1) {
		int a = A[i], b = B[i]; ll w = D[i];
		adjList[a].push_back({b, w});
		adjList[b].push_back({a, w});
	}
	
	dfs(0, 0);
	decompose(0, -1);
	st.build(tour);
}

ll Query(int S, int X[], int T, int Y[]) {
	pt = 0;
	
	for_(i, 0, S) update(X[i]);
	ll val = INF;
	for_(i, 0, T) val = min(val, ans(Y[i]));
	for_(i, 0, pt) whiteDist[updated[i]] = INF;
	
	return val;
}

#ifdef mlocal
int main() {
	freopen("test.in", "r", stdin);

	ios_base::sync_with_stdio(false);
	cin.tie(0);

	int N, q;
	cin >> N >> q;
	int A[100], B[100], D[100];
	for_(i, 0, N - 1) {
		int a, b, w;
		cin >> a >> b >> w;
		A[i] = a;
		B[i] = b;
		D[i] = w;
	}

	Init(N, A, B, D);

	int X[100], Y[100];
	while (q--) {
		int S, T;
		cin >> S >> T;
		for_(i, 0, S) cin >> X[i];
		for_(i, 0, T) cin >> Y[i];
		cout << Query(S, X, T, Y) << endl;
	}

	return 0;
}
#endif

Compilation message

factories.cpp:3: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    3 | #pragma GCC optimization ("O3")
      | 
factories.cpp:4: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    4 | #pragma GCC optimization ("unroll-loops")
      |

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 876 KB Output is correct
2 Correct 630 ms 10728 KB Output is correct
3 Correct 821 ms 10860 KB Output is correct
4 Correct 792 ms 10988 KB Output is correct
5 Correct 830 ms 11596 KB Output is correct
6 Correct 344 ms 10732 KB Output is correct
7 Correct 852 ms 10896 KB Output is correct
8 Correct 815 ms 10860 KB Output is correct
9 Correct 817 ms 11372 KB Output is correct
10 Correct 345 ms 10764 KB Output is correct
11 Correct 787 ms 10912 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 620 KB Output is correct
2 Correct 3453 ms 291272 KB Output is correct
3 Correct 3735 ms 298112 KB Output is correct
4 Correct 1618 ms 288956 KB Output is correct
5 Correct 4869 ms 345884 KB Output is correct
6 Correct 4070 ms 299004 KB Output is correct
7 Correct 3168 ms 64908 KB Output is correct
8 Correct 999 ms 63964 KB Output is correct
9 Correct 3475 ms 71412 KB Output is correct
10 Correct 3238 ms 66192 KB Output is correct

Subtask #3
67.0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 876 KB Output is correct
2 Correct 630 ms 10728 KB Output is correct
3 Correct 821 ms 10860 KB Output is correct
4 Correct 792 ms 10988 KB Output is correct
5 Correct 830 ms 11596 KB Output is correct
6 Correct 344 ms 10732 KB Output is correct
7 Correct 852 ms 10896 KB Output is correct
8 Correct 815 ms 10860 KB Output is correct
9 Correct 817 ms 11372 KB Output is correct
10 Correct 345 ms 10764 KB Output is correct
11 Correct 787 ms 10912 KB Output is correct
12 Correct 4 ms 620 KB Output is correct
13 Correct 3453 ms 291272 KB Output is correct
14 Correct 3735 ms 298112 KB Output is correct
15 Correct 1618 ms 288956 KB Output is correct
16 Correct 4869 ms 345884 KB Output is correct
17 Correct 4070 ms 299004 KB Output is correct
18 Correct 3168 ms 64908 KB Output is correct
19 Correct 999 ms 63964 KB Output is correct
20 Correct 3475 ms 71412 KB Output is correct
21 Correct 3238 ms 66192 KB Output is correct
22 Correct 4990 ms 292868 KB Output is correct
23 Correct 5077 ms 295388 KB Output is correct
24 Correct 6056 ms 298992 KB Output is correct
25 Correct 6157 ms 302932 KB Output is correct
26 Correct 6158 ms 299580 KB Output is correct
27 Correct 7188 ms 338452 KB Output is correct
28 Correct 2082 ms 293008 KB Output is correct
29 Correct 6035 ms 298816 KB Output is correct
30 Correct 6072 ms 297712 KB Output is correct
31 Correct 6034 ms 299432 KB Output is correct
32 Correct 3245 ms 72696 KB Output is correct
33 Correct 993 ms 64476 KB Output is correct
34 Correct 2581 ms 62108 KB Output is correct
35 Correct 2682 ms 62176 KB Output is correct
36 Correct 3034 ms 63440 KB Output is correct
37 Correct 3041 ms 63708 KB Output is correct