oj.uz

Submission #1106507

# Submission time Handle Problem Language Result Execution time Memory
1106507 2024-10-30T13:41:06 Z Neco_arc Museum (CEOI17_museum) C++17
20 / 100
 6 ms 2296 KB 
#include <bits/stdc++.h>

#define ll long long
#define ull unsigned long long
#define all(x) x.begin(), x.end()
#define Neco "migration"
#define resp(x) sort(all(x)), x.resize(unique(all(x)) - x.begin())
#define getbit(x,i) ((x >> i)&1)
#define _left id * 2, l, mid
#define _right id * 2 + 1, mid + 1, r
#define cntbit(x) __builtin_popcountll(x)
#define fi(i, a, b) for(int i = a; i <= b; i++)
#define fid(i, a, b) for(int i = a; i >= b; i--)
#define maxn (int) 5000 + 7

using namespace std;

const ll mod = 1e9 + 7; //972663749
const ll base = 911382323;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll GetRandom(ll l, ll r) {
    return uniform_int_distribution<ll> (l, r)(rng);
}

int n, k, rt;
vector<ll> dp[maxn][2];
vector<pair<int, int>> edges[maxn];

vector<ll> Min(vector<ll> &A, vector<ll> &B) {
    while(A.size() < B.size()) A.push_back(1e18);
    fi(i, 0, B.size() - 1) A[i] = min(A[i], B[i]);
    return A;
}

vector<ll> cb(const vector<ll> &A, const vector<ll> &B, ll w) {
    vector<ll> ans(A.size() + B.size() - 1, 1e18);
    fi(i, 0, A.size() - 1) fi(j, 0, B.size() - 1) {
        ans[i + j] = min(ans[i + j], A[i] + B[j] + (j > 0) * w);
    }
    return ans;
}

void dfs(int u, int par) {
    fi(i, 0, 1) dp[u][i] = {0, 0};

    for(auto [v, w] : edges[u]) if(v != par) {
        dfs(v, u);
        vector<ll> tmp1 = cb(dp[u][0], dp[v][1], w);
        vector<ll> tmp2 = cb(dp[u][1], dp[v][0], 2 * w);

        dp[u][1] = Min(tmp1, tmp2);
        dp[u][0] = cb(dp[u][0], dp[v][0], 2 * w);
    }

}

void solve()
{

    cin >> n >> k >> rt;
    fi(i, 1, n - 1) {
        int x, y, w; cin >> x >> y >> w;
        edges[x].push_back({y, w}), edges[y].push_back({x, w});
    }

    dfs(rt, 0);
//    fi(i, 1, n) cout << dp[1][1][i] << "\n";
    cout << dp[rt][1][k];
}


int main()
{

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    if(fopen(Neco".inp", "r")) {
        freopen(Neco".inp", "r", stdin);
        freopen(Neco".out", "w", stdout);
    }

    int nTest = 1;
//    cin >> nTest;

    while(nTest--)
    {
        solve();
    }


    return 0;
}

Compilation message

museum.cpp: In function 'std::vector<long long int> Min(std::vector<long long int>&, std::vector<long long int>&)':
museum.cpp:12:38: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 | #define fi(i, a, b) for(int i = a; i <= b; i++)
......
   32 |     fi(i, 0, B.size() - 1) A[i] = min(A[i], B[i]);
      |        ~~~~~~~~~~~~~~~~~~             
museum.cpp:32:5: note: in expansion of macro 'fi'
   32 |     fi(i, 0, B.size() - 1) A[i] = min(A[i], B[i]);
      |     ^~
museum.cpp: In function 'std::vector<long long int> cb(const std::vector<long long int>&, const std::vector<long long int>&, long long int)':
museum.cpp:12:38: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 | #define fi(i, a, b) for(int i = a; i <= b; i++)
......
   38 |     fi(i, 0, A.size() - 1) fi(j, 0, B.size() - 1) {
      |        ~~~~~~~~~~~~~~~~~~             
museum.cpp:38:5: note: in expansion of macro 'fi'
   38 |     fi(i, 0, A.size() - 1) fi(j, 0, B.size() - 1) {
      |     ^~
museum.cpp:12:38: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 | #define fi(i, a, b) for(int i = a; i <= b; i++)
......
   38 |     fi(i, 0, A.size() - 1) fi(j, 0, B.size() - 1) {
      |                               ~~~~~~~~~~~~~~~~~~
museum.cpp:38:28: note: in expansion of macro 'fi'
   38 |     fi(i, 0, A.size() - 1) fi(j, 0, B.size() - 1) {
      |                            ^~
museum.cpp: In function 'int main()':
museum.cpp:81:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   81 |         freopen(Neco".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
museum.cpp:82:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   82 |         freopen(Neco".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 1 ms 592 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Runtime error 6 ms 2296 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 35.0

# Verdict Execution time Memory Grader output
1 Runtime error 6 ms 2296 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 1 ms 592 KB Output is correct
6 Runtime error 6 ms 2296 KB Execution killed with signal 11
7 Halted 0 ms 0 KB -