oj.uz

Submission #560096

# Submission time Handle Problem Language Result Execution time Memory
560096 2022-05-11T04:05:45 Z tamthegod Valley (BOI19_valley) C++14
100 / 100
 458 ms 67036 KB 
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<stack>
#include<queue>
#include<string>
#include<string.h>
#include<cmath>
#include<vector>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<cstdio>
#include<bitset>
#include<chrono>
#include<random>
#include<ext/rope>
/* ordered_set
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
*/
#define int long long
#define pb push_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxN = 1e5 + 5;
const int mod = 1e9 + 7;
const ll oo = 1e18;
int n, s, Q, e;
vector<int> adj[maxN];
bool is_shop[maxN];
map<pair<int, int>, int> id, dist;
int depth[maxN], lg[maxN];
int f[maxN][21];
int w[maxN];
pair<int, int> edge[maxN];
int d[maxN], dmin[maxN];
int dp[maxN][21];
int timein[maxN], timeout[maxN];
struct TQuery
{
    int r, id;
};
int res[maxN];
int Time = 0;
void Log()
{
    for(int i=2; i<maxN; i++)
        lg[i] = lg[i / 2] + 1;
}
void predfs(int u, int par)
{
    timein[u] = ++Time;
    dmin[u] = (is_shop[u]) ? d[u] : oo;
    for(int v : adj[u])
    {
        if(v == par) continue;
        depth[v] = depth[u] + 1;
        f[v][0] = u;
        d[v] = d[u] + dist[{u, v}];
        for(int i=1; i<=lg[n]; i++)
            f[v][i] = f[f[v][i - 1]][i - 1];
        predfs(v, u);
        dmin[u] = min(dmin[u], dmin[v]);
    }
    timeout[u] = Time;
}
void rmq(int u, int par)
{
    dp[u][0] = dmin[u] - 2 * d[u];
    for(int i=1; i<=19; i++)
        dp[u][i] = min(dp[u][i - 1], dp[f[u][i - 1]][i - 1]);
    for(int v : adj[u])
    {
        if(v == par) continue;
        rmq(v, u);
    }
}
bool chk(int u, int v)
{
    return timein[u] <= timein[v] && timeout[v] <= timeout[u];
}
int get(int u, int v)
{
    int res = dp[v][0];
    for(int i=20; i>=0; i--)
    {
        if(f[u][i] && chk(v, f[u][i]))
        {
            res = min(res, dp[u][i]);
            u = f[u][i];
        }
    }
    return res;
}
void ReadInput()
{
    cin >> n >> s >> Q >> e;
    for(int i=1; i<n; i++)
    {
        int u, v, w;
        cin >> u >> v >> w;
        edge[i] = {u, v};
        adj[u].pb(v);
        adj[v].pb(u);
        dist[{u, v}] = dist[{v, u}] = w;
    }
    for(int i=1; i<=s; i++)
    {
        int x;
        cin >> x;
        is_shop[x] = 1;
    }
}

void Solve()
{
    predfs(e, 0);
    rmq(e, 0);
    for(int i=1; i<=Q; i++)
    {
        int id, r;
        cin >> id >> r;
        int u = edge[id].fi, v = edge[id].se;
        int w = chk(u, v) ? v : u;//cout << ;return;
        if(!chk(w, r)) cout << "escaped\n";
        else
        {
            int res = get(r, w) + d[r];
            if(res >= (int)1e15) cout << "oo\n";
            else cout << res << '\n';
        }
    }

}
int32_t main()
{
   // freopen("x.inp", "r", stdin);
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    Log();
    ReadInput();
    Solve();
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3540 KB Output is correct
2 Correct 4 ms 3668 KB Output is correct
3 Correct 4 ms 3540 KB Output is correct
4 Correct 3 ms 3540 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3540 KB Output is correct
2 Correct 4 ms 3668 KB Output is correct
3 Correct 4 ms 3540 KB Output is correct
4 Correct 3 ms 3540 KB Output is correct
5 Correct 3 ms 4052 KB Output is correct
6 Correct 3 ms 4052 KB Output is correct
7 Correct 3 ms 4052 KB Output is correct
8 Correct 3 ms 4052 KB Output is correct
9 Correct 3 ms 4024 KB Output is correct
10 Correct 3 ms 4052 KB Output is correct
11 Correct 3 ms 4052 KB Output is correct
12 Correct 3 ms 4052 KB Output is correct
13 Correct 3 ms 4052 KB Output is correct
14 Correct 3 ms 4052 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 319 ms 58956 KB Output is correct
2 Correct 385 ms 58612 KB Output is correct
3 Correct 361 ms 58660 KB Output is correct
4 Correct 458 ms 61852 KB Output is correct
5 Correct 382 ms 61876 KB Output is correct
6 Correct 450 ms 65612 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3540 KB Output is correct
2 Correct 4 ms 3668 KB Output is correct
3 Correct 4 ms 3540 KB Output is correct
4 Correct 3 ms 3540 KB Output is correct
5 Correct 3 ms 4052 KB Output is correct
6 Correct 3 ms 4052 KB Output is correct
7 Correct 3 ms 4052 KB Output is correct
8 Correct 3 ms 4052 KB Output is correct
9 Correct 3 ms 4024 KB Output is correct
10 Correct 3 ms 4052 KB Output is correct
11 Correct 3 ms 4052 KB Output is correct
12 Correct 3 ms 4052 KB Output is correct
13 Correct 3 ms 4052 KB Output is correct
14 Correct 3 ms 4052 KB Output is correct
15 Correct 319 ms 58956 KB Output is correct
16 Correct 385 ms 58612 KB Output is correct
17 Correct 361 ms 58660 KB Output is correct
18 Correct 458 ms 61852 KB Output is correct
19 Correct 382 ms 61876 KB Output is correct
20 Correct 450 ms 65612 KB Output is correct
21 Correct 350 ms 58892 KB Output is correct
22 Correct 350 ms 58636 KB Output is correct
23 Correct 375 ms 58624 KB Output is correct
24 Correct 403 ms 62396 KB Output is correct
25 Correct 406 ms 67036 KB Output is correct
26 Correct 363 ms 59064 KB Output is correct
27 Correct 373 ms 58688 KB Output is correct
28 Correct 429 ms 58700 KB Output is correct
29 Correct 423 ms 61248 KB Output is correct
30 Correct 433 ms 63616 KB Output is correct
31 Correct 343 ms 59140 KB Output is correct
32 Correct 392 ms 58688 KB Output is correct
33 Correct 443 ms 58816 KB Output is correct
34 Correct 415 ms 61972 KB Output is correct
35 Correct 458 ms 67004 KB Output is correct
36 Correct 408 ms 62740 KB Output is correct