oj.uz

Submission #970020

# Submission time Handle Problem Language Result Execution time Memory
970020 2024-04-26T06:36:16 Z lurhx Race (IOI11_race) C++17
21 / 100
 3000 ms 20560 KB 
#include "race.h"

#include <bits/stdc++.h>
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 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,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) {
    //find centroid;
    dp.clear();
    get_size(node);
    ll centroid = get_centroid(node);
    centroids[centroid] = true;
    for(auto i: edges[centroid]) {
        dp.emplace_back();
        dfs(i.f,i.s,1);
    }
    ll ans = inf;
    for(int i = 0; i<dp.size(); i++) {
        if(dp[i].find(k)!=dp.back().end())
            ans = min(ans,dp[i][k]);
        for(int j = i+1; j<dp.size(); j++) {
            for(auto q: dp[i]) {
                if(dp[j].find(k-q.f)!=dp[j].end())
                    ans = min(ans,q.s+dp[j][k-q.f]);
            }
        }
    }
    for(auto i: edges[centroid]) {
        if(!centroids[i.f])
            ans = min(ans,solve(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);
    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 << _;
}*/

Compilation message

race.cpp: In function 'long long int solve(long long int)':
race.cpp:52:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::unordered_map<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |     for(int i = 0; i<dp.size(); i++) {
      |                    ~^~~~~~~~~~
race.cpp:55:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::unordered_map<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |         for(int j = i+1; j<dp.size(); j++) {
      |                          ~^~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 2 ms 2548 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 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 2396 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 2488 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 2 ms 2548 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 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 2396 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 2488 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 1 ms 2392 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 2492 KB Output is correct
22 Correct 4 ms 2644 KB Output is correct
23 Correct 4 ms 2652 KB Output is correct
24 Correct 3 ms 2652 KB Output is correct
25 Correct 3 ms 2652 KB Output is correct
26 Correct 3 ms 2652 KB Output is correct
27 Correct 2 ms 2396 KB Output is correct
28 Correct 3 ms 2396 KB Output is correct
29 Correct 3 ms 2652 KB Output is correct
30 Correct 4 ms 2648 KB Output is correct
31 Correct 3 ms 2392 KB Output is correct
32 Correct 3 ms 2592 KB Output is correct
33 Correct 3 ms 2652 KB Output is correct
34 Correct 7 ms 2652 KB Output is correct
35 Correct 8 ms 2652 KB Output is correct
36 Correct 11 ms 2648 KB Output is correct
37 Correct 9 ms 2652 KB Output is correct
38 Correct 5 ms 2652 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 2 ms 2548 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 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 2396 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 2488 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 316 ms 15464 KB Output is correct
20 Correct 303 ms 16404 KB Output is correct
21 Correct 243 ms 16072 KB Output is correct
22 Correct 220 ms 16980 KB Output is correct
23 Correct 184 ms 16976 KB Output is correct
24 Correct 212 ms 16160 KB Output is correct
25 Execution timed out 3038 ms 20560 KB Time limit exceeded
26 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 2 ms 2548 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 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 2396 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 2488 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 1 ms 2392 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 2492 KB Output is correct
22 Correct 4 ms 2644 KB Output is correct
23 Correct 4 ms 2652 KB Output is correct
24 Correct 3 ms 2652 KB Output is correct
25 Correct 3 ms 2652 KB Output is correct
26 Correct 3 ms 2652 KB Output is correct
27 Correct 2 ms 2396 KB Output is correct
28 Correct 3 ms 2396 KB Output is correct
29 Correct 3 ms 2652 KB Output is correct
30 Correct 4 ms 2648 KB Output is correct
31 Correct 3 ms 2392 KB Output is correct
32 Correct 3 ms 2592 KB Output is correct
33 Correct 3 ms 2652 KB Output is correct
34 Correct 7 ms 2652 KB Output is correct
35 Correct 8 ms 2652 KB Output is correct
36 Correct 11 ms 2648 KB Output is correct
37 Correct 9 ms 2652 KB Output is correct
38 Correct 5 ms 2652 KB Output is correct
39 Correct 316 ms 15464 KB Output is correct
40 Correct 303 ms 16404 KB Output is correct
41 Correct 243 ms 16072 KB Output is correct
42 Correct 220 ms 16980 KB Output is correct
43 Correct 184 ms 16976 KB Output is correct
44 Correct 212 ms 16160 KB Output is correct
45 Execution timed out 3038 ms 20560 KB Time limit exceeded
46 Halted 0 ms 0 KB -