oj.uz

Submission #588111

# Submission time Handle Problem Language Result Execution time Memory
588111 2022-07-02T17:35:05 Z Sam_a17 Biochips (IZhO12_biochips) C++14
100 / 100
 1681 ms 412080 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt __builtin_popcount
 
#define pb push_back
#define popf pop_front
#define popb pop_back
#define ld long double
#define ll long long
 
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
void print(long double t) {cerr << t;}
 
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T> void print(T v[],T n) {cerr << "["; for(int i = 0; i < n; i++) {cerr << v[i] << " ";} cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
 
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  if (str != "") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }
}
 
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 2e5 + 10, M = 5e2 + 10;;
int n, m, root, cost[N];
vector<int> adj[N];
int dp[N][M];

void dfs(int node, int parent) {
  vector<bool> is_dp(m + 1, 0);
  is_dp[0] = true;

  for(auto i: adj[node]) {
    if(i == parent) continue;
    dfs(i, node);

    // merge
    vector<pair<int, int>> to_add; 
    for(int j = 1; j <= m; j++) {
      if(!dp[i][j]) continue;
      for(int k = m - j; k >= 0; k--) {
        if(is_dp[k]) {
          to_add.push_back({k + j, dp[node][k] + dp[i][j]});
        }
      }
    }

    for(auto j: to_add) {
      is_dp[j.first] = true;
      dp[node][j.first] = max(dp[node][j.first], j.second);
    }
  }

  dp[node][1] = max(dp[node][1], cost[node]);
}

void solve_() {
  cin >> n >> m;

  for(int i = 1; i <= n; i++) {
    int p; cin >> p >> cost[i];
    if(p == 0) {
      root = i;
    } else {
      adj[i].push_back(p);
      adj[p].push_back(i);
    }
  }

  dfs(root, 0);

  printf("%d\n", dp[root][m]);
}
 
int main () {
  setIO("");
 
  auto solve = [&](int test_case)-> void {
    while(test_case--) {
      solve_();
    }
  };
 
  int test_cases = 1;
  solve(test_cases);
 
  return 0;
}

Compilation message

biochips.cpp: In function 'void setIO(std::string)':
biochips.cpp:65:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
biochips.cpp:66:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 5204 KB Output is correct
4 Correct 22 ms 23072 KB Output is correct
5 Correct 29 ms 25392 KB Output is correct
6 Correct 30 ms 25468 KB Output is correct
7 Correct 999 ms 307984 KB Output is correct
8 Correct 1004 ms 308156 KB Output is correct
9 Correct 1337 ms 373228 KB Output is correct
10 Correct 1681 ms 412080 KB Output is correct