# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
672418 | 2022-12-16T03:28:45 Z | Alihan_8 | 바이오칩 (IZhO12_biochips) | C++17 | 557 ms | 395056 KB |
#include <bits/stdc++.h> // include <ext/pb_ds/assoc_container.hpp> // include <ext/pb_ds/tree_policy.hpp> // using namespace __gnu_pbds; using namespace std; #define all(x) x.begin(), x.end() #define pb push_back // define ordered_set tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update> #define mpr make_pair #define ln '\n' void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);} //#define int long long const int N = 2e5+1; vector <int> g[N]; vector <vector<int>> dp; void chmax(int &l, int r){l = max(l, r);}; int sub[N], m; void dfs(int n){ sub[n] = 1; vector <int> Mx(m+1); for ( auto to: g[n] ){ dfs(to); vector <int> cur(m+1); for ( int i = 0; i <= min(sub[n], m); i++ ){ for ( int j = 0; j <= min(sub[to], m) and j+i <= m; j++ ){ chmax(cur[i+j], Mx[i]+dp[to][j]); } } sub[n] += sub[to]; for ( int i = 0; i <= min(m, sub[n]); i++ ) chmax(Mx[i], cur[i]); } for ( int i = 0; i <= min(m, sub[n]); i++ ) chmax(dp[n][i], Mx[i]); } signed main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n >> m; int root = -1; dp.resize(n+1); for ( auto &i: dp ) i.resize(m+1); for ( int i = 1; i <= n; i++ ){ int x; cin >> x >> dp[i][1]; if ( x ) g[x].pb(i); else root = i; } dfs(root); cout << dp[root][m]; cout << '\n'; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 4948 KB | Output is correct |
2 | Correct | 3 ms | 4948 KB | Output is correct |
3 | Correct | 3 ms | 4948 KB | Output is correct |
4 | Correct | 7 ms | 7636 KB | Output is correct |
5 | Correct | 9 ms | 8532 KB | Output is correct |
6 | Correct | 10 ms | 9428 KB | Output is correct |
7 | Correct | 257 ms | 185828 KB | Output is correct |
8 | Correct | 259 ms | 185716 KB | Output is correct |
9 | Correct | 427 ms | 293080 KB | Output is correct |
10 | Correct | 557 ms | 395056 KB | Output is correct |