Submission #1187975

#	Time	Username	Problem	Language	Result	Execution time	Memory
1187975		nikd	Tree (IOI24_tree)	C++20	7 / 100	52 ms	15176 KiB

tree

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

ll foglie = 0;
int n;

void init(std::vector<int> P, std::vector<int> W) {
  vector<vector<int>> adj(P.size());
  n = P.size();
  for(int i = 1; i<n; i++) adj[P[i]].push_back(i);
  for(int i = 0; i<n; i++) if(!adj[i].size()) foglie++;
}

long long query(int L, int R) {
  ll r = R; ll l = L;
  return foglie*l+max(0ll, foglie*l-r);
}

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