oj.uz

Submission #1049281

# Submission time Handle Problem Language Result Execution time Memory
1049281 2024-08-08T15:55:39 Z beaconmc Race (IOI11_race) C++14
21 / 100
 3000 ms 116596 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 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);
    unordered_map<ll,ll> sus;
    sus[0] = 0;
    for (auto&i : edges[cent]){
        idkman.clear();
        dfs2(i[0], cent, 1,i[1]);

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

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



    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();
    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);



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

}

Compilation message

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

# Verdict Execution time Memory Grader output
1 Correct 6 ms 52828 KB Output is correct
2 Correct 6 ms 52664 KB Output is correct
3 Correct 6 ms 52824 KB Output is correct
4 Correct 6 ms 52796 KB Output is correct
5 Correct 6 ms 52828 KB Output is correct
6 Correct 6 ms 52824 KB Output is correct
7 Correct 5 ms 52808 KB Output is correct
8 Correct 6 ms 52752 KB Output is correct
9 Correct 6 ms 52824 KB Output is correct
10 Correct 6 ms 52828 KB Output is correct
11 Correct 7 ms 52828 KB Output is correct
12 Correct 5 ms 52828 KB Output is correct
13 Correct 6 ms 52828 KB Output is correct
14 Correct 5 ms 52828 KB Output is correct
15 Correct 6 ms 52828 KB Output is correct
16 Correct 6 ms 52736 KB Output is correct
17 Correct 6 ms 52828 KB Output is correct
18 Correct 6 ms 52828 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 52828 KB Output is correct
2 Correct 6 ms 52664 KB Output is correct
3 Correct 6 ms 52824 KB Output is correct
4 Correct 6 ms 52796 KB Output is correct
5 Correct 6 ms 52828 KB Output is correct
6 Correct 6 ms 52824 KB Output is correct
7 Correct 5 ms 52808 KB Output is correct
8 Correct 6 ms 52752 KB Output is correct
9 Correct 6 ms 52824 KB Output is correct
10 Correct 6 ms 52828 KB Output is correct
11 Correct 7 ms 52828 KB Output is correct
12 Correct 5 ms 52828 KB Output is correct
13 Correct 6 ms 52828 KB Output is correct
14 Correct 5 ms 52828 KB Output is correct
15 Correct 6 ms 52828 KB Output is correct
16 Correct 6 ms 52736 KB Output is correct
17 Correct 6 ms 52828 KB Output is correct
18 Correct 6 ms 52828 KB Output is correct
19 Correct 6 ms 52572 KB Output is correct
20 Correct 6 ms 52828 KB Output is correct
21 Correct 7 ms 52828 KB Output is correct
22 Correct 8 ms 53052 KB Output is correct
23 Correct 7 ms 52828 KB Output is correct
24 Correct 8 ms 52828 KB Output is correct
25 Correct 7 ms 52828 KB Output is correct
26 Correct 7 ms 52828 KB Output is correct
27 Correct 6 ms 52828 KB Output is correct
28 Correct 7 ms 52828 KB Output is correct
29 Correct 7 ms 53060 KB Output is correct
30 Correct 7 ms 52828 KB Output is correct
31 Correct 8 ms 52828 KB Output is correct
32 Correct 7 ms 52828 KB Output is correct
33 Correct 7 ms 53040 KB Output is correct
34 Correct 7 ms 52828 KB Output is correct
35 Correct 7 ms 53048 KB Output is correct
36 Correct 7 ms 52828 KB Output is correct
37 Correct 6 ms 52828 KB Output is correct
38 Correct 7 ms 52828 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 52828 KB Output is correct
2 Correct 6 ms 52664 KB Output is correct
3 Correct 6 ms 52824 KB Output is correct
4 Correct 6 ms 52796 KB Output is correct
5 Correct 6 ms 52828 KB Output is correct
6 Correct 6 ms 52824 KB Output is correct
7 Correct 5 ms 52808 KB Output is correct
8 Correct 6 ms 52752 KB Output is correct
9 Correct 6 ms 52824 KB Output is correct
10 Correct 6 ms 52828 KB Output is correct
11 Correct 7 ms 52828 KB Output is correct
12 Correct 5 ms 52828 KB Output is correct
13 Correct 6 ms 52828 KB Output is correct
14 Correct 5 ms 52828 KB Output is correct
15 Correct 6 ms 52828 KB Output is correct
16 Correct 6 ms 52736 KB Output is correct
17 Correct 6 ms 52828 KB Output is correct
18 Correct 6 ms 52828 KB Output is correct
19 Correct 211 ms 68816 KB Output is correct
20 Correct 208 ms 69836 KB Output is correct
21 Correct 188 ms 68812 KB Output is correct
22 Correct 196 ms 68900 KB Output is correct
23 Correct 196 ms 69600 KB Output is correct
24 Correct 138 ms 69064 KB Output is correct
25 Correct 159 ms 73680 KB Output is correct
26 Correct 116 ms 74960 KB Output is correct
27 Correct 2833 ms 85736 KB Output is correct
28 Correct 653 ms 116596 KB Output is correct
29 Correct 716 ms 115572 KB Output is correct
30 Correct 2833 ms 86756 KB Output is correct
31 Correct 2821 ms 86332 KB Output is correct
32 Execution timed out 3010 ms 85952 KB Time limit exceeded
33 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 52828 KB Output is correct
2 Correct 6 ms 52664 KB Output is correct
3 Correct 6 ms 52824 KB Output is correct
4 Correct 6 ms 52796 KB Output is correct
5 Correct 6 ms 52828 KB Output is correct
6 Correct 6 ms 52824 KB Output is correct
7 Correct 5 ms 52808 KB Output is correct
8 Correct 6 ms 52752 KB Output is correct
9 Correct 6 ms 52824 KB Output is correct
10 Correct 6 ms 52828 KB Output is correct
11 Correct 7 ms 52828 KB Output is correct
12 Correct 5 ms 52828 KB Output is correct
13 Correct 6 ms 52828 KB Output is correct
14 Correct 5 ms 52828 KB Output is correct
15 Correct 6 ms 52828 KB Output is correct
16 Correct 6 ms 52736 KB Output is correct
17 Correct 6 ms 52828 KB Output is correct
18 Correct 6 ms 52828 KB Output is correct
19 Correct 6 ms 52572 KB Output is correct
20 Correct 6 ms 52828 KB Output is correct
21 Correct 7 ms 52828 KB Output is correct
22 Correct 8 ms 53052 KB Output is correct
23 Correct 7 ms 52828 KB Output is correct
24 Correct 8 ms 52828 KB Output is correct
25 Correct 7 ms 52828 KB Output is correct
26 Correct 7 ms 52828 KB Output is correct
27 Correct 6 ms 52828 KB Output is correct
28 Correct 7 ms 52828 KB Output is correct
29 Correct 7 ms 53060 KB Output is correct
30 Correct 7 ms 52828 KB Output is correct
31 Correct 8 ms 52828 KB Output is correct
32 Correct 7 ms 52828 KB Output is correct
33 Correct 7 ms 53040 KB Output is correct
34 Correct 7 ms 52828 KB Output is correct
35 Correct 7 ms 53048 KB Output is correct
36 Correct 7 ms 52828 KB Output is correct
37 Correct 6 ms 52828 KB Output is correct
38 Correct 7 ms 52828 KB Output is correct
39 Correct 211 ms 68816 KB Output is correct
40 Correct 208 ms 69836 KB Output is correct
41 Correct 188 ms 68812 KB Output is correct
42 Correct 196 ms 68900 KB Output is correct
43 Correct 196 ms 69600 KB Output is correct
44 Correct 138 ms 69064 KB Output is correct
45 Correct 159 ms 73680 KB Output is correct
46 Correct 116 ms 74960 KB Output is correct
47 Correct 2833 ms 85736 KB Output is correct
48 Correct 653 ms 116596 KB Output is correct
49 Correct 716 ms 115572 KB Output is correct
50 Correct 2833 ms 86756 KB Output is correct
51 Correct 2821 ms 86332 KB Output is correct
52 Execution timed out 3010 ms 85952 KB Time limit exceeded
53 Halted 0 ms 0 KB -