oj.uz

Submission #460813

# Submission time Handle Problem Language Result Execution time Memory
460813 2021-08-09T09:58:05 Z ljuba Magic Tree (CEOI19_magictree) C++17
100 / 100
 189 ms 37156 KB 
#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.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7372 KB Output is correct
2 Correct 5 ms 7372 KB Output is correct
3 Correct 5 ms 7372 KB Output is correct
4 Correct 5 ms 7352 KB Output is correct
5 Correct 5 ms 7244 KB Output is correct
6 Correct 5 ms 7244 KB Output is correct
7 Correct 5 ms 7372 KB Output is correct
8 Correct 5 ms 7372 KB Output is correct
9 Correct 5 ms 7372 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 18116 KB Output is correct
2 Correct 51 ms 18784 KB Output is correct
3 Correct 153 ms 35312 KB Output is correct
4 Correct 93 ms 18628 KB Output is correct
5 Correct 130 ms 20244 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7500 KB Output is correct
2 Correct 5 ms 7504 KB Output is correct
3 Correct 6 ms 7500 KB Output is correct
4 Correct 67 ms 28064 KB Output is correct
5 Correct 87 ms 31972 KB Output is correct
6 Correct 96 ms 28016 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 14140 KB Output is correct
2 Correct 92 ms 13432 KB Output is correct
3 Correct 68 ms 18180 KB Output is correct
4 Correct 57 ms 14904 KB Output is correct
5 Correct 71 ms 26012 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7372 KB Output is correct
2 Correct 5 ms 7372 KB Output is correct
3 Correct 5 ms 7372 KB Output is correct
4 Correct 5 ms 7352 KB Output is correct
5 Correct 5 ms 7244 KB Output is correct
6 Correct 5 ms 7244 KB Output is correct
7 Correct 5 ms 7372 KB Output is correct
8 Correct 5 ms 7372 KB Output is correct
9 Correct 5 ms 7372 KB Output is correct
10 Correct 103 ms 19684 KB Output is correct
11 Correct 119 ms 18368 KB Output is correct
12 Correct 73 ms 19612 KB Output is correct
13 Correct 48 ms 15972 KB Output is correct
14 Correct 59 ms 27596 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 8140 KB Output is correct
2 Correct 43 ms 10988 KB Output is correct
3 Correct 44 ms 11004 KB Output is correct
4 Correct 40 ms 11164 KB Output is correct
5 Correct 14 ms 9420 KB Output is correct
6 Correct 36 ms 13648 KB Output is correct
7 Correct 46 ms 17476 KB Output is correct

Subtask #7
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7372 KB Output is correct
2 Correct 5 ms 7372 KB Output is correct
3 Correct 5 ms 7372 KB Output is correct
4 Correct 5 ms 7352 KB Output is correct
5 Correct 5 ms 7244 KB Output is correct
6 Correct 5 ms 7244 KB Output is correct
7 Correct 5 ms 7372 KB Output is correct
8 Correct 5 ms 7372 KB Output is correct
9 Correct 5 ms 7372 KB Output is correct
10 Correct 5 ms 7500 KB Output is correct
11 Correct 5 ms 7504 KB Output is correct
12 Correct 6 ms 7500 KB Output is correct
13 Correct 67 ms 28064 KB Output is correct
14 Correct 87 ms 31972 KB Output is correct
15 Correct 96 ms 28016 KB Output is correct
16 Correct 103 ms 19684 KB Output is correct
17 Correct 119 ms 18368 KB Output is correct
18 Correct 73 ms 19612 KB Output is correct
19 Correct 48 ms 15972 KB Output is correct
20 Correct 59 ms 27596 KB Output is correct
21 Correct 27 ms 11596 KB Output is correct
22 Correct 96 ms 21160 KB Output is correct
23 Correct 108 ms 25388 KB Output is correct
24 Correct 189 ms 37156 KB Output is correct
25 Correct 93 ms 19984 KB Output is correct
26 Correct 121 ms 22996 KB Output is correct
27 Correct 112 ms 22288 KB Output is correct

Subtask #8
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7372 KB Output is correct
2 Correct 5 ms 7372 KB Output is correct
3 Correct 5 ms 7372 KB Output is correct
4 Correct 5 ms 7352 KB Output is correct
5 Correct 5 ms 7244 KB Output is correct
6 Correct 5 ms 7244 KB Output is correct
7 Correct 5 ms 7372 KB Output is correct
8 Correct 5 ms 7372 KB Output is correct
9 Correct 5 ms 7372 KB Output is correct
10 Correct 74 ms 18116 KB Output is correct
11 Correct 51 ms 18784 KB Output is correct
12 Correct 153 ms 35312 KB Output is correct
13 Correct 93 ms 18628 KB Output is correct
14 Correct 130 ms 20244 KB Output is correct
15 Correct 5 ms 7500 KB Output is correct
16 Correct 5 ms 7504 KB Output is correct
17 Correct 6 ms 7500 KB Output is correct
18 Correct 67 ms 28064 KB Output is correct
19 Correct 87 ms 31972 KB Output is correct
20 Correct 96 ms 28016 KB Output is correct
21 Correct 81 ms 14140 KB Output is correct
22 Correct 92 ms 13432 KB Output is correct
23 Correct 68 ms 18180 KB Output is correct
24 Correct 57 ms 14904 KB Output is correct
25 Correct 71 ms 26012 KB Output is correct
26 Correct 103 ms 19684 KB Output is correct
27 Correct 119 ms 18368 KB Output is correct
28 Correct 73 ms 19612 KB Output is correct
29 Correct 48 ms 15972 KB Output is correct
30 Correct 59 ms 27596 KB Output is correct
31 Correct 13 ms 8140 KB Output is correct
32 Correct 43 ms 10988 KB Output is correct
33 Correct 44 ms 11004 KB Output is correct
34 Correct 40 ms 11164 KB Output is correct
35 Correct 14 ms 9420 KB Output is correct
36 Correct 36 ms 13648 KB Output is correct
37 Correct 46 ms 17476 KB Output is correct
38 Correct 27 ms 11596 KB Output is correct
39 Correct 96 ms 21160 KB Output is correct
40 Correct 108 ms 25388 KB Output is correct
41 Correct 189 ms 37156 KB Output is correct
42 Correct 93 ms 19984 KB Output is correct
43 Correct 121 ms 22996 KB Output is correct
44 Correct 112 ms 22288 KB Output is correct
45 Correct 28 ms 11340 KB Output is correct
46 Correct 103 ms 20608 KB Output is correct
47 Correct 106 ms 23956 KB Output is correct
48 Correct 158 ms 34076 KB Output is correct
49 Correct 103 ms 20760 KB Output is correct
50 Correct 145 ms 23156 KB Output is correct
51 Correct 107 ms 22424 KB Output is correct