oj.uz

답안 #334451

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
334451 2020-12-09T07:31:54 Z ncduy0303 Roadside Advertisements (NOI17_roadsideadverts) C++17
100 / 100
 91 ms 12268 KB 
#include <bits/stdc++.h>

using namespace std;

#define ar array
#define ll long long

const int MAX_N = 5e4 + 1;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LINF = 1e18;

const int MAX_L = 18;

int n, q, par[MAX_N][MAX_L], dep[MAX_N], dist[MAX_N];
int timer, tin[MAX_N];
vector<ar<int,2>> adj[MAX_N];
 
void dfs(int u, int p = 0) {
    par[u][0] = p;
    tin[u] = ++timer;
    for (int i = 1; i < MAX_L; i++) 
        par[u][i] = par[par[u][i - 1]][i - 1];
    for (auto [v, w] : adj[u]) {
        if (v == p) continue;
        dep[v] = dep[u] + 1;
        dist[v] = dist[u] + w;
        dfs(v, u);
    }
}
 
int ancestor(int u, int k) {
    for (int i = 0; i < MAX_L; i++) 
        if (k & (1 << i)) 
            u = par[u][i];
    return u;
}
 
int lca(int u, int v) {
    if (dep[u] < dep[v]) swap(u, v);
    u = ancestor(u, dep[u] - dep[v]);
    if (u == v) return u;
    for (int i = MAX_L - 1; i >= 0; i--)
        if (par[u][i] != par[v][i])
            u = par[u][i], v = par[v][i];
    return par[u][0];
}

int query(int u, int v) {
    return dist[u] + dist[v] - 2 * dist[lca(u, v)];
}

bool cmp(int u, int v) {
    return tin[u] < tin[v];
}

void solve() {
    cin >> n;
    for (int i = 0; i < n - 1; i++) {
        int u, v, w; cin >> u >> v >> w;
        adj[u].push_back({v, w});
        adj[v].push_back({u, w});
    }
    dfs(0);
    cin >> q;
    while (q--) {
        vector<int> a(5);
        for (int i = 0; i < 5; i++) cin >> a[i];
        sort(a.begin(), a.end(), cmp);
        
        int ans = query(a[0], lca(a[0], a[4]));
        for (int i = 1; i < 5; i++) {
            ans += query(a[i], lca(a[i], a[i - 1]));
        }
        cout << ans << "\n";
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);

    int tc = 1;
    // cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case #" << t  << ": ";
        solve();
    }
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1516 KB Output is correct

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 10348 KB Output is correct
2 Correct 79 ms 12268 KB Output is correct
3 Correct 81 ms 12268 KB Output is correct
4 Correct 75 ms 12268 KB Output is correct
5 Correct 76 ms 12268 KB Output is correct
6 Correct 80 ms 12268 KB Output is correct
7 Correct 74 ms 12268 KB Output is correct
8 Correct 75 ms 12268 KB Output is correct
9 Correct 79 ms 12268 KB Output is correct
10 Correct 74 ms 12268 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 8300 KB Output is correct
2 Correct 54 ms 11372 KB Output is correct
3 Correct 53 ms 11244 KB Output is correct
4 Correct 49 ms 11244 KB Output is correct
5 Correct 51 ms 11244 KB Output is correct
6 Correct 48 ms 11244 KB Output is correct
7 Correct 55 ms 11244 KB Output is correct
8 Correct 56 ms 11372 KB Output is correct
9 Correct 49 ms 11244 KB Output is correct
10 Correct 52 ms 11244 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1516 KB Output is correct
2 Correct 67 ms 10348 KB Output is correct
3 Correct 79 ms 12268 KB Output is correct
4 Correct 81 ms 12268 KB Output is correct
5 Correct 75 ms 12268 KB Output is correct
6 Correct 76 ms 12268 KB Output is correct
7 Correct 80 ms 12268 KB Output is correct
8 Correct 74 ms 12268 KB Output is correct
9 Correct 75 ms 12268 KB Output is correct
10 Correct 79 ms 12268 KB Output is correct
11 Correct 74 ms 12268 KB Output is correct
12 Correct 37 ms 8300 KB Output is correct
13 Correct 54 ms 11372 KB Output is correct
14 Correct 53 ms 11244 KB Output is correct
15 Correct 49 ms 11244 KB Output is correct
16 Correct 51 ms 11244 KB Output is correct
17 Correct 48 ms 11244 KB Output is correct
18 Correct 55 ms 11244 KB Output is correct
19 Correct 56 ms 11372 KB Output is correct
20 Correct 49 ms 11244 KB Output is correct
21 Correct 52 ms 11244 KB Output is correct
22 Correct 68 ms 10348 KB Output is correct
23 Correct 55 ms 8684 KB Output is correct
24 Correct 74 ms 11628 KB Output is correct
25 Correct 78 ms 11628 KB Output is correct
26 Correct 70 ms 11628 KB Output is correct
27 Correct 73 ms 11628 KB Output is correct
28 Correct 77 ms 11628 KB Output is correct
29 Correct 80 ms 11628 KB Output is correct
30 Correct 81 ms 11628 KB Output is correct
31 Correct 91 ms 11628 KB Output is correct