Submission #496259

#	Time	Username	Problem	Language	Result	Execution time	Memory
496259		mansur	Valley (BOI19_valley)	C++17	36 / 100	3053 ms	39092 KiB

valley

#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 = 1e18, 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;

void dfs(int u, int p) {
	tin[u] = timer++;
	for (auto e: adj[u]) {
		if (e.ff != p) {
			dfs(e.ff, u);
		}
	}
	tout[u] = timer++;	
}

bool is(int a, int b) {
	return tin[a] <= tin[b] && tout[a] >= tout[b];
}

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]});
	}                 
	dfs(e, e);
	int c[st + 1];
	for (int i = 1; i <= st; i++) cin >> c[i];
	while (q--) {
		int i, x;
		cin >> i >> x;
		if (is(v[i], u[i])) swap(u[i], v[i]);
		if (is(v[i], x)) {
			set<pii> s;
			vector<int> d(n + 1, inf);
			for (int j = 1; j <= st; j++) {
				if (is(v[i], c[j])) {
					s.insert({0, c[j]});
					d[c[j]] = 0;
				}
			}
			while (!s.empty()) {
				int y = (*s.begin()).ss;
				s.erase(s.begin());
				for (auto ee: adj[y]) {
                	if (d[ee.ff] > d[y] + ee.ss) {
                		s.erase({d[ee.ff], ee.ff});
                		d[ee.ff] = d[y] + ee.ss;
                		s.insert({d[ee.ff], ee.ff});
                	}
                }
			}
			if (d[x] == inf) cout << "oo" << nl;
			else cout << d[x] << nl;
		}else {
			cout << "escaped" << nl;
		}
	}
}

Compilation message (stderr)

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:53:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   53 | main() {
      | ^~~~

• Subtask 1: 9 / 9
• Subtask 2: 27 / 27
• Subtask 3: 0 / 23
• Subtask 4: 0 / 41