oj.uz

답안 #966467

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
966467 2024-04-20T00:19:35 Z steveonalex Fireworks (APIO16_fireworks) C++17
19 / 100
 20 ms 1716 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define ALL(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
 
// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return ((ull) rng()) % (r - l + 1) + l;}
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return mask & (-mask);}
ll pop_cnt(ll mask){return __builtin_popcountll(mask);}
ll ctz(ll mask){return __builtin_ctzll(mask);}
ll clz(ll mask){return __builtin_clzll(mask);}
ll logOf(ll mask){return 63 - clz(mask);}
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b){a = b; return true;}
        return false;
    }
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b){a = b; return true;}
        return false;
    }
template <class T>
    void printArr(T& a, string separator = " ", string finish = "\n", ostream& out = cout){
        for(auto i: a) out << i << separator;
        out << finish;
    }
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int N = 310;
const ll INF = 1e18 + 69;
int n, m;
vector<pair<int,int>> graph[N];
ll dp[N][N];

void dfs(int u){
    if (u > n){
        for(int i = 1; i<N; ++i) dp[u][i] = INF;
        return;
    }
    for(pair<int, int> v: graph[u]){
        dfs(v.first);
        ll f[N];

        for(int i = 0; i<N; ++i){
            f[i] = INF;
            for(int j = 0; j<=i; ++j){
                minimize(f[i], dp[v.first][j] + abs(v.second - (i - j)));
            }
        }
        for(int i = 0; i<N; ++i) dp[u][i] += f[i];
    }
}

int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> n >> m;
    for(int i = 2; i<=n+m; ++i){
        int p, c; cin >> p >> c;
        graph[p].push_back({i, c});
    }

    dfs(1);

    ll ans = INF;
    for(int i = 0; i<N; ++i) minimize(ans, dp[1][i]);

    cout << ans << "\n";

    return 0;
}

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 3 ms 600 KB Output is correct
4 Correct 6 ms 856 KB Output is correct
5 Correct 6 ms 600 KB Output is correct
6 Correct 7 ms 620 KB Output is correct
7 Correct 8 ms 1112 KB Output is correct
8 Correct 9 ms 860 KB Output is correct
9 Correct 10 ms 728 KB Output is correct
10 Correct 11 ms 856 KB Output is correct
11 Correct 12 ms 860 KB Output is correct
12 Correct 13 ms 1112 KB Output is correct
13 Correct 14 ms 1116 KB Output is correct
14 Correct 16 ms 1716 KB Output is correct
15 Correct 15 ms 1120 KB Output is correct
16 Correct 15 ms 1116 KB Output is correct
17 Correct 15 ms 1040 KB Output is correct
18 Correct 20 ms 1116 KB Output is correct
19 Correct 15 ms 1116 KB Output is correct

Subtask #3
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -