| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1287106 | hainam2k9 | Dostavljač (COCI18_dostavljac) | C++20 | 154 ms | 2444 KiB |
#include <bits/stdc++.h>
#define tt cin.tie(0), cout.tie(0), ios_base::sync_with_stdio(0)
#define fo freopen((NAME+".INP").c_str(), "r", stdin), freopen((NAME+".OUT").c_str(), "w", stdout)
#define ll long long
#define ull unsigned long long
#define i128 __int128
#define db long double
#define sz(a) ((int)(a).size())
#define pb emplace_back
#define pf emplace_front
#define pob pop_back
#define pof pop_front
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define ins emplace
#define mp make_pair
using namespace std;
const int MOD = 1e9+7, MAXN = 1e5+5;
const string NAME = "";
int n,m,dp[505][505][2],a[505],rs=0;
vector<int> adj[505];
void dfs(int u, int par){
dp[u][1][0]=dp[u][1][1]=a[u];
for(int& v : adj[u]){
if(v==par) continue;
dfs(v,u);
for(int i = 1; i<=m; ++i)
dp[u][i][0]=max(dp[u][i][0],dp[u][i-1][0]), dp[u][i][1]=max(dp[u][i][1],dp[u][i-1][1]);
for(int i = m; i>=0; --i)
for(int j = 1; j<=m-i; ++j){
dp[u][i+j+1][0]=max(dp[u][i+j+1][0],dp[u][i][1]+dp[v][j][0]);
dp[u][i+j+2][0]=max(dp[u][i+j+2][0],dp[u][i][0]+dp[v][j][1]);
dp[u][i+j+2][1]=max(dp[u][i+j+2][1],dp[u][i][1]+dp[v][j][1]);
}
}
for(int i = 1; i<=m; ++i)
dp[u][i][0]=max(dp[u][i][0],dp[u][i-1][0]), dp[u][i][1]=max(dp[u][i][1],dp[u][i-1][1]);
}
int main()
{
tt;
if(fopen((NAME + ".INP").c_str(), "r")) fo;
cin >> n >> m;
for(int i = 1; i<=n; ++i)
cin >> a[i];
for(int i = 1; i<n; ++i){
int x,y;
cin >> x >> y;
adj[x].pb(y), adj[y].pb(x);
}
dfs(1,0);
cout << max(dp[1][m][0],dp[1][m][1]);
}
컴파일 시 표준 에러 (stderr) 메시지
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
