oj.uz

Submission #218620

# Submission time Handle Problem Language Result Execution time Memory
218620 2020-04-02T11:55:54 Z toxic_hack Museum (CEOI17_museum) C++14
100 / 100
 775 ms 784696 KB 
// g++ -std=c++14

/*

Today might be the chance to grasp the chance to let your talent bloom.
May be tomorrow, the day after, or next year...
May be even when you are 30. I'm not sure if physique has anything to do with it
but if you think that it will never come, it probably never will.

- Tooru Oikawa.

*/


#include<bits/stdc++.h>

typedef long long ll;
typedef long double lld;
using namespace std;

#define endl "\n"
#define fi first
#define se second
#define MEMS(a,b) memset(a,b,sizeof(a))
#define _ ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define __ freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define all(c) c.begin(),c.end()
#define pii pair<int, int>

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r)
{
	uniform_int_distribution<int> uid(l, r);
	return uid(rng);
}

#define tr(...) cout<<__FUNCTION__<<' '<<__LINE__<<" = ";trace(#__VA_ARGS__, __VA_ARGS__)
template<typename S, typename T>
ostream& operator<<(ostream& out,pair<S,T> const& p){out<<'('<<p.fi<<", "<<p.se<<')';return out;}

template<typename T>
ostream& operator<<(ostream& out,vector<T> const& v){
ll l=v.size();for(ll i=0;i<l-1;i++)out<<v[i]<<' ';if(l>0)out<<v[l-1];return out;}

template <typename T>
ostream &operator<<(ostream &out, set<T> const &v) {
    for (auto i = v.begin(); i != v.end(); i++)
        out << (*i) << ' ';
    return out;
}
template <typename T>
ostream &operator<<(ostream &out, multiset<T> const &v) {
    for (auto i = v.begin(); i != v.end(); i++)
        out << (*i) << ' ';
    return out;
}
template <typename T, typename V>
ostream &operator<<(ostream &out, map<T, V> const &v) {
    for (auto i = v.begin(); i != v.end(); i++)
        out << "\n" << (i->first) <<  ":"  << (i->second);
    return out;
}

template<typename T>
void trace(const char* name, T&& arg1){cout<<name<<" : "<<arg1<<endl;}

template<typename T, typename... Args>
void trace(const char* names, T&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');cout.write(names, comma-names)<<" : "<<arg1<<" | ";trace(comma+1,args...);}

const int N = 1e4 + 2;
vector<vector<pii>> g(N);
int dp[2][N][N]; // 0-> for coming back, 1 -> staying
int n, k, x;
const int inf = 1e9 + 1;
int sub[N];

void dfs(int v, int p) {
    sub[v] = 1;
    dp[0][v][1] = 0;
    dp[1][v][1] = 0;
    for (auto u : g[v]) {
        if (u.fi == p) continue;
        dfs(u.fi, v);
        sub[v] += sub[u.fi];
    }
    int c = 1;
    // for (auto u : g[v]) {
    //     if (u.fi == p) continue;
    //     c += sub[u.fi];
    //     c = min(c, k);
    //     for (int j = c; j > 1; j--) {
    //         for (int i = 0; i <= min(sub[u.fi], k) && j - i >= 0; i++) {
    //             dp[1][v][j] = min(dp[1][v][j], dp[1][u.fi][i] + dp[0][v][j - i] + u.se);
    //             dp[1][v][j] = min(dp[1][v][j], dp[0][u.fi][i] + dp[1][v][j - i] + (u.se) * 2);
                
    //             dp[0][v][j] = min(dp[0][v][j], dp[0][u.fi][i] + dp[0][v][j - i] + (u.se * 2));
    //         }
    //     }
    // }
    for (auto u : g[v]) {
        if (u.fi == p) continue;
        for (int j = c; j >= 1; j--) {
            for (int i = 0; i <= min(sub[u.fi], k) && j + i <= k; i++) {
                dp[1][v][j + i] = min(dp[1][v][j + i], dp[1][u.fi][i] + dp[0][v][j] + u.se);
                dp[1][v][j + i] = min(dp[1][v][j + i], dp[0][u.fi][i] + dp[1][v][j] + 2 * u.se);

                dp[0][v][j + i] = min(dp[0][v][j + i], dp[0][u.fi][i] + dp[0][v][j] + 2 * u.se);
            }
        }
        c += sub[u.fi];
    }
    dp[0][v][0] = dp[1][v][0] = 0;
    // tr(v);
    // for (int i = 1; i <= k; i++) {
    //     cout << dp[0][v][i] << " ";
    // }
    // cout << endl;
    // for (int i = 1; i <= k; i++) {
    //     cout << dp[1][v][i] << " ";
    // }
    // cout << endl;
}

int solve() {
    for (int i = 0; i < N; i++) 
        for (int j = 0; j < N; j++) 
            for (int k = 0; k < 2; k++) 
                dp[k][i][j] = inf;

    cin >> n >> k >> x;
    for (int i = 0; i < n - 1; i++) {
        int v, u, w;
        cin >> v >> u >> w;
        g[u].push_back({v, w});
        g[v].push_back({u, w});
    }
    dfs(x, 0);
    cout << dp[1][x][k] << endl;
    return 0;
}

int32_t main(){ _
    int t;
    // cin >> t;
    t = 1;
    while (t--) solve();
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 421 ms 783652 KB Output is correct
2 Correct 413 ms 783736 KB Output is correct
3 Correct 423 ms 783736 KB Output is correct
4 Correct 406 ms 783608 KB Output is correct
5 Correct 424 ms 783780 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 415 ms 784120 KB Output is correct
2 Correct 433 ms 784312 KB Output is correct
3 Correct 421 ms 784504 KB Output is correct
4 Correct 428 ms 784332 KB Output is correct
5 Correct 425 ms 784120 KB Output is correct

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 415 ms 784120 KB Output is correct
2 Correct 433 ms 784312 KB Output is correct
3 Correct 421 ms 784504 KB Output is correct
4 Correct 428 ms 784332 KB Output is correct
5 Correct 425 ms 784120 KB Output is correct
6 Correct 423 ms 784120 KB Output is correct
7 Correct 440 ms 784376 KB Output is correct
8 Correct 470 ms 784120 KB Output is correct
9 Correct 449 ms 784248 KB Output is correct
10 Correct 461 ms 784120 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 421 ms 783652 KB Output is correct
2 Correct 413 ms 783736 KB Output is correct
3 Correct 423 ms 783736 KB Output is correct
4 Correct 406 ms 783608 KB Output is correct
5 Correct 424 ms 783780 KB Output is correct
6 Correct 415 ms 784120 KB Output is correct
7 Correct 433 ms 784312 KB Output is correct
8 Correct 421 ms 784504 KB Output is correct
9 Correct 428 ms 784332 KB Output is correct
10 Correct 425 ms 784120 KB Output is correct
11 Correct 423 ms 784120 KB Output is correct
12 Correct 440 ms 784376 KB Output is correct
13 Correct 470 ms 784120 KB Output is correct
14 Correct 449 ms 784248 KB Output is correct
15 Correct 461 ms 784120 KB Output is correct
16 Correct 455 ms 784272 KB Output is correct
17 Correct 577 ms 784120 KB Output is correct
18 Correct 501 ms 784248 KB Output is correct
19 Correct 517 ms 784120 KB Output is correct
20 Correct 446 ms 784120 KB Output is correct
21 Correct 583 ms 784376 KB Output is correct
22 Correct 578 ms 784504 KB Output is correct
23 Correct 775 ms 784308 KB Output is correct
24 Correct 591 ms 784248 KB Output is correct
25 Correct 637 ms 784696 KB Output is correct