Submission #1272301

#	Time	Username	Problem	Language	Result	Execution time	Memory
1272301		julsjlv	Tree (IOI24_tree)	C++20	7 / 100	40 ms	6272 KiB

tree

#include "tree.h"
#include <stdio.h>
#define lol long long

using namespace std;

int n;
std::vector<int> p, w;
std::vector<bool> has;
int leavesCount;

void init(std::vector<int> P, std::vector<int> W) {
  p = P;
  w = W;
  n = (int)p.size();
  has = vector<bool>(n, false);
  for (int i = 1; i < n; i++)
    has[P[i]] = true;
  for (int i = 0; i < n; i++)
    leavesCount += !has[i];
}

long long query(int L, int R) {
  //return n * (long long)(R - L);
  
  lol sumLeaves = leavesCount * ((lol) L);
  if (sumLeaves <= R) {
    return sumLeaves;
  } else {
    return sumLeaves + (sumLeaves - 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