Submission #333111

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
333111	2020-12-04T16:30:13 Z	caoash	Biochips (IZhO12_biochips)	C++17	100 / 100	442 ms	406252 KB

biochips

#include <bits/stdc++.h> 
using namespace std;

using ll = long long;

using vi = vector<int>;
using vl = vector<ll>;
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define lb lower_bound
#define ub upper_bound

using pi = pair<int,int>;
#define f first
#define s second
#define mp make_pair

const int MX = 200005;
const int MOD = (int) (1e9 + 7);
const ll INF = (ll) 1e18;

namespace output {
  void pr(int x) {
    cout << x;
  }
  void pr(long x) {
    cout << x;
  }
  void pr(ll x) {
    cout << x;
  }
  void pr(unsigned x) {
    cout << x;
  }
  void pr(unsigned long x) {
    cout << x;
  }
  void pr(unsigned long long x) {
    cout << x;
  }
  void pr(float x) {
    cout << x;
  }
  void pr(double x) {
    cout << x;
  }
  void pr(long double x) {
    cout << x;
  }
  void pr(char x) {
    cout << x;
  }
  void pr(const char * x) {
    cout << x;
  }
  void pr(const string & x) {
    cout << x;
  }
  void pr(bool x) {
    pr(x ? "true" : "false");
  }

  template < class T1, class T2 > void pr(const pair < T1, T2 > & x);
  template < class T > void pr(const T & x);

  template < class T, class...Ts > void pr(const T & t,
    const Ts & ...ts) {
    pr(t);
    pr(ts...);
  }
  template < class T1, class T2 > void pr(const pair < T1, T2 > & x) {
    pr("{", x.f, ", ", x.s, "}");
  }
  template < class T > void pr(const T & x) {
    pr("{"); // const iterator needed for vector<bool>
    bool fst = 1;
    for (const auto & a: x) pr(!fst ? ", " : "", a), fst = 0;
    pr("}");
  }

  void ps() {
    pr("\n");
  } // print w/ spaces
  template < class T, class...Ts > void ps(const T & t,
    const Ts & ...ts) {
    pr(t);
    if (sizeof...(ts)) pr(" ");
    ps(ts...);
  }

  void pc() {
    cout << "]" << endl;
  } // debug w/ commas
  template < class T, class...Ts > void pc(const T & t,
    const Ts & ...ts) {
    pr(t);
    if (sizeof...(ts)) pr(", ");
    pc(ts...);
  }
  #define dbg(x...) pr("[", #x, "] = ["), pc(x);
}

#ifdef mikey 
using namespace output;
#else
using namespace output;
#define dbg(x...)
#endif

vi adj[MX];
int dp[MX][505];
int st[MX], sz[MX], val[MX], pos[MX];
int cnt = 0;

void dfs(int v, int p) {
    pos[cnt] = v;
    st[v] = cnt++;
    sz[v] = 1;
    for (int to : adj[v]) {
        if (to != p) {
            dfs(to, v); 
            sz[v] += sz[to];
        }
    }
}

int main(){
#ifdef mikey 
    freopen("a.in", "r", stdin);
#endif
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m; cin >> n >> m;
    int root = -1;
    for (int i = 0; i < n; i++) {
        int p, x; cin >> p >> x;
        p--;
        val[i] = x;
        if (p != -1) {
            adj[p].pb(i);
        } else {
            root = i;
        }
    }
    memset(dp, -0x3f3f3f, sizeof(dp));
    dp[0][0] = 0;
    dfs(root, -1);
    for (int i = 0; i < cnt; i++) {
        for (int j = 0; j <= m; j++) {
            int cur = pos[i];
            int nxt = st[cur] + sz[cur];
            if (j < m) dp[nxt][j + 1] = max(dp[nxt][j + 1], dp[i][j] + val[cur]);
            dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);
        }
    }
    cout << dp[cnt][m] << '\n';
}

Compilation message

biochips.cpp:108: warning: "dbg" redefined
  108 | #define dbg(x...)
      | 
biochips.cpp:101: note: this is the location of the previous definition
  101 |   #define dbg(x...) pr("[", #x, "] = ["), pc(x);
      |

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	199 ms	400364 KB	Output is correct
2	Correct	199 ms	400384 KB	Output is correct
3	Correct	198 ms	400364 KB	Output is correct
4	Correct	205 ms	400748 KB	Output is correct
5	Correct	203 ms	400748 KB	Output is correct
6	Correct	205 ms	400876 KB	Output is correct
7	Correct	348 ms	405356 KB	Output is correct
8	Correct	343 ms	405228 KB	Output is correct
9	Correct	387 ms	405680 KB	Output is correct
10	Correct	442 ms	406252 KB	Output is correct