Submission #1349637

#	Time	Username	Problem	Language	Result	Execution time	Memory
1349637		ahmetlbktd4	Tree (IOI24_tree)	C++20	0 / 100	34 ms	13852 KiB

tree

#include "tree.h"
#include "bits/stdc++.h"
#define ll long long
using namespace std;

const int N = 2e5+5;

int n;
vector<int> p, w;
int k = 0; 
vector <int> g[N]; 
int d[N];

void dfs(int v,int pr){
  d[v] = 1;
  for (int u : g[v]){
    if (u == pr)
    continue;
    dfs(u,v);
    d[v] += d[u];
  }
}

void init(std::vector<int> P, std::vector<int> W){
  p = P;
  w = W;
  n = (int)p.size();
  for (int i = 1;i < n;i++){
    g[p[i]].push_back(i);
  }
  // dfs(0,-1);
  for (int i = 0;i < n;i++){
    if (g[i].empty())
    k++;
  }
}

ll query(int L, int R){
  ll p = k*L + max(0,k*L-R);
  return p;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 10
• Subtask 2: 0 / 13
• Subtask 3: 0 / 18
• Subtask 4: 0 / 7
• Subtask 5: 0 / 11
• Subtask 6: 0 / 22
• Subtask 7: 0 / 19