oj.uz

Submission #405731

# Submission time Handle Problem Language Result Execution time Memory
405731 2021-05-16T20:56:08 Z knightron0 Factories (JOI14_factories) C++17
15 / 100
 8000 ms 143020 KB 
#include "factories.h"
#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define fr first
#define sc second
#define clr(a, x) memset(a, x, sizeof(a))
#define dbg(x) cout<<"("<<#x<<"): "<<x<<endl;
#define printvector(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout<<*it<<" "; cout<<endl;
#define all(v) v.begin(), v.end()
#define lcm(a, b) (a * b)/__gcd(a, b)
#define printvecpairs(vec) for(auto it: vec) cout<<it.fr<<' '<<it.sc<<endl;
#define endl '\n'
#define ll long long int
#define float long double

const int MOD = 1e9 + 7;
const ll INF = 2e15;
const int MAXN = 5e5 + 5;
const int LOGN = 23;

vector<array<ll, 2>> adj[MAXN];
ll par[MAXN], sz[MAXN], depth[MAXN], dist[LOGN][MAXN], ans[MAXN], nm;
bool rm[MAXN];

int dfs(int u, int p){
	sz[u] = 1;
	for(auto &[v, w]: adj[u]){
		if(v != p && !rm[v]){
			sz[u] += dfs(v, u);
		}
	}
	return sz[u];
}

void dfs2(int u, int p, int l){
	for(auto &[v, w]: adj[u]){
		if(v != p && !rm[v]){
			dist[l][v] = dist[l][u] + w;
			dfs2(v, u, l);
		}
	}
}

int centroid(int u, int p, int n){
	for(auto &[v, w]: adj[u]){
		if(v != p && !rm[v]){
			if(sz[v]*2 > n){
				return centroid(v, u, n);
			}
		}
	}
	return u;
}

void decompose(int u, int p, int d){
	int n = dfs(u, p);
	int c = centroid(u, p, n);
	par[c] = p;
	depth[c] = d;
	dist[d][c] = 0;
	dfs2(c, -1, d);
	rm[c] = 1;
	for(auto &[v, w]: adj[c]){
		if(!rm[v]){
			decompose(v, c, d+1);
		}		
	}
}

void update(int v, int s){
	ans[v] = min(ans[v], dist[depth[v]][s]);
	if(depth[v] != 0){
		update(par[v], s);
	}
}

ll qry(int v, int s){
	if(depth[v] != 0){
		return min(ans[v]+dist[depth[v]][s], qry(par[v], s));
	} else {
		return ans[v] + dist[depth[v]][s];
	}
}

void Init(int N, int A[], int B[], int D[]) {
	nm = N;
	for(int i=0;i<=N;i++){
		rm[i] = false;
		sz[i] = 1;
	}
	for(int i= 0;i<nm-1;i++){
		A[i]++; B[i]++;
		adj[A[i]].pb({B[i], D[i]});
		adj[B[i]].pb({A[i], D[i]});
	}
	decompose(1, 0, 0);
	for(int i=0;i<=nm;i++) ans[i]= INF;
}

ll Query(int S, int X[], int T, int Y[]){
	for(int i=0;i<S;i++){
		X[i]++;
		update(X[i], X[i]);
	}
	ll res = INF;
	for(int i = 0;i<T;i++){
		Y[i]++;
		res = min(res, qry(Y[i], Y[i]));
	}
	for(int i=0;i<=nm;i++) ans[i]= INF;
	return res;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 12492 KB Output is correct
2 Correct 356 ms 30396 KB Output is correct
3 Correct 404 ms 30660 KB Output is correct
4 Correct 399 ms 30608 KB Output is correct
5 Correct 428 ms 30916 KB Output is correct
6 Correct 280 ms 30148 KB Output is correct
7 Correct 397 ms 30620 KB Output is correct
8 Correct 460 ms 30536 KB Output is correct
9 Correct 428 ms 30876 KB Output is correct
10 Correct 269 ms 30068 KB Output is correct
11 Correct 391 ms 30580 KB Output is correct

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 12236 KB Output is correct
2 Execution timed out 8066 ms 143020 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 12492 KB Output is correct
2 Correct 356 ms 30396 KB Output is correct
3 Correct 404 ms 30660 KB Output is correct
4 Correct 399 ms 30608 KB Output is correct
5 Correct 428 ms 30916 KB Output is correct
6 Correct 280 ms 30148 KB Output is correct
7 Correct 397 ms 30620 KB Output is correct
8 Correct 460 ms 30536 KB Output is correct
9 Correct 428 ms 30876 KB Output is correct
10 Correct 269 ms 30068 KB Output is correct
11 Correct 391 ms 30580 KB Output is correct
12 Correct 9 ms 12236 KB Output is correct
13 Execution timed out 8066 ms 143020 KB Time limit exceeded
14 Halted 0 ms 0 KB -