oj.uz

답안 #1093652

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1093652 2024-09-27T07:38:42 Z Aviansh 경주 (Race) (IOI11_race) C++17
21 / 100
 1771 ms 262144 KB 
#include <bits/stdc++.h>
#include "race.h"

using namespace std;

int subSize(int st, vector<pair<int,int>>(&g)[], int sz[], int par, bitset<200010> 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, bitset<200010> 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)[], bitset<200010> rem, int par, unordered_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)[], bitset<200010> rem, int sz[], int k){
    int centroid = findCentroid(node,g,subSize(node,g,sz,-1,rem),rem,-1,sz);
    int ans = 2e9;
    unordered_map<int,int>mp;
    rem[centroid]=1;
    for(pair<int,int> p : g[centroid]){
        int c = p.first;
        if(rem[c]) continue;
        unordered_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);
            }
            else{
                mp.erase(k-pa.first);
            }
        }
        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]);
    }
    else{
        mp.erase(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]});
    }
    bitset<200010> rem;
    int sz[n];
    int ans = buildDecomp(0,g,rem,sz,k);
    if(ans==2e9){
        return -1;
    }
    else{
        return ans;
    }
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2908 KB Output is correct
2 Correct 2 ms 2908 KB Output is correct
3 Correct 2 ms 2908 KB Output is correct
4 Correct 2 ms 2908 KB Output is correct
5 Correct 3 ms 2908 KB Output is correct
6 Correct 2 ms 2908 KB Output is correct
7 Correct 2 ms 2908 KB Output is correct
8 Correct 2 ms 2908 KB Output is correct
9 Correct 2 ms 2728 KB Output is correct
10 Correct 2 ms 2904 KB Output is correct
11 Correct 2 ms 2904 KB Output is correct
12 Correct 2 ms 2908 KB Output is correct
13 Correct 3 ms 2952 KB Output is correct
14 Correct 2 ms 2908 KB Output is correct
15 Correct 2 ms 2908 KB Output is correct
16 Correct 2 ms 2908 KB Output is correct
17 Correct 2 ms 2908 KB Output is correct
18 Correct 2 ms 2908 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2908 KB Output is correct
2 Correct 2 ms 2908 KB Output is correct
3 Correct 2 ms 2908 KB Output is correct
4 Correct 2 ms 2908 KB Output is correct
5 Correct 3 ms 2908 KB Output is correct
6 Correct 2 ms 2908 KB Output is correct
7 Correct 2 ms 2908 KB Output is correct
8 Correct 2 ms 2908 KB Output is correct
9 Correct 2 ms 2728 KB Output is correct
10 Correct 2 ms 2904 KB Output is correct
11 Correct 2 ms 2904 KB Output is correct
12 Correct 2 ms 2908 KB Output is correct
13 Correct 3 ms 2952 KB Output is correct
14 Correct 2 ms 2908 KB Output is correct
15 Correct 2 ms 2908 KB Output is correct
16 Correct 2 ms 2908 KB Output is correct
17 Correct 2 ms 2908 KB Output is correct
18 Correct 2 ms 2908 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 8 ms 1116 KB Output is correct
22 Correct 10 ms 1216 KB Output is correct
23 Correct 10 ms 1628 KB Output is correct
24 Correct 9 ms 1116 KB Output is correct
25 Correct 8 ms 860 KB Output is correct
26 Correct 8 ms 860 KB Output is correct
27 Correct 8 ms 860 KB Output is correct
28 Correct 9 ms 1116 KB Output is correct
29 Correct 8 ms 1056 KB Output is correct
30 Correct 9 ms 1116 KB Output is correct
31 Correct 8 ms 860 KB Output is correct
32 Correct 10 ms 1116 KB Output is correct
33 Correct 10 ms 1372 KB Output is correct
34 Correct 13 ms 6648 KB Output is correct
35 Correct 14 ms 8536 KB Output is correct
36 Correct 14 ms 10844 KB Output is correct
37 Correct 12 ms 6640 KB Output is correct
38 Correct 12 ms 4040 KB Output is correct

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2908 KB Output is correct
2 Correct 2 ms 2908 KB Output is correct
3 Correct 2 ms 2908 KB Output is correct
4 Correct 2 ms 2908 KB Output is correct
5 Correct 3 ms 2908 KB Output is correct
6 Correct 2 ms 2908 KB Output is correct
7 Correct 2 ms 2908 KB Output is correct
8 Correct 2 ms 2908 KB Output is correct
9 Correct 2 ms 2728 KB Output is correct
10 Correct 2 ms 2904 KB Output is correct
11 Correct 2 ms 2904 KB Output is correct
12 Correct 2 ms 2908 KB Output is correct
13 Correct 3 ms 2952 KB Output is correct
14 Correct 2 ms 2908 KB Output is correct
15 Correct 2 ms 2908 KB Output is correct
16 Correct 2 ms 2908 KB Output is correct
17 Correct 2 ms 2908 KB Output is correct
18 Correct 2 ms 2908 KB Output is correct
19 Correct 1348 ms 9452 KB Output is correct
20 Correct 1328 ms 9300 KB Output is correct
21 Correct 1314 ms 9560 KB Output is correct
22 Correct 1136 ms 10016 KB Output is correct
23 Correct 1771 ms 10320 KB Output is correct
24 Correct 838 ms 9528 KB Output is correct
25 Runtime error 138 ms 262144 KB Execution killed with signal 9
26 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2908 KB Output is correct
2 Correct 2 ms 2908 KB Output is correct
3 Correct 2 ms 2908 KB Output is correct
4 Correct 2 ms 2908 KB Output is correct
5 Correct 3 ms 2908 KB Output is correct
6 Correct 2 ms 2908 KB Output is correct
7 Correct 2 ms 2908 KB Output is correct
8 Correct 2 ms 2908 KB Output is correct
9 Correct 2 ms 2728 KB Output is correct
10 Correct 2 ms 2904 KB Output is correct
11 Correct 2 ms 2904 KB Output is correct
12 Correct 2 ms 2908 KB Output is correct
13 Correct 3 ms 2952 KB Output is correct
14 Correct 2 ms 2908 KB Output is correct
15 Correct 2 ms 2908 KB Output is correct
16 Correct 2 ms 2908 KB Output is correct
17 Correct 2 ms 2908 KB Output is correct
18 Correct 2 ms 2908 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 8 ms 1116 KB Output is correct
22 Correct 10 ms 1216 KB Output is correct
23 Correct 10 ms 1628 KB Output is correct
24 Correct 9 ms 1116 KB Output is correct
25 Correct 8 ms 860 KB Output is correct
26 Correct 8 ms 860 KB Output is correct
27 Correct 8 ms 860 KB Output is correct
28 Correct 9 ms 1116 KB Output is correct
29 Correct 8 ms 1056 KB Output is correct
30 Correct 9 ms 1116 KB Output is correct
31 Correct 8 ms 860 KB Output is correct
32 Correct 10 ms 1116 KB Output is correct
33 Correct 10 ms 1372 KB Output is correct
34 Correct 13 ms 6648 KB Output is correct
35 Correct 14 ms 8536 KB Output is correct
36 Correct 14 ms 10844 KB Output is correct
37 Correct 12 ms 6640 KB Output is correct
38 Correct 12 ms 4040 KB Output is correct
39 Correct 1348 ms 9452 KB Output is correct
40 Correct 1328 ms 9300 KB Output is correct
41 Correct 1314 ms 9560 KB Output is correct
42 Correct 1136 ms 10016 KB Output is correct
43 Correct 1771 ms 10320 KB Output is correct
44 Correct 838 ms 9528 KB Output is correct
45 Runtime error 138 ms 262144 KB Execution killed with signal 9
46 Halted 0 ms 0 KB -