oj.uz

Submission #887313

# Submission time Handle Problem Language Result Execution time Memory
887313 2023-12-14T09:00:11 Z vjudge1 Chase (CEOI17_chase) C++17
20 / 100
 4000 ms 20680 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;
vector <int> v;
vector <int> adj[N];

void dfs (int u, int par = -1){
  v.pb(u);
  for (int i : adj[u]){
    if (i != par){
      dfs (i, u);
    }
  }
  int sz = v.size();
  for (int mask = 0; mask < (1 << sz); ++ mask){
    if (__builtin_popcount(mask) <= k){
      for (int j = 0; j < n; ++ j){
        c[j] = p[j];
      }
      int ret = 0;
      for (int j = 0; j < sz; ++ j){
        if (mask & (1 << j)){
          ret += sum[v[j]];
          if (j >= 1){// && mask & (1 << (j - 2))){
            ret -= p[v[j-1]];
          }
        }
      }
      ans = max (ans, ret);
    }
  }
  v.ppb();
  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){
    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 2 ms 8796 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Correct 2 ms 8796 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 2 ms 8796 KB Output is correct
6 Correct 2 ms 8796 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Correct 2 ms 8796 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 2 ms 8796 KB Output is correct
6 Correct 2 ms 8796 KB Output is correct
7 Execution timed out 4050 ms 8796 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4014 ms 20680 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Correct 2 ms 8796 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 2 ms 8796 KB Output is correct
6 Correct 2 ms 8796 KB Output is correct
7 Execution timed out 4050 ms 8796 KB Time limit exceeded
8 Halted 0 ms 0 KB -