oj.uz

Submission #26406

# Submission time Handle Problem Language Result Execution time Memory
26406 2017-06-30T04:25:11 Z zscoder Fireworks (APIO16_fireworks) C++14
100 / 100
 313 ms 61192 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key

typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<ll> vi;
typedef long double ld; 
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
typedef set<int>::iterator sit;
typedef map<int,int>::iterator mit;
typedef vector<int>::iterator vit;

priority_queue<ll>* dp[300001];
vi adj[300001];
ll par[300001];
ll a[300001];
ll b[300001];

void dfs(int u)
{
	//cerr<<u<<' '<<par[u]<<'\n';
	if(adj[u].empty())
	{
		dp[u] = new priority_queue<ll>;
		dp[u]->push(par[u]);
		dp[u]->push(par[u]);
		a[u]=1;
		b[u]=-par[u];
		return ;
	}
	int lc = -1; int siz = 0;
	for(int i = 0; i < adj[u].size(); i++)
	{
		int v = adj[u][i];
		dfs(v);
		if(dp[v]->size()>siz)
		{
			siz=dp[v]->size();
			lc=v;
		}
	}
	dp[u]=dp[lc];
	a[u]=a[lc];
	b[u]=b[lc];
	for(int i=0;i<adj[u].size();i++)
	{
		int v = adj[u][i];
		if(v!=lc)
		{
			while(!dp[v]->empty())
			{
				dp[u]->push(dp[v]->top());
				dp[v]->pop();
			}
			a[u]+=a[v];
			b[u]+=b[v];
		}
	}
	while(a[u]>1)
	{
		ll x = dp[u]->top();
		a[u]--;
		b[u]+=x;
		dp[u]->pop();
	}
	if(u==0)
	{
		while(a[u]>0)
		{
			ll x = dp[u]->top();
			a[u]--;
			b[u]+=x;
			dp[u]->pop();
		}
		cout<<b[u]<<'\n';
		exit(0);
	}
	ll u1=dp[u]->top();
	dp[u]->pop();
	ll u2=dp[u]->top();
	dp[u]->pop();
	dp[u]->push(u2+par[u]);
	dp[u]->push(u1+par[u]);
	b[u]-=par[u];
}

int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	int n,m; cin>>n>>m;
	par[0]=0;
	n+=m;
	for(int i=1;i<n;i++)
	{
		int u; cin>>u;
		u--;
		cin>>par[i];
		adj[u].pb(i);
	}
	dfs(0);
}

Compilation message

fireworks.cpp: In function 'void dfs(int)':
fireworks.cpp:43:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < adj[u].size(); i++)
                   ^
fireworks.cpp:47:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(dp[v]->size()>siz)
                   ^
fireworks.cpp:56:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<adj[u].size();i++)
               ^

Subtask #1
7.0 / 7.0

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

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 18584 KB Output is correct
2 Correct 0 ms 18584 KB Output is correct
3 Correct 3 ms 18584 KB Output is correct
4 Correct 0 ms 18584 KB Output is correct
5 Correct 0 ms 18584 KB Output is correct
6 Correct 3 ms 18584 KB Output is correct
7 Correct 0 ms 18584 KB Output is correct
8 Correct 0 ms 18584 KB Output is correct
9 Correct 0 ms 18584 KB Output is correct
10 Correct 0 ms 18584 KB Output is correct
11 Correct 0 ms 18584 KB Output is correct
12 Correct 0 ms 18584 KB Output is correct
13 Correct 0 ms 18584 KB Output is correct
14 Correct 0 ms 18584 KB Output is correct
15 Correct 0 ms 18584 KB Output is correct
16 Correct 3 ms 18584 KB Output is correct
17 Correct 3 ms 18584 KB Output is correct
18 Correct 0 ms 18584 KB Output is correct
19 Correct 0 ms 18584 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 18584 KB Output is correct
2 Correct 0 ms 18584 KB Output is correct
3 Correct 3 ms 18584 KB Output is correct
4 Correct 3 ms 18584 KB Output is correct
5 Correct 3 ms 18584 KB Output is correct
6 Correct 0 ms 18584 KB Output is correct
7 Correct 0 ms 18584 KB Output is correct
8 Correct 3 ms 18584 KB Output is correct
9 Correct 0 ms 18584 KB Output is correct
10 Correct 0 ms 18584 KB Output is correct
11 Correct 0 ms 18584 KB Output is correct
12 Correct 0 ms 18584 KB Output is correct
13 Correct 3 ms 18584 KB Output is correct
14 Correct 0 ms 18584 KB Output is correct
15 Correct 0 ms 18584 KB Output is correct
16 Correct 3 ms 18584 KB Output is correct
17 Correct 0 ms 18584 KB Output is correct
18 Correct 0 ms 18584 KB Output is correct
19 Correct 0 ms 18584 KB Output is correct
20 Correct 0 ms 18584 KB Output is correct
21 Correct 0 ms 18584 KB Output is correct
22 Correct 0 ms 18584 KB Output is correct
23 Correct 0 ms 18584 KB Output is correct
24 Correct 0 ms 18584 KB Output is correct
25 Correct 0 ms 18584 KB Output is correct
26 Correct 3 ms 18584 KB Output is correct
27 Correct 3 ms 18584 KB Output is correct
28 Correct 0 ms 18584 KB Output is correct
29 Correct 0 ms 18584 KB Output is correct
30 Correct 0 ms 18584 KB Output is correct
31 Correct 0 ms 18584 KB Output is correct
32 Correct 0 ms 18716 KB Output is correct
33 Correct 6 ms 18716 KB Output is correct
34 Correct 0 ms 18716 KB Output is correct
35 Correct 3 ms 18716 KB Output is correct
36 Correct 0 ms 18856 KB Output is correct
37 Correct 3 ms 18860 KB Output is correct
38 Correct 3 ms 18848 KB Output is correct
39 Correct 3 ms 18848 KB Output is correct
40 Correct 0 ms 19064 KB Output is correct
41 Correct 3 ms 19060 KB Output is correct
42 Correct 3 ms 18716 KB Output is correct
43 Correct 3 ms 18960 KB Output is correct
44 Correct 3 ms 18888 KB Output is correct
45 Correct 3 ms 18888 KB Output is correct
46 Correct 3 ms 19280 KB Output is correct
47 Correct 3 ms 19264 KB Output is correct
48 Correct 0 ms 19168 KB Output is correct
49 Correct 3 ms 19124 KB Output is correct
50 Correct 6 ms 18988 KB Output is correct
51 Correct 3 ms 18984 KB Output is correct
52 Correct 0 ms 19012 KB Output is correct
53 Correct 0 ms 19152 KB Output is correct
54 Correct 0 ms 19200 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 18584 KB Output is correct
2 Correct 0 ms 18584 KB Output is correct
3 Correct 3 ms 18584 KB Output is correct
4 Correct 3 ms 18584 KB Output is correct
5 Correct 3 ms 18584 KB Output is correct
6 Correct 0 ms 18584 KB Output is correct
7 Correct 0 ms 18584 KB Output is correct
8 Correct 3 ms 18584 KB Output is correct
9 Correct 0 ms 18584 KB Output is correct
10 Correct 0 ms 18584 KB Output is correct
11 Correct 0 ms 18584 KB Output is correct
12 Correct 0 ms 18584 KB Output is correct
13 Correct 3 ms 18584 KB Output is correct
14 Correct 0 ms 18584 KB Output is correct
15 Correct 0 ms 18584 KB Output is correct
16 Correct 3 ms 18584 KB Output is correct
17 Correct 0 ms 18584 KB Output is correct
18 Correct 0 ms 18584 KB Output is correct
19 Correct 0 ms 18584 KB Output is correct
20 Correct 0 ms 18584 KB Output is correct
21 Correct 0 ms 18584 KB Output is correct
22 Correct 0 ms 18584 KB Output is correct
23 Correct 0 ms 18584 KB Output is correct
24 Correct 0 ms 18584 KB Output is correct
25 Correct 0 ms 18584 KB Output is correct
26 Correct 3 ms 18584 KB Output is correct
27 Correct 3 ms 18584 KB Output is correct
28 Correct 0 ms 18584 KB Output is correct
29 Correct 0 ms 18584 KB Output is correct
30 Correct 0 ms 18584 KB Output is correct
31 Correct 0 ms 18584 KB Output is correct
32 Correct 0 ms 18716 KB Output is correct
33 Correct 6 ms 18716 KB Output is correct
34 Correct 0 ms 18716 KB Output is correct
35 Correct 3 ms 18716 KB Output is correct
36 Correct 0 ms 18856 KB Output is correct
37 Correct 3 ms 18860 KB Output is correct
38 Correct 3 ms 18848 KB Output is correct
39 Correct 3 ms 18848 KB Output is correct
40 Correct 0 ms 19064 KB Output is correct
41 Correct 3 ms 19060 KB Output is correct
42 Correct 3 ms 18716 KB Output is correct
43 Correct 3 ms 18960 KB Output is correct
44 Correct 3 ms 18888 KB Output is correct
45 Correct 3 ms 18888 KB Output is correct
46 Correct 3 ms 19280 KB Output is correct
47 Correct 3 ms 19264 KB Output is correct
48 Correct 0 ms 19168 KB Output is correct
49 Correct 3 ms 19124 KB Output is correct
50 Correct 6 ms 18988 KB Output is correct
51 Correct 3 ms 18984 KB Output is correct
52 Correct 0 ms 19012 KB Output is correct
53 Correct 0 ms 19152 KB Output is correct
54 Correct 0 ms 19200 KB Output is correct
55 Correct 13 ms 19380 KB Output is correct
56 Correct 39 ms 21908 KB Output is correct
57 Correct 63 ms 24160 KB Output is correct
58 Correct 93 ms 25852 KB Output is correct
59 Correct 169 ms 28040 KB Output is correct
60 Correct 176 ms 30264 KB Output is correct
61 Correct 196 ms 32752 KB Output is correct
62 Correct 233 ms 33964 KB Output is correct
63 Correct 299 ms 36760 KB Output is correct
64 Correct 313 ms 37344 KB Output is correct
65 Correct 103 ms 55960 KB Output is correct
66 Correct 119 ms 55956 KB Output is correct
67 Correct 159 ms 27956 KB Output is correct
68 Correct 193 ms 50944 KB Output is correct
69 Correct 239 ms 49128 KB Output is correct
70 Correct 236 ms 49132 KB Output is correct
71 Correct 169 ms 61192 KB Output is correct
72 Correct 176 ms 61024 KB Output is correct
73 Correct 153 ms 57492 KB Output is correct
74 Correct 196 ms 57696 KB Output is correct
75 Correct 169 ms 58400 KB Output is correct
76 Correct 166 ms 58492 KB Output is correct
77 Correct 173 ms 57356 KB Output is correct
78 Correct 176 ms 54084 KB Output is correct
79 Correct 213 ms 58448 KB Output is correct