#include "friend.h"
#include<bits/stdc++.h>
using namespace std;
#define N 100010
typedef long long int ll;
ll cost[N];
vector<ll> adj[N];
int dp[N];
int solve(int i, int p){
// Either take or do not take thsi value.
// If we do not take this value, all subtrees are available for taking, so sum up dp across that.
// If we do take this value, we sum up all secondary subtrees.
if (dp[i]==-1){
int ans1 = 0;
int ans2 = cost[i];
for (int x: adj[i]){
if (x==p||x==i) continue;
ans1+=solve(x,i);
}
for (int x: adj[i]){
if (x==p||x==i) continue;
for (int y: adj[x]){
if(y==i || y ==p||y==x) continue;
ans2+=solve(y,x);
}
}
dp[i]=max(ans1,ans2);
}
return dp[i];
}
int findSample(int n, int c[], int h[], int p[]){
int sum = 0;
ll mx = 0;
bool allOne = true;
int prot[3];
for (int i= 0 ; i < 3; i++) prot[i] = 0;
for (int i = 0 ; i< n; i++) {
cost[i] = c[i];
sum += c[i];
if (c[i]!=1)allOne=false;
mx = max(mx,cost[i]);
}
for (int i =1; i < n; i++){
prot[p[i]]++;
}
int ans = 0;
if (n <= 10){
for (int i =1;i<n;i++){
if(p[i]==1 or p[i]==2){
for (int x: adj[h[i]]){
adj[x].push_back(i);
adj[i].push_back(x);
}
}
if(p[i]==0 or p[i]==2){
adj[i].push_back(h[i]);
adj[h[i]].push_back(i);
}
}
for (int bm =0 ; bm < (1<<n); bm++){
int sum = 0;
bool works = true;
bool vis[N];
for (int i =0 ; i < n; i++) vis[i] = false;
for (int j =0 ; j < n; j++){
if ((bm&(1<<j))>0) {
vis[j]=true;
sum+=c[j];
}
}
for (int i = 0 ; i < n; i++){
if (vis[i]){
for (int x:adj[i]) if(vis[x])works=false;
}
}
if (!works)continue;
ans = max(ans,sum);
}
}
else if (prot[1]==n-1){
ans = sum;
}
else if (prot[2]==n-1){
ans = mx;
}
else if (prot[0] == n-1){
for (int i = 1; i < n; i++){
adj[i].push_back(h[i]);
adj[h[i]].push_back(i);
}
for (int i = 0 ; i < n; i++) dp[i] = -1;
ans = solve(0,0);
}
else if(allOne && prot[2]==0){
for (int i = 1; i < n; i++){
if (p[i]==0){
adj[i].push_back(h[i]);
adj[h[i]].push_back(i);
}
else{
if(adj[h[i]].size()>1)continue;
if(adj[h[i]].size()==1){
for (int x:adj[h[i]]){
adj[h[i]].push_back(x);
adj[x].push_back(h[i]);
}
}
else ans+=c[i];
}
}
ans +=solve(0,0);
}
return ans;
}
void readInput(){
int n; cin>>n;
int c[n], h[n], p[n];
for (int i = 0; i < n; i++) cin>>c[i];
for (int i =1 ; i < n; i++) cin>>h[i]>>p[i];
cout<<findSample(n,c,h,p)<<'\n';
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
2764 KB |
Output is correct |
2 |
Correct |
2 ms |
2636 KB |
Output is correct |
3 |
Correct |
2 ms |
2636 KB |
Output is correct |
4 |
Correct |
2 ms |
2636 KB |
Output is correct |
5 |
Correct |
2 ms |
2764 KB |
Output is correct |
6 |
Correct |
2 ms |
2636 KB |
Output is correct |
7 |
Correct |
2 ms |
2636 KB |
Output is correct |
8 |
Correct |
3 ms |
2764 KB |
Output is correct |
9 |
Correct |
2 ms |
2636 KB |
Output is correct |
10 |
Correct |
2 ms |
2636 KB |
Output is correct |
11 |
Correct |
2 ms |
2636 KB |
Output is correct |
12 |
Correct |
2 ms |
2636 KB |
Output is correct |
13 |
Correct |
2 ms |
2764 KB |
Output is correct |
14 |
Correct |
2 ms |
2764 KB |
Output is correct |
15 |
Correct |
2 ms |
2636 KB |
Output is correct |
16 |
Correct |
2 ms |
2764 KB |
Output is correct |
17 |
Correct |
2 ms |
2636 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
2764 KB |
Output is correct |
2 |
Correct |
2 ms |
2764 KB |
Output is correct |
3 |
Correct |
2 ms |
2764 KB |
Output is correct |
4 |
Correct |
2 ms |
2764 KB |
Output is correct |
5 |
Correct |
2 ms |
2764 KB |
Output is correct |
6 |
Correct |
3 ms |
2764 KB |
Output is correct |
7 |
Correct |
2 ms |
2764 KB |
Output is correct |
8 |
Correct |
2 ms |
2764 KB |
Output is correct |
9 |
Correct |
2 ms |
2764 KB |
Output is correct |
10 |
Correct |
3 ms |
2764 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
2764 KB |
Output is correct |
2 |
Correct |
2 ms |
2764 KB |
Output is correct |
3 |
Correct |
2 ms |
2636 KB |
Output is correct |
4 |
Correct |
2 ms |
2764 KB |
Output is correct |
5 |
Correct |
2 ms |
2764 KB |
Output is correct |
6 |
Correct |
3 ms |
2736 KB |
Output is correct |
7 |
Correct |
2 ms |
2764 KB |
Output is correct |
8 |
Correct |
2 ms |
2764 KB |
Output is correct |
9 |
Correct |
2 ms |
2636 KB |
Output is correct |
10 |
Correct |
2 ms |
2764 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
2764 KB |
Output is correct |
2 |
Correct |
2 ms |
2636 KB |
Output is correct |
3 |
Correct |
3 ms |
2764 KB |
Output is correct |
4 |
Correct |
2 ms |
2636 KB |
Output is correct |
5 |
Correct |
3 ms |
2764 KB |
Output is correct |
6 |
Correct |
3 ms |
2764 KB |
Output is correct |
7 |
Correct |
2 ms |
2764 KB |
Output is correct |
8 |
Correct |
4 ms |
2764 KB |
Output is correct |
9 |
Correct |
2 ms |
2636 KB |
Output is correct |
10 |
Correct |
2 ms |
2764 KB |
Output is correct |
11 |
Correct |
3 ms |
2764 KB |
Output is correct |
12 |
Correct |
2 ms |
2764 KB |
Output is correct |
13 |
Correct |
3 ms |
2764 KB |
Output is correct |
14 |
Correct |
2 ms |
2764 KB |
Output is correct |
15 |
Correct |
3 ms |
2764 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
2636 KB |
Output is correct |
2 |
Correct |
3 ms |
2764 KB |
Output is correct |
3 |
Correct |
2 ms |
2808 KB |
Output is correct |
4 |
Correct |
2 ms |
2636 KB |
Output is correct |
5 |
Correct |
2 ms |
2636 KB |
Output is correct |
6 |
Correct |
2 ms |
2636 KB |
Output is correct |
7 |
Correct |
2 ms |
2636 KB |
Output is correct |
8 |
Correct |
2 ms |
2636 KB |
Output is correct |
9 |
Correct |
3 ms |
2764 KB |
Output is correct |
10 |
Correct |
2 ms |
2764 KB |
Output is correct |
11 |
Incorrect |
2 ms |
2780 KB |
Output isn't correct |
12 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
2764 KB |
Output is correct |
2 |
Correct |
3 ms |
2640 KB |
Output is correct |
3 |
Correct |
2 ms |
2644 KB |
Output is correct |
4 |
Correct |
2 ms |
2768 KB |
Output is correct |
5 |
Correct |
2 ms |
2768 KB |
Output is correct |
6 |
Correct |
2 ms |
2640 KB |
Output is correct |
7 |
Correct |
2 ms |
2764 KB |
Output is correct |
8 |
Correct |
2 ms |
2636 KB |
Output is correct |
9 |
Correct |
3 ms |
2636 KB |
Output is correct |
10 |
Correct |
2 ms |
2636 KB |
Output is correct |
11 |
Correct |
2 ms |
2764 KB |
Output is correct |
12 |
Incorrect |
31 ms |
4564 KB |
Output isn't correct |
13 |
Halted |
0 ms |
0 KB |
- |