oj.uz

답안 #1049157

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1049157 2024-08-08T14:21:48 Z beaconmc 경주 (Race) (IOI11_race) C++14
21 / 100
 2197 ms 262144 KB 
#include "race.h"
#include <bits/stdc++.h>
 
typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)

using namespace std;

const ll maxn = 200005;
const ll INF = 1000000000;

vector<vector<ll>> edges[maxn];
ll par[maxn];
ll centpar[maxn];
ll depth[maxn];
ll realdepth[maxn];
ll ancc[maxn][20];
bool visited[maxn];
ll sub[maxn];

ll anc(ll a, ll x){
    if (a==0) return 0;
    if (x==0) return par[a];
    if (ancc[a][x] != -1) return ancc[a][x];
    return ancc[a][x] = anc(anc(a,x-1),x-1);
}

ll lca(ll a, ll b){
    if (depth[a] < depth[b]) swap(a,b);
    FORNEG(i,19,-1) if (depth[anc(a, i)] >= depth[b]) a = anc(a,i);
    if (a==b) return a;
    FORNEG(i,19,-1) if (anc(a,i) != anc(b,i)) a = anc(a,i), b = anc(b,i);
    return par[a];
}

void initdfs(ll a,ll p, ll d, ll dd){
    par[a] = p;
    depth[a] = d;
    realdepth[a] = dd;
    for (auto&i : edges[a]){
        if (i[0] != p) initdfs(i[0], a, d+1, dd+i[1]);
    }
}

ll centroid(ll root, ll a, ll p){
    for (auto&i : edges[a]){
        if (!visited[i[0]] && i[0] != p && sub[i[0]] > sub[root]/2) return centroid(root, i[0], a);
    }
    return a;
}
void dfs(ll a, ll p){
    sub[a] = 1;
    for (auto&i : edges[a]){

        if(i[0] != p && !visited[i[0]]) dfs(i[0], a), sub[a] += sub[i[0]];
    }
}
void build(ll a, ll p){

    dfs(a,p);
    ll cent = centroid(a, a, p);


    centpar[cent] = p;
    visited[cent] = 1;
    for (auto&i : edges[cent]){
        if (!visited[i[0]]) build(i[0], cent);
    }
}

map<ll, pair<array<ll,2>,array<ll,2>>> dists[maxn];

int best_path(int N, int K, int H[][2], int L[])
{
    FOR(i,0,maxn) par[i] = -1, centpar[i] = -1, par[i] -1, depth[i] = -1, realdepth[i] = -1,visited[i] = 0,dists[i].clear(),edges[i].clear();
    FOR(i,0,maxn)FOR(j,0,20) ancc[i][j] = -1;
    
    
    FOR(i,0,N-1){

        edges[H[i][0]].push_back({H[i][1], L[i]});
        edges[H[i][1]].push_back({H[i][0], L[i]});
    }

    
    initdfs(0,-1,0,0);
    dfs(0,-1);

    build(0,-1);



    

    FOR(i,0,N){
        ll temp = centpar[i];
        ll prev = i;

        while (temp != -1){
            ll idk = lca(temp,i);
            ll cur = depth[temp] + depth[i] - depth[idk]*2;

           
            ll dist = realdepth[temp] + realdepth[i] - realdepth[idk]*2;

            if (dists[temp].count(dist) == 0) dists[temp][dist] = make_pair(array<ll,2>{cur, prev}, array<ll,2>{INF, INF});
            else{
                array<ll,2> a,b;
                a = dists[temp][dist].first;
                b = dists[temp][dist].second;

                if (a[1] == prev){
                    a[0] = min(a[0], cur);
                }else if (b[1] == prev){
                    b[0] = min(b[0], cur);
                }else{
                    if (cur <= a[0]) b = a, a = {cur, prev};
                    else if (cur <= b[0]) b = {cur, prev};
                }
                if (a[0] > b[0]) swap(a,b);
                dists[temp][dist] = make_pair(a,b);
            }
            prev = temp;
            temp = centpar[temp];

        }
    }
    ll ans = INF;
    FOR(i,0,N){
        for (auto&k : dists[i]){
            ll req = K-k.first;
            if (req == 0) ans = min(ans, k.second.first[0]);


            if (dists[i].count(req)==0) continue;
            if (req == k.first){

                ans = min(ans, k.second.first[0]+k.second.second[0]);
            }
            else{

                // cout << k.second.first[0] << " " << k.second.first[1] << endl;
                // cout << dists[i][req].first[0] << " " << dists[i][req].first[1] << endl;

                if (k.second.first[1] != dists[i][req].first[1]) ans = min(ans, k.second.first[0] + dists[i][req].first[0]);
                if (k.second.first[1] != dists[i][req].second[1]) ans = min(ans, k.second.first[0] + dists[i][req].second[0]);
                if (k.second.second[1] != dists[i][req].first[1]) ans = min(ans, k.second.second[0] + dists[i][req].first[0]);
                if (k.second.second[1] != dists[i][req].second[1]) ans = min(ans, k.second.second[0] + dists[i][req].second[0]);
            }
        }
    }

    if (ans >= INF) return -1;
    else return ans;

}

Compilation message

race.cpp: In function 'int best_path(int, int, int (*)[2], int*)':
race.cpp:76:56: warning: right operand of comma operator has no effect [-Wunused-value]
   76 |     FOR(i,0,maxn) par[i] = -1, centpar[i] = -1, par[i] -1, depth[i] = -1, realdepth[i] = -1,visited[i] = 0,dists[i].clear(),edges[i].clear();
      |                                                 ~~~~~~~^~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 57436 KB Output is correct
2 Correct 7 ms 57544 KB Output is correct
3 Correct 7 ms 57436 KB Output is correct
4 Correct 7 ms 57436 KB Output is correct
5 Correct 7 ms 57436 KB Output is correct
6 Correct 7 ms 57436 KB Output is correct
7 Correct 7 ms 57436 KB Output is correct
8 Correct 7 ms 57436 KB Output is correct
9 Correct 7 ms 57492 KB Output is correct
10 Correct 7 ms 57568 KB Output is correct
11 Correct 7 ms 57568 KB Output is correct
12 Correct 7 ms 57436 KB Output is correct
13 Correct 7 ms 57452 KB Output is correct
14 Correct 8 ms 57436 KB Output is correct
15 Correct 7 ms 57456 KB Output is correct
16 Correct 7 ms 57456 KB Output is correct
17 Correct 7 ms 57504 KB Output is correct
18 Correct 7 ms 57436 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 57436 KB Output is correct
2 Correct 7 ms 57544 KB Output is correct
3 Correct 7 ms 57436 KB Output is correct
4 Correct 7 ms 57436 KB Output is correct
5 Correct 7 ms 57436 KB Output is correct
6 Correct 7 ms 57436 KB Output is correct
7 Correct 7 ms 57436 KB Output is correct
8 Correct 7 ms 57436 KB Output is correct
9 Correct 7 ms 57492 KB Output is correct
10 Correct 7 ms 57568 KB Output is correct
11 Correct 7 ms 57568 KB Output is correct
12 Correct 7 ms 57436 KB Output is correct
13 Correct 7 ms 57452 KB Output is correct
14 Correct 8 ms 57436 KB Output is correct
15 Correct 7 ms 57456 KB Output is correct
16 Correct 7 ms 57456 KB Output is correct
17 Correct 7 ms 57504 KB Output is correct
18 Correct 7 ms 57436 KB Output is correct
19 Correct 7 ms 57436 KB Output is correct
20 Correct 7 ms 57436 KB Output is correct
21 Correct 8 ms 57904 KB Output is correct
22 Correct 9 ms 57948 KB Output is correct
23 Correct 9 ms 58008 KB Output is correct
24 Correct 8 ms 57976 KB Output is correct
25 Correct 8 ms 57948 KB Output is correct
26 Correct 9 ms 57776 KB Output is correct
27 Correct 8 ms 57692 KB Output is correct
28 Correct 8 ms 57948 KB Output is correct
29 Correct 8 ms 57976 KB Output is correct
30 Correct 8 ms 57948 KB Output is correct
31 Correct 8 ms 57948 KB Output is correct
32 Correct 9 ms 57944 KB Output is correct
33 Correct 8 ms 57948 KB Output is correct
34 Correct 9 ms 57948 KB Output is correct
35 Correct 9 ms 57948 KB Output is correct
36 Correct 9 ms 57948 KB Output is correct
37 Correct 8 ms 57948 KB Output is correct
38 Correct 9 ms 57948 KB Output is correct

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 57436 KB Output is correct
2 Correct 7 ms 57544 KB Output is correct
3 Correct 7 ms 57436 KB Output is correct
4 Correct 7 ms 57436 KB Output is correct
5 Correct 7 ms 57436 KB Output is correct
6 Correct 7 ms 57436 KB Output is correct
7 Correct 7 ms 57436 KB Output is correct
8 Correct 7 ms 57436 KB Output is correct
9 Correct 7 ms 57492 KB Output is correct
10 Correct 7 ms 57568 KB Output is correct
11 Correct 7 ms 57568 KB Output is correct
12 Correct 7 ms 57436 KB Output is correct
13 Correct 7 ms 57452 KB Output is correct
14 Correct 8 ms 57436 KB Output is correct
15 Correct 7 ms 57456 KB Output is correct
16 Correct 7 ms 57456 KB Output is correct
17 Correct 7 ms 57504 KB Output is correct
18 Correct 7 ms 57436 KB Output is correct
19 Correct 406 ms 94924 KB Output is correct
20 Correct 406 ms 94776 KB Output is correct
21 Correct 365 ms 93264 KB Output is correct
22 Correct 353 ms 91472 KB Output is correct
23 Correct 678 ms 126112 KB Output is correct
24 Correct 235 ms 88916 KB Output is correct
25 Correct 698 ms 87636 KB Output is correct
26 Correct 238 ms 83792 KB Output is correct
27 Correct 427 ms 138576 KB Output is correct
28 Runtime error 2197 ms 262144 KB Execution killed with signal 9
29 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 57436 KB Output is correct
2 Correct 7 ms 57544 KB Output is correct
3 Correct 7 ms 57436 KB Output is correct
4 Correct 7 ms 57436 KB Output is correct
5 Correct 7 ms 57436 KB Output is correct
6 Correct 7 ms 57436 KB Output is correct
7 Correct 7 ms 57436 KB Output is correct
8 Correct 7 ms 57436 KB Output is correct
9 Correct 7 ms 57492 KB Output is correct
10 Correct 7 ms 57568 KB Output is correct
11 Correct 7 ms 57568 KB Output is correct
12 Correct 7 ms 57436 KB Output is correct
13 Correct 7 ms 57452 KB Output is correct
14 Correct 8 ms 57436 KB Output is correct
15 Correct 7 ms 57456 KB Output is correct
16 Correct 7 ms 57456 KB Output is correct
17 Correct 7 ms 57504 KB Output is correct
18 Correct 7 ms 57436 KB Output is correct
19 Correct 7 ms 57436 KB Output is correct
20 Correct 7 ms 57436 KB Output is correct
21 Correct 8 ms 57904 KB Output is correct
22 Correct 9 ms 57948 KB Output is correct
23 Correct 9 ms 58008 KB Output is correct
24 Correct 8 ms 57976 KB Output is correct
25 Correct 8 ms 57948 KB Output is correct
26 Correct 9 ms 57776 KB Output is correct
27 Correct 8 ms 57692 KB Output is correct
28 Correct 8 ms 57948 KB Output is correct
29 Correct 8 ms 57976 KB Output is correct
30 Correct 8 ms 57948 KB Output is correct
31 Correct 8 ms 57948 KB Output is correct
32 Correct 9 ms 57944 KB Output is correct
33 Correct 8 ms 57948 KB Output is correct
34 Correct 9 ms 57948 KB Output is correct
35 Correct 9 ms 57948 KB Output is correct
36 Correct 9 ms 57948 KB Output is correct
37 Correct 8 ms 57948 KB Output is correct
38 Correct 9 ms 57948 KB Output is correct
39 Correct 406 ms 94924 KB Output is correct
40 Correct 406 ms 94776 KB Output is correct
41 Correct 365 ms 93264 KB Output is correct
42 Correct 353 ms 91472 KB Output is correct
43 Correct 678 ms 126112 KB Output is correct
44 Correct 235 ms 88916 KB Output is correct
45 Correct 698 ms 87636 KB Output is correct
46 Correct 238 ms 83792 KB Output is correct
47 Correct 427 ms 138576 KB Output is correct
48 Runtime error 2197 ms 262144 KB Execution killed with signal 9
49 Halted 0 ms 0 KB -