Submission #1273604

#	Time	Username	Problem	Language	Result	Execution time	Memory
1273604		mkkkkkkkk	Tree (IOI24_tree)	C++20	0 / 100	2093 ms	17928 KiB

tree

#include <bits/stdc++.h>

using namespace std;

vector<long long> adj[200001];
long long arr[200001],arr2[200001];


void dfs(long long i,long long& res,long long l,long long r)
{

for(auto it : adj[i])
    dfs(it,res,l,r);
    if(adj[i].size()==0)
    {
        res++;
    }

}

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

}

long long query(int L, int R)
{
    long long res=0;
    dfs(0,res,L,R);
    long long ress=(long long)res*L+abs(R-res);
    return ress;
}

• 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