| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 582609 |
2022-06-24T07:27:35 Z |
반딧불(#8370) |
Magic Tree (CEOI19_magictree) |
C++17 |
|
420 ms |
333900 KB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int lc[10000002], rc[10000002];
ll sum[10000002];
int nodeCnt;
void update(int i, int l, int r, int x, ll v){ /// v��ŭ ���Ѵ�
if(l==r){
sum[i] += v;
return;
}
int m = (l+r)>>1;
if(x<=m){
if(!lc[i]) lc[i] = ++nodeCnt;
update(lc[i], l, m, x, v);
}
else{
if(!rc[i]) rc[i] = ++nodeCnt;
update(rc[i], m+1, r, x, v);
}
sum[i] = (lc[i] ? sum[lc[i]] : 0) + (rc[i] ? sum[rc[i]] : 0);
}
ll query(int i, int l, int r, int s, int e){
if(r<s || e<l) return 0;
if(s<=l && r<=e) return sum[i];
int m = (l+r)>>1;
ll ret = 0;
if(s<=m && lc[i]) ret += query(lc[i], l, m, s, e);
if(m<e && rc[i]) ret += query(rc[i], m+1, r, s, e);
return ret;
}
void nextRemove(int i, int l, int r, int x, ll &v){
if(r<x) return;
if(l==r){
ll tmp = min(sum[i], v);
sum[i] -= tmp;
v -= tmp;
return;
}
int m = (l+r)>>1;
if(lc[i] && sum[lc[i]]) nextRemove(lc[i], l, m, x, v);
if(v && rc[i] && sum[rc[i]]) nextRemove(rc[i], m+1, r, x, v);
sum[i] = (lc[i] ? sum[lc[i]] : 0) + (rc[i] ? sum[rc[i]] : 0);
}
void mergeSet(int A, int B, int l, int r){
if(l==r){
sum[A] += sum[B];
return;
}
int m = (l+r)>>1;
if(lc[B]){
if(!lc[A]) lc[A] = ++nodeCnt;
mergeSet(lc[A], lc[B], l, m);
}
if(rc[B]){
if(!rc[A]) rc[A] = ++nodeCnt;
mergeSet(rc[A], rc[B], m+1, r);
}
sum[A] = (lc[A] ? sum[lc[A]] : 0) + (rc[A] ? sum[rc[A]] : 0);
}
struct Fruit{
int v, d; ll w;
Fruit(){}
Fruit(int v, int d, ll w): v(v), d(d), w(w){}
};
int n, m, k;
int par[100002];
vector<int> child[100002];
int state[100002];
Fruit fruit[100002];
int day[100002];
ll weight[100002];
int root[100002];
void renumber(){
vector<int> dVec;
for(int i=1; i<=m; i++) dVec.push_back(fruit[i].d);
sort(dVec.begin(), dVec.end());
dVec.erase(unique(dVec.begin(), dVec.end()), dVec.end());
for(int i=1; i<=m; i++) fruit[i].d = lower_bound(dVec.begin(), dVec.end(), fruit[i].d) - dVec.begin() + 1;
k = (int)dVec.size();
}
void dfs(int x){
root[x] = ++nodeCnt;
for(auto y: child[x]){
dfs(y);
mergeSet(root[x], root[y], 1, k);
}
if(day[x]){
ll v = query(root[x], 1, k, 1, day[x]-1);
if(v < weight[x]){ /// v: ���� day[x]������ ����
update(root[x], 1, k, day[x], weight[x]);
v = weight[x];
nextRemove(root[x], 1, k, day[x]+1, v);
// printf("%d: %lld\n", x, v);
}
}
}
int main(){
scanf("%d %d %d", &n, &m, &k);
for(int i=2; i<=n; i++){
scanf("%d", &par[i]);
child[par[i]].push_back(i);
}
for(int i=1; i<=m; i++){
int v, d, w;
scanf("%d %d %d", &v, &d, &w);
fruit[i] = Fruit(v, d, w);
}
// renumber();
for(int i=1; i<=m; i++){
day[fruit[i].v] = fruit[i].d;
weight[fruit[i].v] = fruit[i].w;
}
dfs(1);
printf("%lld", query(root[1], 1, k, 1, k));
}
Compilation message
magictree.cpp: In function 'int main()':
magictree.cpp:112:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
112 | scanf("%d %d %d", &n, &m, &k);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
magictree.cpp:114:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
114 | scanf("%d", &par[i]);
| ~~~~~^~~~~~~~~~~~~~~
magictree.cpp:120:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
120 | scanf("%d %d %d", &v, &d, &w);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
2664 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
127 ms |
55224 KB |
Output is correct |
| 2 |
Runtime error |
420 ms |
333900 KB |
Execution killed with signal 11 |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
11732 KB |
Output is correct |
| 2 |
Incorrect |
2 ms |
3156 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
68 ms |
11144 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
2664 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
12 ms |
5204 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
2664 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
2664 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
