oj.uz

Submission #1049294

# Submission time Handle Problem Language Result Execution time Memory
1049294 2024-08-08T16:01:02 Z beaconmc Race (IOI11_race) C++14
43 / 100
 3000 ms 107068 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];
vector<array<ll,2>> idkman;
ll ans = INF;
ll KK;
ll sus[1000005];

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 dfs2(ll a, ll p, ll d, ll dd){
    for (auto&i : edges[a]){
        if (i[0] != p && !visited[i[0]]) dfs2(i[0], a, d+1,dd + i[1]);
    }
    idkman.push_back({d, dd});
}
void build(ll a, ll p){
    dfs(a,p);
    ll cent = centroid(a, a, p);
    vector<ll> seen;

    sus[0] = 0;
    for (auto&i : edges[cent]){
        idkman.clear();
        dfs2(i[0], cent, 1,i[1]);
        seen.push_back(0);
        sus[0] = 0;

        for (auto&k : idkman){
            ll req = KK - k[1];

            if (0<=req && req <= KK) ans = min(ans, k[0] + sus[req]);
        }
        for (auto&k : idkman){
            seen.push_back(k[1]);
            if (0<=k[1] && k[1] <= KK) sus[k[1]] = min(sus[k[1]], k[0]);

        }
    }
    for (auto&k : seen) if (0<=k && k<=KK) sus[k] = INF;



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

vector<array<ll,3>> dists[maxn];

int best_path(int N, int K, int H[][2], int L[])
{
    KK = K;
    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(), sus[i] = INF;
    FOR(i,0,maxn)FOR(j,0,20) ancc[i][j] = -1;
    FOR(i,0,1000005) sus[i] = INF;
    
    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);



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

}

Compilation message

race.cpp: In function 'int best_path(int, int, int (*)[2], int*)':
race.cpp:108:56: warning: right operand of comma operator has no effect [-Wunused-value]
  108 |     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(), sus[i] = INF;
      |                                                 ~~~~~~~^~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 60508 KB Output is correct
2 Correct 7 ms 60508 KB Output is correct
3 Correct 7 ms 60508 KB Output is correct
4 Correct 7 ms 60584 KB Output is correct
5 Correct 7 ms 60564 KB Output is correct
6 Correct 6 ms 60508 KB Output is correct
7 Correct 6 ms 60508 KB Output is correct
8 Correct 8 ms 60508 KB Output is correct
9 Correct 7 ms 60508 KB Output is correct
10 Correct 7 ms 60508 KB Output is correct
11 Correct 6 ms 60508 KB Output is correct
12 Correct 6 ms 60508 KB Output is correct
13 Correct 9 ms 60504 KB Output is correct
14 Correct 7 ms 60508 KB Output is correct
15 Correct 6 ms 60508 KB Output is correct
16 Correct 7 ms 60508 KB Output is correct
17 Correct 6 ms 60508 KB Output is correct
18 Correct 7 ms 60508 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 60508 KB Output is correct
2 Correct 7 ms 60508 KB Output is correct
3 Correct 7 ms 60508 KB Output is correct
4 Correct 7 ms 60584 KB Output is correct
5 Correct 7 ms 60564 KB Output is correct
6 Correct 6 ms 60508 KB Output is correct
7 Correct 6 ms 60508 KB Output is correct
8 Correct 8 ms 60508 KB Output is correct
9 Correct 7 ms 60508 KB Output is correct
10 Correct 7 ms 60508 KB Output is correct
11 Correct 6 ms 60508 KB Output is correct
12 Correct 6 ms 60508 KB Output is correct
13 Correct 9 ms 60504 KB Output is correct
14 Correct 7 ms 60508 KB Output is correct
15 Correct 6 ms 60508 KB Output is correct
16 Correct 7 ms 60508 KB Output is correct
17 Correct 6 ms 60508 KB Output is correct
18 Correct 7 ms 60508 KB Output is correct
19 Correct 7 ms 60508 KB Output is correct
20 Correct 7 ms 60656 KB Output is correct
21 Correct 8 ms 60588 KB Output is correct
22 Correct 8 ms 60760 KB Output is correct
23 Correct 8 ms 60764 KB Output is correct
24 Correct 8 ms 60764 KB Output is correct
25 Correct 8 ms 60760 KB Output is correct
26 Correct 7 ms 60828 KB Output is correct
27 Correct 10 ms 60764 KB Output is correct
28 Correct 7 ms 60764 KB Output is correct
29 Correct 7 ms 60760 KB Output is correct
30 Correct 7 ms 60624 KB Output is correct
31 Correct 8 ms 60764 KB Output is correct
32 Correct 8 ms 60764 KB Output is correct
33 Correct 10 ms 60612 KB Output is correct
34 Correct 8 ms 60760 KB Output is correct
35 Correct 8 ms 60764 KB Output is correct
36 Correct 7 ms 60612 KB Output is correct
37 Correct 7 ms 60764 KB Output is correct
38 Correct 8 ms 60760 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 60508 KB Output is correct
2 Correct 7 ms 60508 KB Output is correct
3 Correct 7 ms 60508 KB Output is correct
4 Correct 7 ms 60584 KB Output is correct
5 Correct 7 ms 60564 KB Output is correct
6 Correct 6 ms 60508 KB Output is correct
7 Correct 6 ms 60508 KB Output is correct
8 Correct 8 ms 60508 KB Output is correct
9 Correct 7 ms 60508 KB Output is correct
10 Correct 7 ms 60508 KB Output is correct
11 Correct 6 ms 60508 KB Output is correct
12 Correct 6 ms 60508 KB Output is correct
13 Correct 9 ms 60504 KB Output is correct
14 Correct 7 ms 60508 KB Output is correct
15 Correct 6 ms 60508 KB Output is correct
16 Correct 7 ms 60508 KB Output is correct
17 Correct 6 ms 60508 KB Output is correct
18 Correct 7 ms 60508 KB Output is correct
19 Correct 171 ms 78636 KB Output is correct
20 Correct 194 ms 79480 KB Output is correct
21 Correct 147 ms 78928 KB Output is correct
22 Correct 136 ms 79016 KB Output is correct
23 Correct 104 ms 79952 KB Output is correct
24 Correct 84 ms 78400 KB Output is correct
25 Correct 129 ms 83272 KB Output is correct
26 Correct 93 ms 84804 KB Output is correct
27 Correct 2196 ms 97116 KB Output is correct
28 Correct 315 ms 107068 KB Output is correct
29 Correct 310 ms 106040 KB Output is correct
30 Correct 2219 ms 96704 KB Output is correct
31 Correct 2304 ms 96608 KB Output is correct
32 Correct 2711 ms 97500 KB Output is correct
33 Correct 245 ms 95804 KB Output is correct
34 Correct 249 ms 94304 KB Output is correct

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 60508 KB Output is correct
2 Correct 7 ms 60508 KB Output is correct
3 Correct 7 ms 60508 KB Output is correct
4 Correct 7 ms 60584 KB Output is correct
5 Correct 7 ms 60564 KB Output is correct
6 Correct 6 ms 60508 KB Output is correct
7 Correct 6 ms 60508 KB Output is correct
8 Correct 8 ms 60508 KB Output is correct
9 Correct 7 ms 60508 KB Output is correct
10 Correct 7 ms 60508 KB Output is correct
11 Correct 6 ms 60508 KB Output is correct
12 Correct 6 ms 60508 KB Output is correct
13 Correct 9 ms 60504 KB Output is correct
14 Correct 7 ms 60508 KB Output is correct
15 Correct 6 ms 60508 KB Output is correct
16 Correct 7 ms 60508 KB Output is correct
17 Correct 6 ms 60508 KB Output is correct
18 Correct 7 ms 60508 KB Output is correct
19 Correct 7 ms 60508 KB Output is correct
20 Correct 7 ms 60656 KB Output is correct
21 Correct 8 ms 60588 KB Output is correct
22 Correct 8 ms 60760 KB Output is correct
23 Correct 8 ms 60764 KB Output is correct
24 Correct 8 ms 60764 KB Output is correct
25 Correct 8 ms 60760 KB Output is correct
26 Correct 7 ms 60828 KB Output is correct
27 Correct 10 ms 60764 KB Output is correct
28 Correct 7 ms 60764 KB Output is correct
29 Correct 7 ms 60760 KB Output is correct
30 Correct 7 ms 60624 KB Output is correct
31 Correct 8 ms 60764 KB Output is correct
32 Correct 8 ms 60764 KB Output is correct
33 Correct 10 ms 60612 KB Output is correct
34 Correct 8 ms 60760 KB Output is correct
35 Correct 8 ms 60764 KB Output is correct
36 Correct 7 ms 60612 KB Output is correct
37 Correct 7 ms 60764 KB Output is correct
38 Correct 8 ms 60760 KB Output is correct
39 Correct 171 ms 78636 KB Output is correct
40 Correct 194 ms 79480 KB Output is correct
41 Correct 147 ms 78928 KB Output is correct
42 Correct 136 ms 79016 KB Output is correct
43 Correct 104 ms 79952 KB Output is correct
44 Correct 84 ms 78400 KB Output is correct
45 Correct 129 ms 83272 KB Output is correct
46 Correct 93 ms 84804 KB Output is correct
47 Correct 2196 ms 97116 KB Output is correct
48 Correct 315 ms 107068 KB Output is correct
49 Correct 310 ms 106040 KB Output is correct
50 Correct 2219 ms 96704 KB Output is correct
51 Correct 2304 ms 96608 KB Output is correct
52 Correct 2711 ms 97500 KB Output is correct
53 Correct 245 ms 95804 KB Output is correct
54 Correct 249 ms 94304 KB Output is correct
55 Correct 15 ms 62300 KB Output is correct
56 Correct 18 ms 62132 KB Output is correct
57 Correct 83 ms 79956 KB Output is correct
58 Execution timed out 3038 ms 80128 KB Time limit exceeded
59 Halted 0 ms 0 KB -