oj.uz

Submission #26549

# Submission time Handle Problem Language Result Execution time Memory
26549 2017-07-02T18:02:33 Z rubabredwan Factories (JOI14_factories) C++14
33 / 100
 6000 ms 200060 KB 
/*  Bismillahir Rahmanir Rahim  */
 
#include <bits/stdc++.h>
#include "factories.h"
 
using namespace std;
 
typedef pair <int, long long> pii;
 
const int N = 500005;
const long long oo = 1e18;
 
vector < vector <pii>> g(N);
int n;
int tot;
int sub[N];
int anc[N];
int vis[N];
int lst[N], t;
long long mn[N];
long long pre[N][25];
int idx[N];
 
void dfs0(int at, int par){
	++tot;
	sub[at] = 1;
	for(auto u : g[at]){
		if(vis[u.first] || u.first == par) continue;
		dfs0(u.first, at);
		sub[at] += sub[u.first];
	}
}
 
int get(int at, int par){
	for(auto u : g[at]){
		if(vis[u.first] || u.first == par) continue;
		if(sub[u.first] >= tot / 2) return get(u.first, at);
	}
	return at;
}
 
void get_dis(int at, int par, long long dis){
	pre[at][++idx[at]] = dis;
	for(auto u : g[at]){
		if(vis[u.first] || u.first == par) continue;
		get_dis(u.first, at, dis + u.second);
	}
}
 
void decompose(int at, int par){
	tot = 0;
	dfs0(at, at);
	int cen = get(at, at);
	vis[cen] = 1;
	if(par) anc[cen] = par;
	get_dis(cen, cen, 0);
	for(auto u : g[cen]){
		if(vis[u.first]) continue;
		decompose(u.first, cen);
	}
}
 
void update(int from){
	int cur = from;
	for(int i = idx[from]; i >= 1; --i){
		if(lst[cur] == t) mn[cur] = min(mn[cur], pre[from][i]);
		else lst[cur] = t, mn[cur] = pre[from][i];
		cur = anc[cur];
	}
}
 
long long query(int from){
	int cur = from;
	long long ret = oo;
	for(int i = idx[from]; i >= 1; --i){
		if(lst[cur] == t) ret = min(ret, mn[cur] + pre[from][i]);
		cur = anc[cur];
	}
	return ret;
}
 
long long Query(int S, int X[], int T, int Y[]){
	++t;
	for(int i = 0; i < S; ++i){
		update(X[i] + 1);
	}	
	long long ret = oo;
	for(int i = 0; i < T; ++i){
		ret = min(ret, query(Y[i] + 1));
	}
	return ret;
}
 
void Init(int N, int A[], int B[], int D[]){
	n = N;
	for(int i = 0; i < N - 1; ++i){
		g[A[i] + 1].push_back({B[i] + 1, D[i]});
		g[B[i] + 1].push_back({A[i] + 1, D[i]});
	}
	decompose(1, 0);
	for(int i = 1; i <= n; ++i) mn[i] = oo;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 147336 KB Output is correct
2 Correct 389 ms 147600 KB Output is correct
3 Correct 386 ms 147600 KB Output is correct
4 Correct 376 ms 147600 KB Output is correct
5 Correct 439 ms 147756 KB Output is correct
6 Correct 299 ms 147624 KB Output is correct
7 Correct 336 ms 147600 KB Output is correct
8 Correct 389 ms 147600 KB Output is correct
9 Correct 409 ms 147756 KB Output is correct
10 Correct 353 ms 147624 KB Output is correct
11 Correct 473 ms 147600 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 147336 KB Output is correct
2 Correct 2759 ms 172944 KB Output is correct
3 Correct 5059 ms 177384 KB Output is correct
4 Correct 1026 ms 171132 KB Output is correct
5 Correct 5686 ms 200060 KB Output is correct
6 Correct 5263 ms 176952 KB Output is correct
7 Correct 1246 ms 153164 KB Output is correct
8 Correct 616 ms 152580 KB Output is correct
9 Correct 1346 ms 155740 KB Output is correct
10 Correct 1129 ms 153064 KB Output is correct

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 3779 ms 172944 KB Output is correct
2 Correct 3973 ms 172944 KB Output is correct
3 Execution timed out 6000 ms 176396 KB Execution timed out
4 Halted 0 ms 0 KB -