oj.uz

답안 #683733

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
683733 2023-01-19T08:45:16 Z nifeshe 바이오칩 (IZhO12_biochips) C++17
60 / 100
 2000 ms 524288 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC target ("avx2")
//#pragma GCC optimize ("O3")
//#pragma GCC optimize ("unroll-loops")
//#pragma comment (linker, "/STACK: 16777216")

#define f first
#define s second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
#define int long long

using namespace std;
using namespace __gnu_pbds;

template <typename T> inline bool umax(T &a, const T &b) { if(a < b) { a = b; return 1; } return 0; }
template <typename T> inline bool umin(T &a, const T &b) { if(a > b) { a = b; return 1; } return 0; }
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
template <typename T> using oset = tree<T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;

const ll mod = 998244353;
const ll base = 1e6 + 5;
const ll inf = 1e12;
const int MAX = 2e5 + 5;
const int LG = 31;

random_device rd;
mt19937 gen(rd());
uniform_int_distribution<ll> dis(1, inf);

void solve() {
    int n, m;
    cin >> n >> m;
    vector<int> a(n + 1);
    vector<vector<int>> g(n + 1);
    int root;
    for(int i = 1; i <= n; i++) {
        int p;
        cin >> p >> a[i];
        if(!p) {
            root = i;
            continue;
        }
        g[p].pb(i);
        g[i].pb(p);
    }
    vector<vector<int>> dp(n + 1, vector<int>(m + 1, -inf));
    function<void(int, int)> dfs = [&](int v, int p) {
        dp[v][0] = 0;
        for(auto to : g[v]) {
            if(to == p) continue;
            dfs(to, v);
            auto ndp = dp[v];
            for(int j = 0; j <= m; j++) {
                if(!dp[to][j]) continue;
                for(int k = 0; k + j <= m; k++) {
                    if(dp[v][k] == -inf) break;
                    umax(ndp[k + j], dp[v][k] + dp[to][j]);
                }
            }
            dp[v] = ndp;
        }
        umax(dp[v][1], a[v]);
    };
    dfs(root, 0);
    cout << dp[root][m] << '\n';
}

signed main() {
//    freopen("skyline.in", "r", stdin); freopen("skyline.out", "w", stdout);
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int ttt = 1;
//    cin >> ttt;
    while(ttt--) {
        solve();
    }
    return 0;
}

Compilation message

biochips.cpp: In function 'void solve()':
biochips.cpp:74:20: warning: 'root' may be used uninitialized in this function [-Wmaybe-uninitialized]
   74 |     cout << dp[root][m] << '\n';
      |                    ^

Subtask #1
60.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 14 ms 5460 KB Output is correct
5 Correct 42 ms 7424 KB Output is correct
6 Correct 38 ms 9340 KB Output is correct
7 Execution timed out 2096 ms 365188 KB Time limit exceeded
8 Execution timed out 2087 ms 365204 KB Time limit exceeded
9 Runtime error 251 ms 524288 KB Execution killed with signal 9
10 Runtime error 251 ms 524288 KB Execution killed with signal 9