oj.uz

Submission #970031

# Submission time Handle Problem Language Result Execution time Memory
970031 2024-04-26T07:03:52 Z lurhx Race (IOI11_race) C++17
43 / 100
 3000 ms 58228 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;
}
struct chash {
    // any random-ish large odd number will do
    const uint64_t C = uint64_t(2e18 * M_PI) + 71;
    // random 32-bit number
    const uint32_t RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    size_t operator()(uint64_t x) const {
        // see https://gcc.gnu.org/onlinedocs/gcc/Other-Builtins.html
        return __builtin_bswap64((x ^ RANDOM) * C);
    }
};
vector<gp_hash_table<ll,ll,chash>>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;
    for(int i = 0; i<dp.size(); i++) {
        if(dp[i].find(k)!=dp[i].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]);
            }
        }
    }
    //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 << _;
}*/

Compilation message

race.cpp: In function 'long long int solve(long long int, int)':
race.cpp:66:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<__gnu_pbds::gp_hash_table<long long int, long long int, chash> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |     for(int i = 0; i<dp.size(); i++) {
      |                    ~^~~~~~~~~~
race.cpp:69:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<__gnu_pbds::gp_hash_table<long long int, long long int, chash> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |         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 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 2 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 2 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 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2648 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 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 2 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 2 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 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2648 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 2652 KB Output is correct
22 Correct 2 ms 2652 KB Output is correct
23 Correct 2 ms 2652 KB Output is correct
24 Correct 2 ms 2652 KB Output is correct
25 Correct 2 ms 2652 KB Output is correct
26 Correct 3 ms 2652 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 3 ms 2652 KB Output is correct
29 Correct 2 ms 2652 KB Output is correct
30 Correct 3 ms 2652 KB Output is correct
31 Correct 2 ms 2652 KB Output is correct
32 Correct 2 ms 2648 KB Output is correct
33 Correct 2 ms 2652 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 2724 KB Output is correct
37 Correct 2 ms 2652 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 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 2 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 2 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 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2648 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 139 ms 15184 KB Output is correct
20 Correct 137 ms 15144 KB Output is correct
21 Correct 126 ms 15392 KB Output is correct
22 Correct 120 ms 15704 KB Output is correct
23 Correct 129 ms 15796 KB Output is correct
24 Correct 87 ms 15060 KB Output is correct
25 Correct 118 ms 19752 KB Output is correct
26 Correct 100 ms 21072 KB Output is correct
27 Correct 818 ms 37968 KB Output is correct
28 Correct 486 ms 55980 KB Output is correct
29 Correct 467 ms 54900 KB Output is correct
30 Correct 818 ms 37832 KB Output is correct
31 Correct 837 ms 37964 KB Output is correct
32 Correct 811 ms 37844 KB Output is correct
33 Correct 276 ms 25832 KB Output is correct
34 Correct 401 ms 49676 KB Output is correct

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 2 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 2 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 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2648 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 2652 KB Output is correct
22 Correct 2 ms 2652 KB Output is correct
23 Correct 2 ms 2652 KB Output is correct
24 Correct 2 ms 2652 KB Output is correct
25 Correct 2 ms 2652 KB Output is correct
26 Correct 3 ms 2652 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 3 ms 2652 KB Output is correct
29 Correct 2 ms 2652 KB Output is correct
30 Correct 3 ms 2652 KB Output is correct
31 Correct 2 ms 2652 KB Output is correct
32 Correct 2 ms 2648 KB Output is correct
33 Correct 2 ms 2652 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 2724 KB Output is correct
37 Correct 2 ms 2652 KB Output is correct
38 Correct 2 ms 2652 KB Output is correct
39 Correct 139 ms 15184 KB Output is correct
40 Correct 137 ms 15144 KB Output is correct
41 Correct 126 ms 15392 KB Output is correct
42 Correct 120 ms 15704 KB Output is correct
43 Correct 129 ms 15796 KB Output is correct
44 Correct 87 ms 15060 KB Output is correct
45 Correct 118 ms 19752 KB Output is correct
46 Correct 100 ms 21072 KB Output is correct
47 Correct 818 ms 37968 KB Output is correct
48 Correct 486 ms 55980 KB Output is correct
49 Correct 467 ms 54900 KB Output is correct
50 Correct 818 ms 37832 KB Output is correct
51 Correct 837 ms 37964 KB Output is correct
52 Correct 811 ms 37844 KB Output is correct
53 Correct 276 ms 25832 KB Output is correct
54 Correct 401 ms 49676 KB Output is correct
55 Correct 17 ms 4500 KB Output is correct
56 Correct 10 ms 3420 KB Output is correct
57 Correct 88 ms 15676 KB Output is correct
58 Execution timed out 3034 ms 58228 KB Time limit exceeded
59 Halted 0 ms 0 KB -