oj.uz

Submission #970037

# Submission time Handle Problem Language Result Execution time Memory
970037 2024-04-26T07:13:18 Z lurhx Race (IOI11_race) C++17
100 / 100
 1002 ms 67680 KB 
#include "race.h"

#include <bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;*/
using namespace std;
#define ll long long
#define mp make_pair
#define f first
#define s second
const ll inf = 1e18;
vector<vector<pair<ll,ll>>> edges;
vector<bool> centroids;
vector<ll> sizes;
ll n,k;
ll get_size(ll node, ll parent = -1) {
    ll res = 1;
    for(auto i: edges[node]) {
        if(centroids[i.f] || i.f==parent)continue;
        res+=get_size(i.f,node);
    }
    return sizes[node]=res;
}
ll get_centroid(ll node,ll _n,ll parent = -1) {
    for(auto i: edges[node]) {
        if(centroids[i.f] || i.f == parent)continue;
        if(sizes[i.f]*2>_n)
            return get_centroid(i.f,_n,node);
    }
    return node;
}

vector<unordered_map<ll,ll>>dp;
void dfs(ll node,ll val,ll times,ll parent = -1) {
    if(dp.back().find(val)==dp.back().end())
        dp.back()[val] = times;
    else
        dp.back()[val] = min(dp.back()[val],times);
    for(auto i: edges[node]) {
        if(i.f==parent || centroids[i.f]) continue;
        dfs(i.f,val+i.s,times+1,node);
    }
}
ll solve(ll node,int _n) {
    //find centroid;
    dp.clear();
    get_size(node);
    ll centroid = get_centroid(node,_n);
    centroids[centroid] = true;
    for(auto i: edges[centroid]) {
        if(centroids[i.f])continue;
        dp.emplace_back();
        dfs(i.f,i.s,1);
    }
    ll ans = inf;
    unordered_map<ll,ll> another;
    for(auto i : dp) {
        for(auto q:i) {
            if(q.f==k)
                ans = min(ans,q.s);
            else {
                if(another.find(k-q.f)!=another.end())
                    ans = min(ans,another[k-q.f]+q.s);
            }
        }
        for(auto q: i) {
            if(another.find(q.f)==another.end())
                another[q.f] = q.s;
            else
                another[q.f] = min(another[q.f],q.s);
        }
    }
    //cout << dp.size() << endl;
    for(auto i: edges[centroid]) {
        if(!centroids[i.f])
            ans = min(ans,solve(i.f,sizes[i.f]));
    }
    return ans;
}

int best_path(int N, int K, int H[][2], int L[]){
    n = N;
    k = K;
    edges.resize(n);
    sizes.resize(n);
    centroids.resize(n);
    pair<ll,ll> in[n];
    ll len[n];
    for(int i = 0; i<n-1; i++) {
        in[i].f = H[i][0]; in[i].s = H[i][1]; len[i] = L[i];
        edges[in[i].f].emplace_back(in[i].s,len[i]);
        edges[in[i].s].emplace_back(in[i].f,len[i]);
    }
    ll _ = solve(0,n);
    if(_ == inf)
        _ =-1;
    return _;
}
/*
int main() {
    cin >> n >> k;
    edges.resize(n);
    sizes.resize(n);
    centroids.resize(n);
    pair<int,int> in[n];
    int len[n];
    for(int i = 0; i<n-1; i++) {
        cin >> in[i].f >> in[i].s >> len[i];
        edges[in[i].f].emplace_back(in[i].s,len[i]);
        edges[in[i].s].emplace_back(in[i].f,len[i]);
    }
    auto _ = solve(0);
    if(_ == inf)
        _ =-1;
    cout << _;
}*/

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2484 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2548 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2484 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2548 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 2 ms 2648 KB Output is correct
22 Correct 2 ms 2652 KB Output is correct
23 Correct 3 ms 2652 KB Output is correct
24 Correct 3 ms 2652 KB Output is correct
25 Correct 2 ms 2648 KB Output is correct
26 Correct 2 ms 2652 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 2 ms 2652 KB Output is correct
29 Correct 2 ms 2652 KB Output is correct
30 Correct 2 ms 2652 KB Output is correct
31 Correct 2 ms 2652 KB Output is correct
32 Correct 3 ms 2448 KB Output is correct
33 Correct 2 ms 2648 KB Output is correct
34 Correct 2 ms 2652 KB Output is correct
35 Correct 2 ms 2652 KB Output is correct
36 Correct 2 ms 2652 KB Output is correct
37 Correct 2 ms 2648 KB Output is correct
38 Correct 2 ms 2652 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2484 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2548 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 174 ms 15388 KB Output is correct
20 Correct 170 ms 15396 KB Output is correct
21 Correct 161 ms 15368 KB Output is correct
22 Correct 152 ms 15408 KB Output is correct
23 Correct 209 ms 15952 KB Output is correct
24 Correct 102 ms 15048 KB Output is correct
25 Correct 157 ms 19792 KB Output is correct
26 Correct 108 ms 21168 KB Output is correct
27 Correct 335 ms 30544 KB Output is correct
28 Correct 966 ms 60504 KB Output is correct
29 Correct 971 ms 59520 KB Output is correct
30 Correct 320 ms 30800 KB Output is correct
31 Correct 317 ms 30456 KB Output is correct
32 Correct 392 ms 30604 KB Output is correct
33 Correct 392 ms 25716 KB Output is correct
34 Correct 843 ms 45096 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2484 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2548 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 2 ms 2648 KB Output is correct
22 Correct 2 ms 2652 KB Output is correct
23 Correct 3 ms 2652 KB Output is correct
24 Correct 3 ms 2652 KB Output is correct
25 Correct 2 ms 2648 KB Output is correct
26 Correct 2 ms 2652 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 2 ms 2652 KB Output is correct
29 Correct 2 ms 2652 KB Output is correct
30 Correct 2 ms 2652 KB Output is correct
31 Correct 2 ms 2652 KB Output is correct
32 Correct 3 ms 2448 KB Output is correct
33 Correct 2 ms 2648 KB Output is correct
34 Correct 2 ms 2652 KB Output is correct
35 Correct 2 ms 2652 KB Output is correct
36 Correct 2 ms 2652 KB Output is correct
37 Correct 2 ms 2648 KB Output is correct
38 Correct 2 ms 2652 KB Output is correct
39 Correct 174 ms 15388 KB Output is correct
40 Correct 170 ms 15396 KB Output is correct
41 Correct 161 ms 15368 KB Output is correct
42 Correct 152 ms 15408 KB Output is correct
43 Correct 209 ms 15952 KB Output is correct
44 Correct 102 ms 15048 KB Output is correct
45 Correct 157 ms 19792 KB Output is correct
46 Correct 108 ms 21168 KB Output is correct
47 Correct 335 ms 30544 KB Output is correct
48 Correct 966 ms 60504 KB Output is correct
49 Correct 971 ms 59520 KB Output is correct
50 Correct 320 ms 30800 KB Output is correct
51 Correct 317 ms 30456 KB Output is correct
52 Correct 392 ms 30604 KB Output is correct
53 Correct 392 ms 25716 KB Output is correct
54 Correct 843 ms 45096 KB Output is correct
55 Correct 18 ms 4188 KB Output is correct
56 Correct 12 ms 3416 KB Output is correct
57 Correct 113 ms 15868 KB Output is correct
58 Correct 65 ms 34392 KB Output is correct
59 Correct 318 ms 31592 KB Output is correct
60 Correct 880 ms 61720 KB Output is correct
61 Correct 346 ms 34292 KB Output is correct
62 Correct 310 ms 32472 KB Output is correct
63 Correct 348 ms 32652 KB Output is correct
64 Correct 792 ms 39524 KB Output is correct
65 Correct 670 ms 48836 KB Output is correct
66 Correct 1002 ms 57468 KB Output is correct
67 Correct 173 ms 67680 KB Output is correct
68 Correct 423 ms 42284 KB Output is correct
69 Correct 474 ms 42952 KB Output is correct
70 Correct 375 ms 41100 KB Output is correct