oj.uz

Submission #941089

# Submission time Handle Problem Language Result Execution time Memory
941089 2024-03-08T06:44:17 Z GrindMachine Fireworks (APIO16_fireworks) C++17
19 / 100
 16 ms 2796 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 5e3 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
const int M = 305;

ll n,m;
vector<pll> adj[N];
ll dp[N][M];

void dfs1(ll u){
    if(adj[u].empty()){
        rep(i,M) dp[u][i] = inf2;
        dp[u][0] = 0;
        return;
    }

    for(auto [v,w] : adj[u]){
        dfs1(v);
    }

    rep(i,M){
        for(auto [v,w] : adj[u]){
            ll mn = inf2;
            rep(j,i+1){
                amin(mn,dp[v][j]+abs(j+w-i));
            }
            dp[u][i] += mn;
        }
    }
}

void solve(int test_case)
{
    cin >> n >> m;
    for(int i = 2; i <= n+m; ++i){
        ll p,w; cin >> p >> w;
        adj[p].pb({i,w});
    }

    dfs1(1);

    ll ans = inf2;
    rep(i,M) amin(ans,dp[1][i]);

    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 3 ms 604 KB Output is correct
3 Correct 3 ms 604 KB Output is correct
4 Correct 8 ms 2664 KB Output is correct
5 Correct 6 ms 2652 KB Output is correct
6 Correct 8 ms 2652 KB Output is correct
7 Correct 8 ms 2652 KB Output is correct
8 Correct 9 ms 2648 KB Output is correct
9 Correct 15 ms 2700 KB Output is correct
10 Correct 10 ms 2648 KB Output is correct
11 Correct 12 ms 2652 KB Output is correct
12 Correct 12 ms 2652 KB Output is correct
13 Correct 15 ms 2648 KB Output is correct
14 Correct 14 ms 2652 KB Output is correct
15 Correct 16 ms 2648 KB Output is correct
16 Correct 15 ms 2652 KB Output is correct
17 Correct 14 ms 2648 KB Output is correct
18 Correct 14 ms 2796 KB Output is correct
19 Correct 15 ms 2796 KB Output is correct

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -