# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
42707 | imaxblue | Fireworks (APIO16_fireworks) | C++14 | 14 ms | 14756 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define pii pair<int, int>
#define p3i pair<pii, int>
#define pll pair<ll, ll>
#define p3l pair<pll, ll>
#define lseg L, (L+R)/2, N*2+1
#define rseg (L+R)/2+1, R, N*2+2
#define ub upper_bound
#define lb lower_bound
#define pq priority_queue
#define MN 1000000007
#define fox(k, x) for (int k=0; k<x; ++k)
#define fox1(k, x) for (int k=1; k<=x; ++k)
#define foxr(k, x) for (int k=x-1; k>=0; --k)
#define fox1r(k, x) for (int k=x; k>0; --k)
#define ms multiset
#define flood(x) memset(x, 0x3f3f3f3f, sizeof x)
#define drain(x) memset(x, 0, sizeof x)
#define rng() (rand() >> 3)*rand()
#define scan(X) do{while((X=getchar())<'0'); for(X-='0'; '0'<=(_=getchar()); X=(X<<3)+(X<<1)+_-'0');}while(0)
char _;
#define pi 3.14159265358979323846
int n, m, p, d;
ll c;
vector<pii> v[600006];
p3i ans[600005];
void dfs(int N, int D){
vector<pii> t;
int sz=0, cnt=0;
fox(l, v[N].size()){
dfs(v[N][l].x, v[N][l].y);
t.pb(mp(ans[v[N][l].x].x.x, 1));
t.pb(mp(ans[v[N][l].x].x.y, 1));
sz+=2;
}
sort(t.begin(), t.end());
ans[N].y=sz/2;
fox(l, t.size()){
cnt+=t[l].y;
//cout << t[l].x << ' ' << t[l].y << ' ' << cnt<< endl;
if (cnt*2>sz){
ans[N].x.y=t[l].x;
if (sz%4==0 && t[l].y==1){
//cout<< "*";
ans[N].x.x=t[l-1].x;
} else ans[N].x.x=ans[N].x.y;
break;
}
}
fox(l, v[N].size()){
if (ans[N].x.x<ans[v[N][l].x].x.x) c+=1LL*(ans[v[N][l].x].x.x-ans[N].x.x);
else if (ans[N].x.x>ans[v[N][l].x].x.x) c+=1LL*(ans[N].x.x-ans[v[N][l].x].x.x);
}
if (N>n){
ans[N]=mp(mp(0, 0), 1);
}
ans[N].x.x+=D;
ans[N].x.y+=D;
//cout << N << ' ' << ans[N].x.x << ' ' << ans[N].x.y << ' ' << ans[N].y << ' ' << c<< endl;
}
int main(){
scanf("%i%i", &n, &m);
fox1(l, n-1){
scanf("%i%i", &p, &d);
v[p].pb(mp(l+1, d));
}
fox1(l, m){
scanf("%i%i", &p, &d);
v[p].pb(mp(l+n, d));
}
dfs(1, 0);
cout << c;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |