oj.uz

Submission #1093353

# Submission time Handle Problem Language Result Execution time Memory
1093353 2024-09-26T17:14:11 Z Aviansh Race (IOI11_race) C++17
100 / 100
 1211 ms 70736 KB 
#include <bits/stdc++.h>
#include "race.h"

using namespace std;

int subSize(int st, vector<pair<int,int>>(&g)[], int sz[], int par, bool rem[]){
    sz[st]=1;
    for(pair<int,int> p : g[st]){
        int c = p.first;
        if(rem[c]||c==par) continue;
        sz[st]+=subSize(c,g,sz,st,rem);
    }
    return sz[st];
}

int findCentroid(int node, vector<pair<int,int>>(&g)[], int siz, bool rem[], int par, int sizes[]){
    for(pair<int,int> p : g[node]){
        int c = p.first;
        if(c==par||rem[c]) continue;
        if(sizes[c]*2>siz){
            return findCentroid(c,g,siz,rem,node,sizes);
        }
    }
    return node;
}

void findLens(int st, vector<pair<int,int>>(&g)[], bool rem[], int par, map<int,int>(&mp), int dep, int len){
    for(pair<int,int> p : g[st]){
        int c = p.first;
        int d = p.second;
        if(c==par||rem[c]) continue;
        if(mp[dep+d]==0){
            mp[dep+d]=len+1;
        }
        else{
            mp[dep+d]=min(mp[dep+d],len+1);
        }
        findLens(c,g,rem,st,mp,dep+d,len+1);
    }
}

int buildDecomp(int node, vector<pair<int,int>>(&g)[], bool rem[], int sz[], int k){
    int centroid = findCentroid(node,g,subSize(node,g,sz,-1,rem),rem,-1,sz);
    int ans = 2e9;
    map<int,int>mp;
    rem[centroid]=1;
    for(pair<int,int> p : g[centroid]){
        int c = p.first;
        if(rem[c]) continue;
        map<int,int>temp;
        temp[p.second]=1;
        findLens(c,g,rem,centroid,temp,p.second,1);
        for(pair<int,int>pa : temp){
            if(mp[k-pa.first]){
                ans=min(ans,mp[k-pa.first]+pa.second);
            }
        }
        for(pair<int,int>pa:temp){
            if(mp[pa.first]){
                mp[pa.first]=min(mp[pa.first],pa.second);
            }
            else{
                mp[pa.first]=pa.second;
            }
        }
    }
    if(mp[k]){
        ans=min(ans,mp[k]);
    }
    for(pair<int,int>p:g[centroid]){
        int c = p.first;
        if(rem[c])continue;
        ans=min(ans,buildDecomp(c,g,rem,sz,k));
    }
    return ans;
}

int best_path(int n, int k, int e[][2], int w[])
{
    vector<pair<int,int>>g[n];
    for(int i = 0;i<n-1;i++){
        g[e[i][0]].push_back({e[i][1],w[i]});
        g[e[i][1]].push_back({e[i][0],w[i]});
    }
    bool rem[n];
    int sz[n];
    fill(rem,rem+n,0);
    int ans = buildDecomp(0,g,rem,sz,k);
    if(ans==2e9){
        return -1;
    }
    else{
        return ans;
    }
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 352 KB Output is correct
3 Correct 0 ms 352 KB Output is correct
4 Correct 0 ms 352 KB Output is correct
5 Correct 1 ms 352 KB Output is correct
6 Correct 0 ms 448 KB Output is correct
7 Correct 0 ms 352 KB Output is correct
8 Correct 0 ms 352 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 352 KB Output is correct
17 Correct 0 ms 444 KB Output is correct
18 Correct 1 ms 352 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 352 KB Output is correct
3 Correct 0 ms 352 KB Output is correct
4 Correct 0 ms 352 KB Output is correct
5 Correct 1 ms 352 KB Output is correct
6 Correct 0 ms 448 KB Output is correct
7 Correct 0 ms 352 KB Output is correct
8 Correct 0 ms 352 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 352 KB Output is correct
17 Correct 0 ms 444 KB Output is correct
18 Correct 1 ms 352 KB Output is correct
19 Correct 0 ms 356 KB Output is correct
20 Correct 0 ms 360 KB Output is correct
21 Correct 2 ms 616 KB Output is correct
22 Correct 2 ms 616 KB Output is correct
23 Correct 3 ms 616 KB Output is correct
24 Correct 2 ms 616 KB Output is correct
25 Correct 3 ms 616 KB Output is correct
26 Correct 2 ms 616 KB Output is correct
27 Correct 1 ms 360 KB Output is correct
28 Correct 2 ms 616 KB Output is correct
29 Correct 2 ms 616 KB Output is correct
30 Correct 2 ms 616 KB Output is correct
31 Correct 2 ms 616 KB Output is correct
32 Correct 2 ms 616 KB Output is correct
33 Correct 3 ms 616 KB Output is correct
34 Correct 2 ms 728 KB Output is correct
35 Correct 2 ms 724 KB Output is correct
36 Correct 2 ms 616 KB Output is correct
37 Correct 2 ms 616 KB Output is correct
38 Correct 2 ms 616 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 352 KB Output is correct
3 Correct 0 ms 352 KB Output is correct
4 Correct 0 ms 352 KB Output is correct
5 Correct 1 ms 352 KB Output is correct
6 Correct 0 ms 448 KB Output is correct
7 Correct 0 ms 352 KB Output is correct
8 Correct 0 ms 352 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 352 KB Output is correct
17 Correct 0 ms 444 KB Output is correct
18 Correct 1 ms 352 KB Output is correct
19 Correct 192 ms 9608 KB Output is correct
20 Correct 198 ms 9480 KB Output is correct
21 Correct 189 ms 9568 KB Output is correct
22 Correct 161 ms 9568 KB Output is correct
23 Correct 340 ms 10320 KB Output is correct
24 Correct 138 ms 9808 KB Output is correct
25 Correct 151 ms 17744 KB Output is correct
26 Correct 71 ms 16720 KB Output is correct
27 Correct 294 ms 19272 KB Output is correct
28 Correct 1182 ms 70480 KB Output is correct
29 Correct 1207 ms 70736 KB Output is correct
30 Correct 293 ms 19284 KB Output is correct
31 Correct 296 ms 19384 KB Output is correct
32 Correct 324 ms 19280 KB Output is correct
33 Correct 497 ms 18680 KB Output is correct
34 Correct 1048 ms 51536 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 352 KB Output is correct
3 Correct 0 ms 352 KB Output is correct
4 Correct 0 ms 352 KB Output is correct
5 Correct 1 ms 352 KB Output is correct
6 Correct 0 ms 448 KB Output is correct
7 Correct 0 ms 352 KB Output is correct
8 Correct 0 ms 352 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 352 KB Output is correct
17 Correct 0 ms 444 KB Output is correct
18 Correct 1 ms 352 KB Output is correct
19 Correct 0 ms 356 KB Output is correct
20 Correct 0 ms 360 KB Output is correct
21 Correct 2 ms 616 KB Output is correct
22 Correct 2 ms 616 KB Output is correct
23 Correct 3 ms 616 KB Output is correct
24 Correct 2 ms 616 KB Output is correct
25 Correct 3 ms 616 KB Output is correct
26 Correct 2 ms 616 KB Output is correct
27 Correct 1 ms 360 KB Output is correct
28 Correct 2 ms 616 KB Output is correct
29 Correct 2 ms 616 KB Output is correct
30 Correct 2 ms 616 KB Output is correct
31 Correct 2 ms 616 KB Output is correct
32 Correct 2 ms 616 KB Output is correct
33 Correct 3 ms 616 KB Output is correct
34 Correct 2 ms 728 KB Output is correct
35 Correct 2 ms 724 KB Output is correct
36 Correct 2 ms 616 KB Output is correct
37 Correct 2 ms 616 KB Output is correct
38 Correct 2 ms 616 KB Output is correct
39 Correct 192 ms 9608 KB Output is correct
40 Correct 198 ms 9480 KB Output is correct
41 Correct 189 ms 9568 KB Output is correct
42 Correct 161 ms 9568 KB Output is correct
43 Correct 340 ms 10320 KB Output is correct
44 Correct 138 ms 9808 KB Output is correct
45 Correct 151 ms 17744 KB Output is correct
46 Correct 71 ms 16720 KB Output is correct
47 Correct 294 ms 19272 KB Output is correct
48 Correct 1182 ms 70480 KB Output is correct
49 Correct 1207 ms 70736 KB Output is correct
50 Correct 293 ms 19284 KB Output is correct
51 Correct 296 ms 19384 KB Output is correct
52 Correct 324 ms 19280 KB Output is correct
53 Correct 497 ms 18680 KB Output is correct
54 Correct 1048 ms 51536 KB Output is correct
55 Correct 25 ms 2140 KB Output is correct
56 Correct 12 ms 1116 KB Output is correct
57 Correct 108 ms 9700 KB Output is correct
58 Correct 33 ms 9420 KB Output is correct
59 Correct 432 ms 30288 KB Output is correct
60 Correct 1153 ms 66820 KB Output is correct
61 Correct 363 ms 21832 KB Output is correct
62 Correct 297 ms 19308 KB Output is correct
63 Correct 332 ms 19240 KB Output is correct
64 Correct 1061 ms 41300 KB Output is correct
65 Correct 934 ms 52304 KB Output is correct
66 Correct 1211 ms 70736 KB Output is correct
67 Correct 88 ms 19652 KB Output is correct
68 Correct 505 ms 43284 KB Output is correct
69 Correct 510 ms 44152 KB Output is correct
70 Correct 469 ms 41372 KB Output is correct