oj.uz

Submission #1115887

# Submission time Handle Problem Language Result Execution time Memory
1115887 2024-11-21T03:32:15 Z guagua0407 Magic Tree (CEOI19_magictree) C++17
100 / 100
 142 ms 45128 KB 
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

int dx[4]={0,0,1,-1};
int dy[4]={1,-1,0,0};

void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

const int mxn=1e5+5;
vector<int> adj[mxn];
multiset<pair<int,int>> S[mxn];
int d[mxn];
int w[mxn];

void dfs(int v,int p=0){
    for(auto u:adj[v]){
        dfs(u,v);
        if(S[v].size()<S[u].size()){
            swap(S[v],S[u]);
        }
        for(auto x:S[u]){
            S[v].insert(x);
        }
    }
    auto it=S[v].lower_bound({d[v]+1,0});
    int sum=0;
    while(it!=S[v].end() and sum+(*it).s<=w[v]){
        sum+=(*it).s;
        it=S[v].erase(it);
    }
    if(it!=S[v].end()){
        auto p=(*it);
        S[v].erase(it);
        p.s=sum+p.s-w[v];
        S[v].insert(p);
    }
    S[v].insert({d[v],w[v]});
}

signed main() {_
    int n,m,k;
    cin>>n>>m>>k;
    for(int i=2;i<=n;i++){
        int p;
        cin>>p;
        adj[p].push_back(i);
    }
    for(int i=0;i<m;i++){
        int v;
        cin>>v;
        cin>>d[v]>>w[v];
    }
    dfs(1);
    ll ans=0;
    for(auto v:S[1]){
        ans+=v.s;
    }
    cout<<ans<<'\n';
    return 0;
}
//maybe its multiset not set
//yeeorz
//diaoborz

Compilation message

magictree.cpp: In function 'void setIO(std::string)':
magictree.cpp:16:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
magictree.cpp:17:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 43080 KB Output is correct
2 Correct 57 ms 26952 KB Output is correct
3 Correct 142 ms 41044 KB Output is correct
4 Correct 73 ms 22212 KB Output is correct
5 Correct 109 ms 23220 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 9052 KB Output is correct
2 Correct 3 ms 9040 KB Output is correct
3 Correct 3 ms 9040 KB Output is correct
4 Correct 50 ms 26440 KB Output is correct
5 Correct 74 ms 32856 KB Output is correct
6 Correct 66 ms 26448 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 37704 KB Output is correct
2 Correct 133 ms 45128 KB Output is correct
3 Correct 75 ms 25532 KB Output is correct
4 Correct 86 ms 24004 KB Output is correct
5 Correct 74 ms 30280 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8784 KB Output is correct
2 Correct 2 ms 8784 KB Output is correct
3 Correct 2 ms 8784 KB Output is correct
4 Correct 2 ms 8784 KB Output is correct
5 Correct 2 ms 8784 KB Output is correct
6 Correct 2 ms 8784 KB Output is correct
7 Correct 2 ms 8784 KB Output is correct
8 Correct 2 ms 8884 KB Output is correct
9 Correct 2 ms 8784 KB Output is correct
10 Correct 112 ms 35912 KB Output is correct
11 Correct 102 ms 36680 KB Output is correct
12 Correct 68 ms 22088 KB Output is correct
13 Correct 61 ms 23488 KB Output is correct
14 Correct 73 ms 26952 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 15184 KB Output is correct
2 Correct 110 ms 43168 KB Output is correct
3 Correct 103 ms 42312 KB Output is correct
4 Correct 108 ms 41732 KB Output is correct
5 Correct 33 ms 22212 KB Output is correct
6 Correct 71 ms 26184 KB Output is correct
7 Correct 59 ms 27008 KB Output is correct

Subtask #7
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8784 KB Output is correct
2 Correct 2 ms 8784 KB Output is correct
3 Correct 2 ms 8784 KB Output is correct
4 Correct 2 ms 8784 KB Output is correct
5 Correct 2 ms 8784 KB Output is correct
6 Correct 2 ms 8784 KB Output is correct
7 Correct 2 ms 8784 KB Output is correct
8 Correct 2 ms 8884 KB Output is correct
9 Correct 2 ms 8784 KB Output is correct
10 Correct 3 ms 9052 KB Output is correct
11 Correct 3 ms 9040 KB Output is correct
12 Correct 3 ms 9040 KB Output is correct
13 Correct 50 ms 26440 KB Output is correct
14 Correct 74 ms 32856 KB Output is correct
15 Correct 66 ms 26448 KB Output is correct
16 Correct 112 ms 35912 KB Output is correct
17 Correct 102 ms 36680 KB Output is correct
18 Correct 68 ms 22088 KB Output is correct
19 Correct 61 ms 23488 KB Output is correct
20 Correct 73 ms 26952 KB Output is correct
21 Correct 18 ms 13648 KB Output is correct
22 Correct 120 ms 41032 KB Output is correct
23 Correct 130 ms 40776 KB Output is correct
24 Correct 130 ms 35876 KB Output is correct
25 Correct 72 ms 23748 KB Output is correct
26 Correct 89 ms 24664 KB Output is correct
27 Correct 77 ms 22088 KB Output is correct

Subtask #8
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8784 KB Output is correct
2 Correct 2 ms 8784 KB Output is correct
3 Correct 2 ms 8784 KB Output is correct
4 Correct 2 ms 8784 KB Output is correct
5 Correct 2 ms 8784 KB Output is correct
6 Correct 2 ms 8784 KB Output is correct
7 Correct 2 ms 8784 KB Output is correct
8 Correct 2 ms 8884 KB Output is correct
9 Correct 2 ms 8784 KB Output is correct
10 Correct 106 ms 43080 KB Output is correct
11 Correct 57 ms 26952 KB Output is correct
12 Correct 142 ms 41044 KB Output is correct
13 Correct 73 ms 22212 KB Output is correct
14 Correct 109 ms 23220 KB Output is correct
15 Correct 3 ms 9052 KB Output is correct
16 Correct 3 ms 9040 KB Output is correct
17 Correct 3 ms 9040 KB Output is correct
18 Correct 50 ms 26440 KB Output is correct
19 Correct 74 ms 32856 KB Output is correct
20 Correct 66 ms 26448 KB Output is correct
21 Correct 121 ms 37704 KB Output is correct
22 Correct 133 ms 45128 KB Output is correct
23 Correct 75 ms 25532 KB Output is correct
24 Correct 86 ms 24004 KB Output is correct
25 Correct 74 ms 30280 KB Output is correct
26 Correct 112 ms 35912 KB Output is correct
27 Correct 102 ms 36680 KB Output is correct
28 Correct 68 ms 22088 KB Output is correct
29 Correct 61 ms 23488 KB Output is correct
30 Correct 73 ms 26952 KB Output is correct
31 Correct 18 ms 15184 KB Output is correct
32 Correct 110 ms 43168 KB Output is correct
33 Correct 103 ms 42312 KB Output is correct
34 Correct 108 ms 41732 KB Output is correct
35 Correct 33 ms 22212 KB Output is correct
36 Correct 71 ms 26184 KB Output is correct
37 Correct 59 ms 27008 KB Output is correct
38 Correct 18 ms 13648 KB Output is correct
39 Correct 120 ms 41032 KB Output is correct
40 Correct 130 ms 40776 KB Output is correct
41 Correct 130 ms 35876 KB Output is correct
42 Correct 72 ms 23748 KB Output is correct
43 Correct 89 ms 24664 KB Output is correct
44 Correct 77 ms 22088 KB Output is correct
45 Correct 21 ms 14292 KB Output is correct
46 Correct 130 ms 42568 KB Output is correct
47 Correct 138 ms 42024 KB Output is correct
48 Correct 131 ms 39252 KB Output is correct
49 Correct 104 ms 24372 KB Output is correct
50 Correct 99 ms 25672 KB Output is correct
51 Correct 84 ms 23124 KB Output is correct