oj.uz

Submission #1093351

# Submission time Handle Problem Language Result Execution time Memory
1093351 2024-09-26T17:08:58 Z Aviansh Race (IOI11_race) C++17
21 / 100
 3000 ms 9040 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,-1,temp,p.second,0);
        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);
    int ans = 2e9;
    for(int i = 0;i<n;i++){
        map<int,int>mp;
        findLens(i,g,rem,-1,mp,0,0);
        if(mp[k]){
            ans=min(ans,mp[k]);
        }
    }
    if(ans==2e9){
        return -1;
    }
    else{
        return ans;
    }
}

Compilation message

race.cpp: In function 'int best_path(int, int, int (*)[2], int*)':
race.cpp:86:9: warning: unused variable 'sz' [-Wunused-variable]
   86 |     int sz[n];
      |         ^~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 1 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 1 ms 352 KB Output is correct
7 Correct 1 ms 352 KB Output is correct
8 Correct 1 ms 352 KB Output is correct
9 Correct 1 ms 352 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 352 KB Output is correct
17 Correct 1 ms 352 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 1 ms 352 KB Output is correct
3 Correct 1 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 1 ms 352 KB Output is correct
7 Correct 1 ms 352 KB Output is correct
8 Correct 1 ms 352 KB Output is correct
9 Correct 1 ms 352 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 352 KB Output is correct
17 Correct 1 ms 352 KB Output is correct
18 Correct 1 ms 352 KB Output is correct
19 Correct 0 ms 356 KB Output is correct
20 Correct 1 ms 360 KB Output is correct
21 Correct 112 ms 540 KB Output is correct
22 Correct 145 ms 468 KB Output is correct
23 Correct 147 ms 576 KB Output is correct
24 Correct 144 ms 360 KB Output is correct
25 Correct 146 ms 360 KB Output is correct
26 Correct 148 ms 572 KB Output is correct
27 Correct 24 ms 360 KB Output is correct
28 Correct 144 ms 344 KB Output is correct
29 Correct 141 ms 348 KB Output is correct
30 Correct 145 ms 348 KB Output is correct
31 Correct 143 ms 348 KB Output is correct
32 Correct 145 ms 348 KB Output is correct
33 Correct 149 ms 560 KB Output is correct
34 Correct 102 ms 856 KB Output is correct
35 Correct 91 ms 604 KB Output is correct
36 Correct 69 ms 600 KB Output is correct
37 Correct 74 ms 600 KB Output is correct
38 Correct 109 ms 348 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 1 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 1 ms 352 KB Output is correct
7 Correct 1 ms 352 KB Output is correct
8 Correct 1 ms 352 KB Output is correct
9 Correct 1 ms 352 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 352 KB Output is correct
17 Correct 1 ms 352 KB Output is correct
18 Correct 1 ms 352 KB Output is correct
19 Execution timed out 3010 ms 9040 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 1 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 1 ms 352 KB Output is correct
7 Correct 1 ms 352 KB Output is correct
8 Correct 1 ms 352 KB Output is correct
9 Correct 1 ms 352 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 352 KB Output is correct
17 Correct 1 ms 352 KB Output is correct
18 Correct 1 ms 352 KB Output is correct
19 Correct 0 ms 356 KB Output is correct
20 Correct 1 ms 360 KB Output is correct
21 Correct 112 ms 540 KB Output is correct
22 Correct 145 ms 468 KB Output is correct
23 Correct 147 ms 576 KB Output is correct
24 Correct 144 ms 360 KB Output is correct
25 Correct 146 ms 360 KB Output is correct
26 Correct 148 ms 572 KB Output is correct
27 Correct 24 ms 360 KB Output is correct
28 Correct 144 ms 344 KB Output is correct
29 Correct 141 ms 348 KB Output is correct
30 Correct 145 ms 348 KB Output is correct
31 Correct 143 ms 348 KB Output is correct
32 Correct 145 ms 348 KB Output is correct
33 Correct 149 ms 560 KB Output is correct
34 Correct 102 ms 856 KB Output is correct
35 Correct 91 ms 604 KB Output is correct
36 Correct 69 ms 600 KB Output is correct
37 Correct 74 ms 600 KB Output is correct
38 Correct 109 ms 348 KB Output is correct
39 Execution timed out 3010 ms 9040 KB Time limit exceeded
40 Halted 0 ms 0 KB -