Submission #469626

#	Time	Username	Problem	Language	Result	Execution time	Memory
469626		Carmel_Ab1	Magic Tree (CEOI19_magictree)	C++17	3 / 100	166 ms	25416 KiB

magictree

#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld, ld> pld;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T>
ostream &operator<<(ostream &os, vector<T> &a) {
    os << "[";
    for (int i = 0; i < ll(a.size()); i++) { os << a[i] << ((i != ll(a.size() - 1) ? " " : "")); }
    os << "]\n";
    return os;
}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map

template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
    is >> p.first >> p.second;
    return is;
}

template<typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> &p) {
    os << "" << p.first << " " << p.second << "";
    return os;
}

void usaco(string taskname) {
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char *FIN = fin.c_str();
    const char *FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
}

template<typename T>
void read(vector<T> &v) {
    int n = v.size();
    for (int i = 0; i < n; i++)
        cin >> v[i];
}

template<typename T>
vector<T> UNQ(vector<T> a) {
    vector<T> ans;
    for (T t:a)
        if (ans.empty() || t != ans.back())
            ans.push_back(t);
    return ans;
}

ll ceil(ll a, ll b) {
    ll ans = a / b;
    if (a % b)ans++;
    return ans;
}

ld log(ld a, ld b) { return log(b) / log(a); }

ll power(ll base, ll exp, ll M = 1e18) {//(base^exp)%M
    ll ans = 1;
    while (exp) {
        if (exp % 2 == 1)ans = ((ans % M) * (base % M)) % M;
        base = ((base % M) * (base % M)) % M;
        exp /= 2;
    }
    return ans;
}

string to_base(int n, int new_base) {
    string s;
    int nn = n;
    while (nn) {
        s += to_string(nn % new_base);
        nn /= new_base;
    }
    reverse(all(s));
    return s;
}

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    ll x = (a / gcd(a, b));
    return b * x;
}

vl generate_array(ll n, ll mn = 1, ll mx = 1e18 + 1) {
    if (mx == 1e18 + 1)
        mx = n;
    vl ans(n);
    for (int i = 0; i < n; i++)
        ans[i] = (mn + rand() % (mx - mn + 1));
    return ans;
}

string substr(string s, int l, int r) {
    string ans;
    for (int i = l; i <= r; i++)
        ans += s[i];
    return ans;
}


void solve();

int main() {
    GLHF;
    int t = 1;
    //cin >> t;
    while (t--)
        solve();
}
struct Seg{
    ll l,r,m;
    Seg *lp=0,*rp=0;
    ll sum=0,prop=0;

    Seg(ll l,ll r):l(l),r(r),m((l+r)/2){
        if(l+1<r){
            lp=new Seg(l,m);
            rp=new Seg(m,r);
        }
    }
    void add(ll x){
        sum+=x;
        prop+=x;
    }
    void push(){
        lp->add(prop);
        rp->add(prop);
        prop=0;
    }
    void update(ll a,ll b,ll x){
        if(r<=a || b<=l)
            return;
        else if(a<=l && r<=b){
            add(x);
            return;
        }
        push();
        lp->update(a,b,x);
        rp->update(a,b,x);
        sum=lp->sum+rp->sum;
    }
    ll query(ll a,ll b){
        if(r<=a || b<=l)
            return 0;
        if(a<=l && r<=b)
            return sum;
        push();
        return lp->query(a,b)+rp->query(a,b);
    }
};

ll n,m,k;
vvi g;
vl d,W,tin,tout;
int timer=1;
void dfs(int src,int par){
    tin[src]=timer++;
    for(int nbr:g[src])
        if(nbr!=par)
            dfs(nbr,src);
    tout[src]=timer-1;
}
void solve() {
    cin >> n >> m >> k;
    g.resize(n+1);

    for(int i=2; i<=n; i++){
        int x;
        cin >> x;
        g[i].pb(x);
        g[x].pb(i);
    }
    d.resize(n+1,1e18);
    W.resize(n+1);

    vl ord;
    for(int i=0; i<m; i++){
        ll vi,di,wi;
        cin >> vi >> di >> wi;
        ord.pb(vi);
        d[vi]=di;
        W[vi]=wi;
    }
    tin.resize(n+1);
    tout.resize(n+1);
    dfs(1,-1);

    Seg s(0,n+1);
    sort(all(ord),[](ll u,ll v){
       return d[u]>d[v];
    });

    for(int i=0; i<m; i++){
        ll src=ord[i];
        ll w=W[src];
        ll subtree=s.query(tin[src],tout[src]+1);
        if(w>subtree) {//>=???
            s.update(tin[src], tout[src] + 1, -subtree);
            s.update(tin[src], tout[src] + 1, w);
        }
    }
    out(s.query(tin[1],tout[1]+1))
}

Compilation message (stderr)

magictree.cpp: In function 'void usaco(std::string)':
magictree.cpp:56:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   56 |     freopen(FIN, "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~
magictree.cpp:57:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |     freopen(FOUT, "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 6
• Subtask 2: 3 / 3
• Subtask 3: 0 / 11
• Subtask 4: 0 / 12
• Subtask 5: 0 / 16
• Subtask 6: 0 / 13
• Subtask 7: 0 / 22
• Subtask 8: 0 / 17