oj.uz

답안 #496470

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
496470 2021-12-21T09:47:13 Z Ziel Valley (BOI19_valley) C++17
100 / 100
 496 ms 54300 KB 
/**
 * LES GREATEABLES BRO TEAM
**/

#include <bits/stdc++.h>

using namespace std;

using ll = long long;
#define sz(x) (int)x.size()
const bool FLAG = false;
void setIO(const string &f = "");

string to_string(const string s) {
	return '"' + s + '"';
}
string to_string(const char c) {
 	return char(39) + string(1, c) + char(39);
}
string to_string(const char* s) {
 	return to_string(string(s));
}
string to_string(bool f) {
	return (f ? "true" : "false");
}
template<class A, class B>
string to_string(const pair<A, B> x) {
	return "(" + to_string(x.first) + ", " + to_string(x.second) + ")";
}
template<class A, class B, class C>
string to_string(const tuple<A, B, C> x) {
	return "(" + to_string(get<0>(x)) + ", " + to_string(get<1>(x)) + ", " + to_string(get<2>(x)) + ")";
}
template<class A, class B, class C, class D>
string to_string(const tuple<A, B, C, D> x) {
	return "(" + to_string(get<0>(x)) + ", " + to_string(get<1>(x)) + ", " + to_string(get<2>(x)) + ", " + to_string(get<3>(x)) + ")";
}
template<class T>
string to_string(const T v) {
	string res = "{"; bool f = true;
	for (auto x: v)
		res += (f ? to_string(x) : ", " + to_string(x)), f = false;
	return res + "}";
}
void debug_args() { cerr << "]\n"; }
template<class H, class... T>
void debug_args(H x, T... y) {
	cerr << to_string(x);
	if (sizeof... (y))
	cerr << ", ";
	debug_args(y...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: [", debug_args(__VA_ARGS__);
#else
#define debug(...) 47
#endif

#define int ll

const int N = 2e5 + 13, INF = 1e18 + 14;

int level[N], up[20][N], dist[N], dp[N], mn[20][N];
set<int> shop;
vector<vector<pair<int, int>>> g(N);

void dfs(int v, int pr, int d = 0) {
	up[0][v] = pr;
	level[v] = level[pr] + 1;
	dist[v] = dist[pr] + d;

	for (int i = 1; i <= 18; i++)
		up[i][v] = up[i - 1][up[i - 1][v]];
	dp[v] = INF + INF;
	if (shop.count(v))
		dp[v] = 0;
	for (auto [to, len]: g[v]) {
		if (to == pr)
			continue;
		dfs(to, v, len);
		dp[v] = min(dp[v], dp[to] + len);
	}
}
int lca(int x, int y) {
	if (level[x] > level[y])
		swap(x, y);
	for (int i = 18; i >= 0; i--) {
		if (level[up[i][y]] >= level[x])
			y = up[i][y];
	}
	if (x == y)
		return x;
	for (int i = 18; i >= 0; i--) {
		if (up[i][x] != up[i][y]) {
			x = up[i][x];
			y = up[i][y];
		}
	}
	return up[0][x];
}

void solve() {
    int n, s, q, e;
    cin >> n >> s >> q >> e;
    vector<pair<int, int>> edges(n);
    for (int i = 1; i < n; i++) {
    	int x, y, z;
    	cin >> x >> y >> z;
    	g[x].push_back({y, z});
    	g[y].push_back({x, z});
    	edges[i] = {x, y};
    }

    vector<int> c(s + 1);
    for (int i = 1; i <= s; i++) {
    	cin >> c[i];
    	shop.insert(c[i]);
    }
    dfs(e, 0);
    for (int j = 0; j <= 18; j++) {
    	for (int v = 1; v <= n; v++) {
    		if (!j)
    			mn[j][v] = dp[v] - dist[v];
    		else
    			mn[j][v] = min(mn[j - 1][v], mn[j - 1][up[j - 1][v]]);
    	}
    }
    
    while (q--) {
    	int edge, v;
    	cin >> edge >> v;
    	int x = edges[edge].first, y = edges[edge].second;

    	if (level[x] > level[y])
    		swap(x, y);
    	if (lca(y, v) == y) {
    		int res = INF;
    		int _v = v;
    		for (int i = 18; i >= 0; i--) {
    			if (level[up[i][v]] >= level[y]) {
    				res = min(res, mn[i][v]);
    				v = up[i][v];
    			}
    		}
    		res = min(res, dp[y] - dist[y]);
    		if (res >= INF)
    			cout << "oo\n";
    		else
	    		cout << dist[_v] + res << '\n';
    	} else {
    		cout << "escaped\n";
    	}
    }
}

signed main() {
    setIO();
    
    int tt = 1;
    if (FLAG) {
    	cin >> tt;
    }
    while (tt--) {
    	solve();
    }
    
    return 0;
}

void setIO(const string &f) {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    if (fopen((f + ".in").c_str(), "r")) {
        freopen((f + ".in").c_str(), "r", stdin);
        freopen((f + ".out").c_str(), "w", stdout);
    }
}

Compilation message

valley.cpp: In function 'void setIO(const string&)':
valley.cpp:175:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  175 |         freopen((f + ".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
valley.cpp:176:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  176 |         freopen((f + ".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5324 KB Output is correct
2 Correct 6 ms 5324 KB Output is correct
3 Correct 6 ms 5392 KB Output is correct
4 Correct 6 ms 5324 KB Output is correct

Subtask #2
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5324 KB Output is correct
2 Correct 6 ms 5324 KB Output is correct
3 Correct 6 ms 5392 KB Output is correct
4 Correct 6 ms 5324 KB Output is correct
5 Correct 4 ms 5688 KB Output is correct
6 Correct 4 ms 5580 KB Output is correct
7 Correct 4 ms 5708 KB Output is correct
8 Correct 4 ms 5708 KB Output is correct
9 Correct 5 ms 5708 KB Output is correct
10 Correct 4 ms 5708 KB Output is correct
11 Correct 4 ms 5708 KB Output is correct
12 Correct 4 ms 5708 KB Output is correct
13 Correct 5 ms 5708 KB Output is correct
14 Correct 4 ms 5708 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 411 ms 50176 KB Output is correct
2 Correct 471 ms 49916 KB Output is correct
3 Correct 496 ms 50116 KB Output is correct
4 Correct 490 ms 52044 KB Output is correct
5 Correct 465 ms 52236 KB Output is correct
6 Correct 460 ms 54300 KB Output is correct

Subtask #4
41.0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5324 KB Output is correct
2 Correct 6 ms 5324 KB Output is correct
3 Correct 6 ms 5392 KB Output is correct
4 Correct 6 ms 5324 KB Output is correct
5 Correct 4 ms 5688 KB Output is correct
6 Correct 4 ms 5580 KB Output is correct
7 Correct 4 ms 5708 KB Output is correct
8 Correct 4 ms 5708 KB Output is correct
9 Correct 5 ms 5708 KB Output is correct
10 Correct 4 ms 5708 KB Output is correct
11 Correct 4 ms 5708 KB Output is correct
12 Correct 4 ms 5708 KB Output is correct
13 Correct 5 ms 5708 KB Output is correct
14 Correct 4 ms 5708 KB Output is correct
15 Correct 411 ms 50176 KB Output is correct
16 Correct 471 ms 49916 KB Output is correct
17 Correct 496 ms 50116 KB Output is correct
18 Correct 490 ms 52044 KB Output is correct
19 Correct 465 ms 52236 KB Output is correct
20 Correct 460 ms 54300 KB Output is correct
21 Correct 360 ms 44672 KB Output is correct
22 Correct 376 ms 44644 KB Output is correct
23 Correct 371 ms 44708 KB Output is correct
24 Correct 469 ms 46920 KB Output is correct
25 Correct 448 ms 49812 KB Output is correct
26 Correct 397 ms 44768 KB Output is correct
27 Correct 363 ms 44600 KB Output is correct
28 Correct 385 ms 44992 KB Output is correct
29 Correct 393 ms 46276 KB Output is correct
30 Correct 435 ms 47892 KB Output is correct
31 Correct 412 ms 45240 KB Output is correct
32 Correct 394 ms 45096 KB Output is correct
33 Correct 383 ms 45648 KB Output is correct
34 Correct 382 ms 47288 KB Output is correct
35 Correct 432 ms 50228 KB Output is correct
36 Correct 475 ms 48388 KB Output is correct