Submission #1221634

#	Time	Username	Problem	Language	Result	Execution time	Memory
1221634		Theo830	Tree (IOI24_tree)	C++20	7 / 100	50 ms	16932 KiB

tree

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ll,ii>
#define id pair<ll,vector<ll> >
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
#include "tree.h"
int n;
long long leaf;
std::vector<int> p, w;
vector<vector<int> >adj;
void init(std::vector<int> P, std::vector<int> W) {
    p = P;
    w = W;
    leaf = 0;
    n = (int)p.size();
    adj.assign(n+5,vector<int>());
    f(i,1,n){
        adj[p[i]].pb(i);
    }
    f(i,0,n){
        if(adj[i].size() == 0){
            leaf++;
        }
    }
}
long long query(int L, int R){
    long long ans = leaf * L;
    if(leaf * L <= R){
        return ans;
    }
    ans *= 2;
    ans -= R;
    return ans;
}

• 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