oj.uz

Submission #765326

# Submission time Handle Problem Language Result Execution time Memory
765326 2023-06-24T10:48:59 Z vjudge1 Roadside Advertisements (NOI17_roadsideadverts) C++17
100 / 100
 45 ms 15392 KB 
#include <bits/stdc++.h>
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")
#define ent '\n'
#define f first
#define s second

using namespace std;
typedef long long ll;
typedef pair < int, int> pii;
typedef pair < ll, ll > pll;

const int maxn = 2e5 + 100;
const int mod = 1e9 + 7;
const int INF = 1e9;
const int LOG = 20;
const int K = 400;
const int P = 31;

int n, m;
vector < pii > g[maxn];
int pref[maxn], p[LOG][maxn], tin[maxn], tout[maxn], timer, depth[maxn], a[6];
ll ans = 0;
void dfs(int v){
    for(int i = 1;i < LOG;i++){
        p[i][v] = p[i - 1][p[i - 1][v]];
    }
    tin[v] = ++timer;
    for(auto to: g[v]){
        if(to.f == p[0][v])continue;
        p[0][to.f] = v;
        depth[to.f] = depth[v] + 1;
        pref[to.f] = pref[v] + to.s;
        dfs(to.f);
    }
    tout[v] = ++timer;
}

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

int lca(int a, int b){
    if(upper(a, b))return a;
    if(upper(b, a))return b;
    for(int i = LOG - 1;i >= 0;i--){
        if(!upper(p[i][a], b) && p[i][a] != 0)a = p[i][a];
    }
    return p[0][a];
}

void solve(){
    cin >> n;
    for(int i = 1;i < n;i++){
        int u, v, w;
        cin >> u >> v >> w;
        u++, v++;
        g[u].push_back({v, w});
        g[v].push_back({u, w});
    }
    dfs(1);
    cin >> m;
    for(int i = 1;i <= m;i++){
        cin >> a[1];
        int LCA = a[1] + 1, ans = 0;
        for(int j = 2;j <= 5;j++){
            cin >> a[j];
            LCA = lca(LCA, a[j] + 1);
        }
        for(int j = 1;j <= 5;j++){
            int q = LCA;
            for(int k = 1;k < j;k++){
                int w = lca(a[j] + 1, a[k] + 1);
                if(depth[q] < depth[w]){
                    q = w;
                }
            }
            ans += pref[a[j] + 1] - pref[q];
        }
        cout << ans << ent;
    }
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int T = 1;
    // cin >> T;
    for(int i = 1;i <= T;i++){
        solve();
    }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 13548 KB Output is correct
2 Correct 29 ms 15304 KB Output is correct
3 Correct 31 ms 15276 KB Output is correct
4 Correct 29 ms 15284 KB Output is correct
5 Correct 30 ms 15372 KB Output is correct
6 Correct 30 ms 15296 KB Output is correct
7 Correct 31 ms 15328 KB Output is correct
8 Correct 31 ms 15296 KB Output is correct
9 Correct 40 ms 15392 KB Output is correct
10 Correct 30 ms 15352 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 11604 KB Output is correct
2 Correct 25 ms 14604 KB Output is correct
3 Correct 25 ms 14660 KB Output is correct
4 Correct 26 ms 14660 KB Output is correct
5 Correct 25 ms 14672 KB Output is correct
6 Correct 26 ms 14608 KB Output is correct
7 Correct 26 ms 14676 KB Output is correct
8 Correct 34 ms 14584 KB Output is correct
9 Correct 25 ms 14668 KB Output is correct
10 Correct 29 ms 14568 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Correct 39 ms 13548 KB Output is correct
3 Correct 29 ms 15304 KB Output is correct
4 Correct 31 ms 15276 KB Output is correct
5 Correct 29 ms 15284 KB Output is correct
6 Correct 30 ms 15372 KB Output is correct
7 Correct 30 ms 15296 KB Output is correct
8 Correct 31 ms 15328 KB Output is correct
9 Correct 31 ms 15296 KB Output is correct
10 Correct 40 ms 15392 KB Output is correct
11 Correct 30 ms 15352 KB Output is correct
12 Correct 20 ms 11604 KB Output is correct
13 Correct 25 ms 14604 KB Output is correct
14 Correct 25 ms 14660 KB Output is correct
15 Correct 26 ms 14660 KB Output is correct
16 Correct 25 ms 14672 KB Output is correct
17 Correct 26 ms 14608 KB Output is correct
18 Correct 26 ms 14676 KB Output is correct
19 Correct 34 ms 14584 KB Output is correct
20 Correct 25 ms 14668 KB Output is correct
21 Correct 29 ms 14568 KB Output is correct
22 Correct 45 ms 13448 KB Output is correct
23 Correct 45 ms 11732 KB Output is correct
24 Correct 38 ms 14736 KB Output is correct
25 Correct 37 ms 14748 KB Output is correct
26 Correct 37 ms 14676 KB Output is correct
27 Correct 44 ms 14764 KB Output is correct
28 Correct 40 ms 14668 KB Output is correct
29 Correct 38 ms 14660 KB Output is correct
30 Correct 37 ms 14764 KB Output is correct
31 Correct 37 ms 14760 KB Output is correct