# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1115886 | 2024-11-21T03:30:53 Z | guagua0407 | Magic Tree (CEOI19_magictree) | C++17 | 121 ms | 38632 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]; set<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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 8784 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 59 ms | 21328 KB | Output is correct |
2 | Correct | 38 ms | 19524 KB | Output is correct |
3 | Correct | 121 ms | 38632 KB | Output is correct |
4 | Correct | 73 ms | 21700 KB | Output is correct |
5 | Correct | 94 ms | 22600 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 9040 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 116 ms | 35400 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 8784 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 10064 KB | Output is correct |
2 | Correct | 25 ms | 14268 KB | Output is correct |
3 | Correct | 28 ms | 14160 KB | Output is correct |
4 | Correct | 25 ms | 14160 KB | Output is correct |
5 | Correct | 20 ms | 16076 KB | Output is correct |
6 | Correct | 30 ms | 16940 KB | Output is correct |
7 | Correct | 26 ms | 17744 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 8784 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 8784 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |