Submission #460813

#	Time	Username	Problem	Language	Result	Execution time	Memory
460813		ljuba	Magic Tree (CEOI19_magictree)	C++17	100 / 100	189 ms	37156 KiB

magictree

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
 
typedef vector<int> vi;
typedef vector<ll> vll;
 
typedef vector<vi> vvi;
typedef vector<vll> vvll;
 
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
typedef vector<pii> vpii;
typedef vector<pll> vpll;
 
typedef vector<vpii> vvpii;
typedef vector<vpll> vvpll;
 
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define fi first
#define se second
 
template<class T> bool ckmin(T &a, const T &b) {return a > b ? a = b, 1 : 0;}
template<class T> bool ckmax(T &a, const T &b) {return a < b ? a = b, 1 : 0;}
 
namespace debug {
    void __print(int x) {cerr << x;}
    void __print(long long x) {cerr << x;}
    void __print(double x) {cerr << x;}
    void __print(long double x) {cerr << x;}
    void __print(char x) {cerr << '\'' << x << '\'';}
    void __print(const string &x) {cerr << '\"' << x << '\"';}
    void __print(const char *x) {cerr << '\"' << x << '\"';}
    void __print(bool x) {cerr << (x ? "true" : "false");}
 
    template<typename T, typename V>
    void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
    template<typename T>
    void __print(const T &x) {int f = 0; cerr << '{'; for(auto z : x) cerr << (f++ ? "," : ""), __print(z); cerr << "}";}
    void _print() {cerr << "]\n";}
    template <typename T, typename... V>
    void _print(T t, V... v) {__print(t); if(sizeof...(v)) cerr << ", "; _print(v...);}
 
#ifdef ljuba
#define dbg(x...) cerr << "\e[91m" << "LINE(" << __LINE__ << ") -> " << "[" << #x << "] = ["; _print(x)
#else
#define dbg(x...)
#endif
}
 
using namespace debug;
 
const char nl = '\n';
 
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
 
/*
погледај сампле тестове, пре него што имплементираш (можда имаш погрешну идеју) 
уместо да разматраш неке глупе случајеве на папиру, размишљај заправо о задатку
*/

const int mxN = 1e5 + 12;
vi adj[mxN];

pll voce[mxN];
map<ll, ll> treba[mxN];

void dfs(int s) {
    for(auto e : adj[s]) {
        dfs(e);

        if(sz(treba[e]) > sz(treba[s]))
            swap(treba[e], treba[s]);

        for(auto z : treba[e])
            treba[s][z.fi] += z.se;
    }

    if(voce[s] == make_pair(0LL, 0LL))
        return;

    treba[s][voce[s].fi] += voce[s].se;
    vi obrisi;

    auto it = treba[s].upper_bound(voce[s].fi);
    ll vred = voce[s].se;

    while(it != treba[s].end()) {
        if(it->se < vred) {
            vred -= it->se;
            obrisi.pb(it->fi);
        } else {
            it->se -= vred;
            break;
        }
        ++it;
    }

    for(auto z : obrisi)
        treba[s].erase(z);
}

void solve() {
    int n, m, k;
    cin >> n >> m >> k;

    for(int i = 1; i < n; ++i) {
        int u;
        cin >> u;
        --u;
        adj[u].pb(i);
    }

    for(int i = 0; i < m; ++i) {
        int v, d, w;
        cin >> v >> d >> w;
        --v;
        voce[v] = {d, w};
    }

    dfs(0);

    ll ans = 0;
    for(auto z : treba[0])
        ans += z.se;
    cout << ans << nl;
}
 
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
 
    int testCases = 1;
    //cin >> testCases;
    while(testCases--)
        solve();
}

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