oj.uz

Submission #381680

# Submission time Handle Problem Language Result Execution time Memory
381680 2021-03-25T15:53:29 Z peijar Valley (BOI19_valley) C++17
100 / 100
 252 ms 47580 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;

const int MAXN = 1e5;
const int MAXP = 17;
const int INF = 1e18;

vector<pair<int, int>> adj[MAXN];
int profondeur[MAXN];
int profPoids[MAXN];
int meilleurMagasins[MAXN];
int meilleurParMagasins[MAXP][MAXN];
int par[MAXP][MAXN];
bool estMagasin[MAXN];
int nbVilles;
vector<pair<int, int>> aretes;

void dfs(int iNoeud, int iPere=-1)
{
	if (iPere == -1)
		par[0][iNoeud] = iNoeud;
	if (!estMagasin[iNoeud])
		meilleurMagasins[iNoeud] = INF;

	for (auto [iFrere, poids] : adj[iNoeud])
		if (iFrere != iPere)
		{
			par[0][iFrere] = iNoeud;
			profondeur[iFrere] = profondeur[iNoeud] + 1;
			profPoids[iFrere] = profPoids[iNoeud] + poids;
			dfs(iFrere, iNoeud);
			meilleurMagasins[iNoeud] = min(meilleurMagasins[iNoeud], poids + meilleurMagasins[iFrere]);
		}
}

void init()
{
	for (int p = 0; p < MAXP-1; ++p) 
		for (int iNoeud = 0; iNoeud < nbVilles; ++iNoeud) 
			par[p+1][iNoeud] = par[p][par[p][iNoeud]];
	for (int p = 0; p < MAXP; ++p) 
		for (int iNoeud = 0; iNoeud < nbVilles; ++iNoeud) 
		{
			if (p == 0)
				meilleurParMagasins[p][iNoeud] = min(INF, 
						meilleurMagasins[par[0][iNoeud]] + profPoids[iNoeud] - profPoids[par[0][iNoeud]]);
			else
				meilleurParMagasins[p][iNoeud] = min(meilleurParMagasins[p-1][iNoeud],
						meilleurParMagasins[p-1][par[p-1][iNoeud]] + profPoids[iNoeud] - profPoids[par[p-1][iNoeud]]);
		}
}

int monte(int iNoeud, int dis)
{
	for (int p(0); p < MAXP; ++p)
		if ((1<<p) & dis)
			iNoeud = par[p][iNoeud];
	return iNoeud;
}

bool estAncetre(int iNoeud, int iAncetre)
{
	int delta = profondeur[iNoeud] - profondeur[iAncetre];
	return delta >= 0 and monte(iNoeud, delta) == iAncetre;
}

signed main(void)
{
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	
	int nbMagasins, nbRequetes, racine;
	cin >> nbVilles >> nbMagasins >> nbRequetes >> racine;
	--racine;
	for (int i = 0; i < nbVilles-1; ++i) 
	{
		int u, v, w;
		cin >> u >> v >> w;
		--u, --v;
		aretes.emplace_back(u, v);
		adj[u].emplace_back(v, w);
		adj[v].emplace_back(u, w);
	}
	for (int iMagasin = 0; iMagasin < nbMagasins; ++iMagasin) 
	{
		int pos;
		cin >> pos;
		estMagasin[pos-1] = true;
	}

	dfs(racine);
	init();
	for (int iRequete = 0; iRequete < nbRequetes; ++iRequete) 
	{
		int iArete, iSommet;
		cin >> iArete >> iSommet;
		--iArete, --iSommet;
		auto [u, v] = aretes[iArete];
		if (profondeur[u] < profondeur[v]) swap(u, v);
		if (!estAncetre(iSommet, u))
			cout << "escaped";
		else
		{
			int diff = profondeur[iSommet] - profondeur[u];
			int ret = meilleurMagasins[iSommet];
			int coutCumul(0);
			//cout << iSommet << ' ' << ret << endl;
			for (int p(0); p < MAXP; ++p)
				if ((1<<p) & diff)
				{
					ret = min(ret, meilleurParMagasins[p][iSommet]+coutCumul);
					int nxt = par[p][iSommet];
					coutCumul += profPoids[iSommet] - profPoids[nxt];
					iSommet = nxt;
					//cout << iSommet << ' ' << ret << ' ' << coutCumul << endl;
				}
			if (ret == INF)
				cout << "oo";
			else
				cout << ret;
		}
		cout << '\n';
	}
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 3072 KB Output is correct
2 Correct 6 ms 3052 KB Output is correct
3 Correct 6 ms 3052 KB Output is correct
4 Correct 5 ms 3052 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 3072 KB Output is correct
2 Correct 6 ms 3052 KB Output is correct
3 Correct 6 ms 3052 KB Output is correct
4 Correct 5 ms 3052 KB Output is correct
5 Correct 3 ms 3308 KB Output is correct
6 Correct 3 ms 3308 KB Output is correct
7 Correct 4 ms 3308 KB Output is correct
8 Correct 3 ms 3308 KB Output is correct
9 Correct 4 ms 3308 KB Output is correct
10 Correct 5 ms 3308 KB Output is correct
11 Correct 4 ms 3308 KB Output is correct
12 Correct 4 ms 3308 KB Output is correct
13 Correct 4 ms 3308 KB Output is correct
14 Correct 4 ms 3308 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 144 ms 39132 KB Output is correct
2 Correct 165 ms 39004 KB Output is correct
3 Correct 171 ms 39260 KB Output is correct
4 Correct 207 ms 41180 KB Output is correct
5 Correct 228 ms 41180 KB Output is correct
6 Correct 252 ms 43356 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 3072 KB Output is correct
2 Correct 6 ms 3052 KB Output is correct
3 Correct 6 ms 3052 KB Output is correct
4 Correct 5 ms 3052 KB Output is correct
5 Correct 3 ms 3308 KB Output is correct
6 Correct 3 ms 3308 KB Output is correct
7 Correct 4 ms 3308 KB Output is correct
8 Correct 3 ms 3308 KB Output is correct
9 Correct 4 ms 3308 KB Output is correct
10 Correct 5 ms 3308 KB Output is correct
11 Correct 4 ms 3308 KB Output is correct
12 Correct 4 ms 3308 KB Output is correct
13 Correct 4 ms 3308 KB Output is correct
14 Correct 4 ms 3308 KB Output is correct
15 Correct 144 ms 39132 KB Output is correct
16 Correct 165 ms 39004 KB Output is correct
17 Correct 171 ms 39260 KB Output is correct
18 Correct 207 ms 41180 KB Output is correct
19 Correct 228 ms 41180 KB Output is correct
20 Correct 252 ms 43356 KB Output is correct
21 Correct 145 ms 42332 KB Output is correct
22 Correct 150 ms 42332 KB Output is correct
23 Correct 168 ms 42460 KB Output is correct
24 Correct 209 ms 44764 KB Output is correct
25 Correct 238 ms 47580 KB Output is correct
26 Correct 161 ms 42480 KB Output is correct
27 Correct 148 ms 42332 KB Output is correct
28 Correct 175 ms 42588 KB Output is correct
29 Correct 199 ms 43996 KB Output is correct
30 Correct 251 ms 45532 KB Output is correct
31 Correct 147 ms 42588 KB Output is correct
32 Correct 148 ms 42332 KB Output is correct
33 Correct 165 ms 42720 KB Output is correct
34 Correct 214 ms 44636 KB Output is correct
35 Correct 242 ms 47548 KB Output is correct
36 Correct 186 ms 44520 KB Output is correct