oj.uz

답안 #416937

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
416937 2021-06-03T07:50:50 Z Emin2004 경주 (Race) (IOI11_race) C++14
21 / 100
 35 ms 4892 KB 
#include "race.h"
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pb push_back
#define pii pair<int, ll>
#define F first
#define S second

const int N = 10005;
const int mod = 1e9+7;

int par[1005][20], hgh[N], tin[N], tout[N], tmr = 1;
ll dis[N];
vector<pii> a[N];

void DFS(int node){
    for(int i = 1; i <= 10; i++){
        par[node][i] = par[par[node][i - 1]][i - 1];
    }
    tin[node] = tmr;
    tmr++;
    for(pii i : a[node]){
        if(i.F != par[node][0]){
            par[i.F][0] = node;
            dis[i.F] = dis[node] + i.S;
            hgh[i.F] = hgh[node] + 1;
            DFS(i.F);
        }
    }
    tout[node] = tmr;
    tmr++;
}

bool ispar(int a, int b){
    if(tin[a] < tin[b] && tout[b] < tout[a]) return true;
    return false;
}

int LCA(int a, int b){
    if(ispar(a, b)) return a;
    if(ispar(b, a)) return b;
    if(hgh[a] < hgh[b]) swap(a, b);
    for(int i = 10; i >= 0; i--){
        if(par[a][i] == -1) continue;
        if(!ispar(par[a][i], b)) a = par[a][i];
    }
    return par[a][0];
}

int best_path(int n, int k, int h[][2], int l[]){
    for(int i = 0; i < n - 1; i++){
        int u = h[i][0];
        int v = h[i][1];
        a[u].pb({v, l[i]});
        a[v].pb({u, l[i]});
        for(int j = 0; j < 11; j++) par[i][j] = -1;
    }
    for(int j = 0; j < 11; j++) par[n - 1][j] = -1;
    DFS(0);
    int ans = n + 5;
    for(int i = 0; i <= n; i++){
        for(int j = i + 1; j <= n; j++){
            int anc = LCA(i, j);
            ll lnt = dis[i] + dis[j] - dis[anc] - dis[anc];
            if(lnt == k){
                ans = min(ans, hgh[i] + hgh[j] - hgh[anc] - hgh[anc]);
            }
        }
    }
    if(ans == n + 5) return -1;
    return ans;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 588 KB Output is correct
2 Correct 1 ms 536 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 536 KB Output is correct
5 Correct 1 ms 540 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 532 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 1 ms 588 KB Output is correct
10 Correct 1 ms 588 KB Output is correct
11 Correct 1 ms 588 KB Output is correct
12 Correct 1 ms 588 KB Output is correct
13 Correct 1 ms 588 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 588 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 588 KB Output is correct
2 Correct 1 ms 536 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 536 KB Output is correct
5 Correct 1 ms 540 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 532 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 1 ms 588 KB Output is correct
10 Correct 1 ms 588 KB Output is correct
11 Correct 1 ms 588 KB Output is correct
12 Correct 1 ms 588 KB Output is correct
13 Correct 1 ms 588 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 588 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 460 KB Output is correct
21 Correct 33 ms 716 KB Output is correct
22 Correct 35 ms 716 KB Output is correct
23 Correct 32 ms 716 KB Output is correct
24 Correct 33 ms 716 KB Output is correct
25 Correct 33 ms 716 KB Output is correct
26 Correct 33 ms 716 KB Output is correct
27 Correct 34 ms 716 KB Output is correct
28 Correct 32 ms 732 KB Output is correct
29 Correct 34 ms 740 KB Output is correct
30 Correct 33 ms 716 KB Output is correct
31 Correct 34 ms 716 KB Output is correct
32 Correct 33 ms 712 KB Output is correct
33 Correct 34 ms 716 KB Output is correct
34 Correct 25 ms 716 KB Output is correct
35 Correct 20 ms 736 KB Output is correct
36 Correct 15 ms 724 KB Output is correct
37 Correct 22 ms 588 KB Output is correct
38 Correct 28 ms 716 KB Output is correct

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 588 KB Output is correct
2 Correct 1 ms 536 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 536 KB Output is correct
5 Correct 1 ms 540 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 532 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 1 ms 588 KB Output is correct
10 Correct 1 ms 588 KB Output is correct
11 Correct 1 ms 588 KB Output is correct
12 Correct 1 ms 588 KB Output is correct
13 Correct 1 ms 588 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 588 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Runtime error 30 ms 4892 KB Execution killed with signal 11
20 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 588 KB Output is correct
2 Correct 1 ms 536 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 536 KB Output is correct
5 Correct 1 ms 540 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 532 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 1 ms 588 KB Output is correct
10 Correct 1 ms 588 KB Output is correct
11 Correct 1 ms 588 KB Output is correct
12 Correct 1 ms 588 KB Output is correct
13 Correct 1 ms 588 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 588 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 460 KB Output is correct
21 Correct 33 ms 716 KB Output is correct
22 Correct 35 ms 716 KB Output is correct
23 Correct 32 ms 716 KB Output is correct
24 Correct 33 ms 716 KB Output is correct
25 Correct 33 ms 716 KB Output is correct
26 Correct 33 ms 716 KB Output is correct
27 Correct 34 ms 716 KB Output is correct
28 Correct 32 ms 732 KB Output is correct
29 Correct 34 ms 740 KB Output is correct
30 Correct 33 ms 716 KB Output is correct
31 Correct 34 ms 716 KB Output is correct
32 Correct 33 ms 712 KB Output is correct
33 Correct 34 ms 716 KB Output is correct
34 Correct 25 ms 716 KB Output is correct
35 Correct 20 ms 736 KB Output is correct
36 Correct 15 ms 724 KB Output is correct
37 Correct 22 ms 588 KB Output is correct
38 Correct 28 ms 716 KB Output is correct
39 Runtime error 30 ms 4892 KB Execution killed with signal 11
40 Halted 0 ms 0 KB -