oj.uz

답안 #887325

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
887325 2023-12-14T09:10:02 Z vjudge1 Chase (CEOI17_chase) C++17
40 / 100
 4000 ms 100608 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];
  }
  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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8792 KB Output is correct
2 Correct 1 ms 9048 KB Output is correct
3 Correct 1 ms 8796 KB Output is correct
4 Correct 1 ms 8796 KB Output is correct
5 Correct 1 ms 8796 KB Output is correct
6 Correct 2 ms 8796 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8792 KB Output is correct
2 Correct 1 ms 9048 KB Output is correct
3 Correct 1 ms 8796 KB Output is correct
4 Correct 1 ms 8796 KB Output is correct
5 Correct 1 ms 8796 KB Output is correct
6 Correct 2 ms 8796 KB Output is correct
7 Correct 188 ms 8796 KB Output is correct
8 Correct 19 ms 8796 KB Output is correct
9 Correct 16 ms 8792 KB Output is correct
10 Correct 191 ms 8796 KB Output is correct
11 Correct 66 ms 8796 KB Output is correct
12 Correct 31 ms 8796 KB Output is correct

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4058 ms 100608 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8792 KB Output is correct
2 Correct 1 ms 9048 KB Output is correct
3 Correct 1 ms 8796 KB Output is correct
4 Correct 1 ms 8796 KB Output is correct
5 Correct 1 ms 8796 KB Output is correct
6 Correct 2 ms 8796 KB Output is correct
7 Correct 188 ms 8796 KB Output is correct
8 Correct 19 ms 8796 KB Output is correct
9 Correct 16 ms 8792 KB Output is correct
10 Correct 191 ms 8796 KB Output is correct
11 Correct 66 ms 8796 KB Output is correct
12 Correct 31 ms 8796 KB Output is correct
13 Execution timed out 4058 ms 100608 KB Time limit exceeded
14 Halted 0 ms 0 KB -