oj.uz

Submission #26547

# Submission time Handle Problem Language Result Execution time Memory
26547 2017-07-02T17:53:22 Z rubabredwan Factories (JOI14_factories) C++14
15 / 100
 6000 ms 238504 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 <pii> g[N];
int n;
int tot;
int sub[N];
int anc[N];
int vis[N];
int lst[N], t;
long long mn[N];
vector <long long> pre[N];
stack <int> rem;
 
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].push_back(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(auto u : pre[from]){
		mn[cur] = min(mn[cur], u);
		if(lst[cur] != t) lst[cur] = t, rem.push(cur);
		cur = anc[cur];
	}
}
 
long long query(int from){
	int cur = from;
	long long ret = oo;
	for(auto u : pre[from]){
		ret = min(ret, mn[cur] + u);
		cur = anc[cur];
	}
	return ret;
}
 
void reset(){
	while(!rem.empty()){
		mn[rem.top()] = oo;
		rem.pop();
	}
	++t;
}
 
long long Query(int S, int X[], int T, int Y[]){
	reset();
	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;
	for(int i = 1; i <= n; ++i){
		reverse(pre[i].begin(), pre[i].end());
	}
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 59580 KB Output is correct
2 Correct 449 ms 60108 KB Output is correct
3 Correct 423 ms 60372 KB Output is correct
4 Correct 393 ms 60372 KB Output is correct
5 Correct 449 ms 60524 KB Output is correct
6 Correct 296 ms 59868 KB Output is correct
7 Correct 386 ms 60372 KB Output is correct
8 Correct 383 ms 60372 KB Output is correct
9 Correct 416 ms 60524 KB Output is correct
10 Correct 383 ms 59868 KB Output is correct
11 Correct 486 ms 60372 KB Output is correct

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 59580 KB Output is correct
2 Correct 3436 ms 151452 KB Output is correct
3 Correct 4759 ms 189816 KB Output is correct
4 Correct 1286 ms 98952 KB Output is correct
5 Execution timed out 6000 ms 238504 KB Execution timed out
6 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 3553 ms 150964 KB Output is correct
2 Correct 3989 ms 152236 KB Output is correct
3 Correct 5936 ms 189100 KB Output is correct
4 Execution timed out 6000 ms 189952 KB Execution timed out
5 Halted 0 ms 0 KB -