oj.uz

Submission #887329

# Submission time Handle Problem Language Result Execution time Memory
887329 2023-12-14T09:11:16 Z vjudge1 Chase (CEOI17_chase) C++17
70 / 100
 223 ms 102484 KB 
/// Seeing the beauty through the...
/// Pain!
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define fast_io ios::sync_with_stdio(false);cin.tie(NULL);
#define file_io freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define FOR(i,k,n) for(int i = k; i < n; ++ i)
#define debf cout<<"(0-0)\n";
#define all(x) x.begin(), x.end()
#define dec(x) cout << fixed << setprecision(x);
#define pf push_front
#define ppf pop_front
#define dash " ------- "
#define what(x) cerr << #x << " is " << x << endl;
#define eb emplace_back
//#define int short int
#define int long long
#define sz(s) (int) (s.size())
#define fl cout.flush()

using namespace std;
//using namespace __gnu_pbds;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <int, pii> pip;
typedef pair <pii, int> ppi;
typedef pair <ll, ll> pll;
typedef unsigned long long ull;
typedef long double ld;

template <class T> using max_heap = priority_queue <T, vector <T>, less <T> >;
template <class T> using min_heap = priority_queue <T, vector <T>, greater <T> >;
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

constexpr int MOD = 1e9 + 7, N = 2e5 + 8, M = 1e5 + 4, SQ = 300, INF = 1e15 + 8, LGN = 22, mod = 998244353, P = 131113;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, k, p[N], c[N], sum[N], ans, dp[N][108];
vector <int> adj[N];

void dfs (int u, int par = -1){
  for (int j = k; j > 0; -- j){
    dp[u][j] = max (dp[u][j], dp[u][j-1] + sum[u] - (par == -1 ? 0 : p[par]));
    ans = max (ans, dp[u][j]);
  }
  for (int i : adj[u]){
    if (i != par){
      for (int j = 0; j <= k; ++ j){
        dp[i][j] = dp[u][j];
      }
      dfs (i, u);
    }
  }
  return;
}

int32_t main(){
  fast_io;
  cin >> n >> k;
  FOR (i, 0, n){
    cin >> p[i];
  }
  FOR (i, 0, n - 1){
    int aa, bb;
    cin >> aa >> bb;
    adj[--aa].pb(--bb);
    adj[bb].pb(aa);
    sum[aa] += p[bb];
    sum[bb] += p[aa];
  }
  if (n > 1000){
    dfs (0);
    cout << ans;
    return 0;
  }
  for (int i = 0; i < n; ++ i){
    for (int j = 0; j <= k; ++ j){
      dp[i][j] = 0;
    }
    dfs (i);
  }
  cout << ans;
  return 0;
}

// Yesterday is history
// Tomorrow is a mystery
// but today is a gift
// That is why it is called the present

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8796 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Correct 2 ms 8860 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 2 ms 8864 KB Output is correct
6 Correct 2 ms 8852 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8796 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Correct 2 ms 8860 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 2 ms 8864 KB Output is correct
6 Correct 2 ms 8852 KB Output is correct
7 Correct 215 ms 8796 KB Output is correct
8 Correct 26 ms 8796 KB Output is correct
9 Correct 26 ms 8928 KB Output is correct
10 Correct 223 ms 8900 KB Output is correct
11 Correct 72 ms 8796 KB Output is correct
12 Correct 32 ms 8924 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 101888 KB Output is correct
2 Correct 81 ms 102484 KB Output is correct
3 Correct 53 ms 99648 KB Output is correct
4 Correct 50 ms 99432 KB Output is correct
5 Correct 97 ms 99412 KB Output is correct
6 Correct 98 ms 99408 KB Output is correct
7 Correct 97 ms 99580 KB Output is correct

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8796 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Correct 2 ms 8860 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 2 ms 8864 KB Output is correct
6 Correct 2 ms 8852 KB Output is correct
7 Correct 215 ms 8796 KB Output is correct
8 Correct 26 ms 8796 KB Output is correct
9 Correct 26 ms 8928 KB Output is correct
10 Correct 223 ms 8900 KB Output is correct
11 Correct 72 ms 8796 KB Output is correct
12 Correct 32 ms 8924 KB Output is correct
13 Correct 81 ms 101888 KB Output is correct
14 Correct 81 ms 102484 KB Output is correct
15 Correct 53 ms 99648 KB Output is correct
16 Correct 50 ms 99432 KB Output is correct
17 Correct 97 ms 99412 KB Output is correct
18 Correct 98 ms 99408 KB Output is correct
19 Correct 97 ms 99580 KB Output is correct
20 Incorrect 98 ms 99412 KB Output isn't correct
21 Halted 0 ms 0 KB -