Submission #311610

#TimeUsernameProblemLanguageResultExecution timeMemory
311610biggChase (CEOI17_chase)C++14
70 / 100
315 ms99544 KiB
#include<bits/stdc++.h> using namespace std; typedef long long ll; const int MAXN = 1e5 + 10; const int MAXK = 110; ll dp[MAXN][MAXK]; ll s[MAXN], a[MAXN]; int crum; vector<int> grafo[MAXN]; void dfs(int x, int p){ for(int i = 0; i <= crum; i++) dp[x][i] = 0; for(int i = 0; i < grafo[x].size(); i++){ int viz = grafo[x][i]; if(viz == p) continue; dfs(viz, x); for(int k = 1; k <= crum; k++){ dp[x][k] = max(dp[viz][k], dp[x][k]); dp[x][k] = max(dp[x][k], dp[viz][k-1] + s[x] - a[p]); } } } int n; int main(){ scanf("%d %d", &n, &crum); if(crum == 0){ printf("0\n" ); return 0; } for(int i = 1; i <= n; i++) scanf("%lld", &a[i]); for(int i = 1; i < n; i++){ int u, v; scanf("%d %d", &u, &v); grafo[u].push_back(v); grafo[v].push_back(u); s[u] += a[v]; s[v] += a[u]; } ll ans = 0; if(n <= 1000){ for(int i = 1; i <= n; i++){ dfs(i, 0); ans = max(ans, dp[i][crum]); } }else{ dfs(1,0); ans = dp[1][crum]; } printf("%lld\n",ans ); }

Compilation message (stderr)

chase.cpp: In function 'void dfs(int, int)':
chase.cpp:12:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |  for(int i = 0; i < grafo[x].size(); i++){
      |                 ~~^~~~~~~~~~~~~~~~~
chase.cpp: In function 'int main()':
chase.cpp:25:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   25 |  scanf("%d %d", &n, &crum);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~
chase.cpp:30:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   30 |  for(int i = 1; i <= n; i++) scanf("%lld", &a[i]);
      |                              ~~~~~^~~~~~~~~~~~~~~
chase.cpp:33:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   33 |   scanf("%d %d", &u, &v);
      |   ~~~~~^~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...