| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 170313 |
2019-12-24T19:48:53 Z |
ngmh |
Valley (BOI19_valley) |
C++11 |
|
3000 ms |
13640 KB |
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
typedef long long ll;
typedef pair<ll, ll> pi;
ll n, s, q, e, a, b, w, z, r, c[100005];
vector<pi> adj[100005];
pi rs[100005];
ll dfs(ll x, ll p){
ll best = LLONG_MAX/3;
if(x == e) return -1;
for(auto it : adj[x]){
if(it.F == rs[z].F && x == rs[z].S) continue;
if(it.F == rs[z].S && x == rs[z].F) continue;
if(it.F != p){
ll cur = dfs(it.F, x);
if(cur == -1) return cur;
best = min(best, cur+it.S);
}
}
if(c[x]) return 0;
return best;
}
int main(){
cin >> n >> s >> q >> e;
for(ll i = 0; i < n-1; i++){
cin >> a >> b >> w;
adj[a].push_back(pi(b, w));
adj[b].push_back(pi(a, w));
rs[i] = pi(a, b);
}
for(ll i = 0; i < s; i++){ cin >> z; c[z] = 1; }
for(ll i = 0; i < q; i++){
cin >> z >> r; z--;
ll ans = dfs(r, -1);
if(ans == -1) cout << "escaped\n";
else if(ans >= LLONG_MAX/3) cout << "oo\n";
else cout << ans << "\n";
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
42 ms |
2808 KB |
Output is correct |
| 2 |
Correct |
42 ms |
2940 KB |
Output is correct |
| 3 |
Correct |
41 ms |
2808 KB |
Output is correct |
| 4 |
Correct |
42 ms |
2936 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
42 ms |
2808 KB |
Output is correct |
| 2 |
Correct |
42 ms |
2940 KB |
Output is correct |
| 3 |
Correct |
41 ms |
2808 KB |
Output is correct |
| 4 |
Correct |
42 ms |
2936 KB |
Output is correct |
| 5 |
Correct |
14 ms |
2808 KB |
Output is correct |
| 6 |
Correct |
13 ms |
2808 KB |
Output is correct |
| 7 |
Correct |
17 ms |
2808 KB |
Output is correct |
| 8 |
Correct |
14 ms |
2808 KB |
Output is correct |
| 9 |
Correct |
12 ms |
2808 KB |
Output is correct |
| 10 |
Correct |
17 ms |
2808 KB |
Output is correct |
| 11 |
Correct |
11 ms |
2808 KB |
Output is correct |
| 12 |
Correct |
11 ms |
2808 KB |
Output is correct |
| 13 |
Correct |
17 ms |
2808 KB |
Output is correct |
| 14 |
Correct |
19 ms |
2808 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
3025 ms |
13640 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
42 ms |
2808 KB |
Output is correct |
| 2 |
Correct |
42 ms |
2940 KB |
Output is correct |
| 3 |
Correct |
41 ms |
2808 KB |
Output is correct |
| 4 |
Correct |
42 ms |
2936 KB |
Output is correct |
| 5 |
Correct |
14 ms |
2808 KB |
Output is correct |
| 6 |
Correct |
13 ms |
2808 KB |
Output is correct |
| 7 |
Correct |
17 ms |
2808 KB |
Output is correct |
| 8 |
Correct |
14 ms |
2808 KB |
Output is correct |
| 9 |
Correct |
12 ms |
2808 KB |
Output is correct |
| 10 |
Correct |
17 ms |
2808 KB |
Output is correct |
| 11 |
Correct |
11 ms |
2808 KB |
Output is correct |
| 12 |
Correct |
11 ms |
2808 KB |
Output is correct |
| 13 |
Correct |
17 ms |
2808 KB |
Output is correct |
| 14 |
Correct |
19 ms |
2808 KB |
Output is correct |
| 15 |
Execution timed out |
3025 ms |
13640 KB |
Time limit exceeded |
| 16 |
Halted |
0 ms |
0 KB |
- |
