oj.uz

Submission #496469

# Submission time Handle Problem Language Result Execution time Memory
496469 2021-12-21T09:45:23 Z mansur Valley (BOI19_valley) C++14
100 / 100
 199 ms 72176 KB 
#include<bits/stdc++.h>	
 
#pragma optimize ("g",on)
#pragma GCC optimize ("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
#pragma comment(linker, "/stack:200000000")
 
//01001101 01100001 01101011 01101000 01100001  01100111 01100001 01111001 
 
using namespace std;
 
#define all(a) a.begin(), a.end()                                                   
#define rall(a) a.rbegin(), a.rend()
#define ll long long
#define pb push_back
#define sz(a) a.size()
#define nl '\n'
#define popb pop_back()                                                                   
#define ld double
#define ull unsigned long long
#define ff first                                         
#define ss second  
#define fix fixed << setprecision
#define pii pair<int, int>                          
#define E exit (0)
#define int long long
 
const int inf = 1e15, N = 1e6 + 1, mod = 998244353;                    
 
vector<pii> dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
 
vector<pii> adj[N];
 
int tin[N], tout[N], timer;

pii up[N][20];       

int dist[N], iss[N], dp[N];
 
void dfs(int u, int p) {
	tin[u] = timer++;
	dp[u] = inf;
	if (iss[u]) dp[u] = 0;
	for (auto e: adj[u]) {
		if (e.ff != p) {
			dist[e.ff] = dist[u] + e.ss;
			dfs(e.ff, u);
			dp[u] = min(dp[u], dp[e.ff] + e.ss);
		}
	}
	tout[u] = timer++;	
}

void calc(int u, int p) {
	up[u][0] = {p, min(dp[u] - dist[u], dp[p] - dist[p])};
	for (int i = 1; i < 18; i++) {
		up[u][i] = {up[up[u][i - 1].ff][i - 1].ff, min(up[u][i - 1].ss, up[up[u][i - 1].ff][i - 1].ss)};
	}
	for (auto e: adj[u]) {
		if (e.ff != p) {
			calc(e.ff, u);
		}
	}
}
 
bool is(int a, int b) {
	return tin[a] <= tin[b] && tout[a] >= tout[b];
}

int get(int a, int b) {
	if (a == b) return dp[a] - dist[a];
	int ans = inf;
	for (int i = 17; i >= 0; i--) {
    	pii x = up[a][i];
    	if (is(x.ff, b)) continue;
    	ans = min(ans, x.ss); 
    	a = x.ff;
    }
    return min(ans, up[a][0].ss);
}
 
main() {                                                         
	//freopen("cowrect.in", "r", stdin);                                                                                     
	//freopen("cowrect.out", "w", stdout);                                                                                     
	ios_base::sync_with_stdio(NULL);                                                                                        
	cin.tie(NULL);
	int n, st, q, e;
	cin >> n >> st >> q >> e;
	int u[n], v[n], w[n];
	for (int i = 1; i < n; i++) {
		cin >> u[i] >> v[i] >> w[i];
		adj[u[i]].pb({v[i], w[i]});
		adj[v[i]].pb({u[i], w[i]});
	}                 
	for (int i = 1, c; i <= st; i++) {
		cin >> c;
		iss[c] = 1;
	}
	dfs(e, e);
	calc(e, e);    
	while (q--) {
		int i, x;
		cin >> i >> x;
		if (is(v[i], u[i])) swap(u[i], v[i]);
		if (is(v[i], x)) {
			if (dp[v[i]] == inf) {
				cout << "oo" << nl;
				continue;
			}
			cout << min(dp[x], get(x, v[i]) + dist[x]) << nl;
		}else {
			cout << "escaped" << nl;
		}
	}
}

Compilation message

valley.cpp:3: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    3 | #pragma optimize ("g",on)
      | 
valley.cpp:9: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    9 | #pragma comment(linker, "/stack:200000000")
      | 
valley.cpp:85:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   85 | main() {
      | ^~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23884 KB Output is correct
2 Correct 14 ms 23884 KB Output is correct
3 Correct 13 ms 23884 KB Output is correct
4 Correct 17 ms 23964 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23884 KB Output is correct
2 Correct 14 ms 23884 KB Output is correct
3 Correct 13 ms 23884 KB Output is correct
4 Correct 17 ms 23964 KB Output is correct
5 Correct 13 ms 24276 KB Output is correct
6 Correct 12 ms 24224 KB Output is correct
7 Correct 12 ms 24268 KB Output is correct
8 Correct 12 ms 24268 KB Output is correct
9 Correct 12 ms 24268 KB Output is correct
10 Correct 12 ms 24268 KB Output is correct
11 Correct 12 ms 24268 KB Output is correct
12 Correct 13 ms 24236 KB Output is correct
13 Correct 12 ms 24268 KB Output is correct
14 Correct 12 ms 24244 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 131 ms 67172 KB Output is correct
2 Correct 150 ms 66928 KB Output is correct
3 Correct 158 ms 67188 KB Output is correct
4 Correct 186 ms 69136 KB Output is correct
5 Correct 162 ms 69344 KB Output is correct
6 Correct 199 ms 71364 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23884 KB Output is correct
2 Correct 14 ms 23884 KB Output is correct
3 Correct 13 ms 23884 KB Output is correct
4 Correct 17 ms 23964 KB Output is correct
5 Correct 13 ms 24276 KB Output is correct
6 Correct 12 ms 24224 KB Output is correct
7 Correct 12 ms 24268 KB Output is correct
8 Correct 12 ms 24268 KB Output is correct
9 Correct 12 ms 24268 KB Output is correct
10 Correct 12 ms 24268 KB Output is correct
11 Correct 12 ms 24268 KB Output is correct
12 Correct 13 ms 24236 KB Output is correct
13 Correct 12 ms 24268 KB Output is correct
14 Correct 12 ms 24244 KB Output is correct
15 Correct 131 ms 67172 KB Output is correct
16 Correct 150 ms 66928 KB Output is correct
17 Correct 158 ms 67188 KB Output is correct
18 Correct 186 ms 69136 KB Output is correct
19 Correct 162 ms 69344 KB Output is correct
20 Correct 199 ms 71364 KB Output is correct
21 Correct 121 ms 66488 KB Output is correct
22 Correct 137 ms 66372 KB Output is correct
23 Correct 154 ms 66464 KB Output is correct
24 Correct 143 ms 68548 KB Output is correct
25 Correct 170 ms 71620 KB Output is correct
26 Correct 126 ms 66896 KB Output is correct
27 Correct 135 ms 66624 KB Output is correct
28 Correct 135 ms 66720 KB Output is correct
29 Correct 162 ms 68268 KB Output is correct
30 Correct 182 ms 69916 KB Output is correct
31 Correct 130 ms 67164 KB Output is correct
32 Correct 135 ms 67036 KB Output is correct
33 Correct 157 ms 67396 KB Output is correct
34 Correct 178 ms 69316 KB Output is correct
35 Correct 182 ms 72176 KB Output is correct
36 Correct 160 ms 69672 KB Output is correct