Subset Selection--is hackerblocks ide not working?

#1

I got WA on submission and when i unlocked the test cases ,i am geting exactly same answer as the input file…The same thing happened with fuel collection also.Correct it fast.
Link to code–https://ide.codingblocks.com/s/162579

#2

There might be some internal issue i think.
Will be fixed asap

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.

#4

#include<bits/stdc++.h>
using namespace std;
#define int long long int
stringstream vin,vout;
#define db(…) __f(#VA_ARGS, VA_ARGS)

template
void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << ‘\n’; }
template <typename Arg1, typename… Args>
void __f(const char* names, Arg1&& arg1, Args&&… args) {
const char* comma = strchr(names + 1, ‘,’);
cout.write(names, comma - names) << " : " << arg1 << " | “; __f(comma + 1, args…);
}
vector vec;
int n,n1,n2,startPoint,k=0,endPoint,ans=0,cnt=0,q=0,qry=0;
int nodes,edges;
unordered_map<int,list<pair<int,int>>> adjList;
void show(){
for(auto x:adjList){
cout<< x.first << “->”;
for(auto y:x.second){
cout <<”("<< y.first <<","<<y.second<<")";
}
cout <<endl;
}
}
unordered_map<int,unordered_map<int,unordered_map<bool,int>>>dp;
int dfs(int src,int par,bool taken){
if(dp[src][par][taken])return dp[src][par][taken];
int k=0;
for(auto x: adjList[src]){
if(x.first!=par){

            if(taken==0){
            k+=max(dfs(x.first,src,0),dfs(x.first,src,1)+vec[x.first]);
            }else{
            k+=dfs(x.first,src,0);

            }
            // db(k,x.first);
    }
}
return dp[src][par][taken]=k;

}

int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int t;
//cin >>t; while (t–)
{
cin >>n1;
vec.clear();
vec.resize(n1+1,0);
for(int q=0;q<n1;q++){
cin >> vec[q+1];
}

    adjList.clear();

    nodes=n1;edges=nodes-1;
    for(int i=0;i<edges;i++){
            cin >> startPoint >> endPoint;
            adjList[startPoint].push_back(make_pair(endPoint,k));
            adjList[endPoint].push_back(make_pair(startPoint,k));
    } 
    // show();
    ans=0;
    
    // for(int i=1;i<=nodes;i++)
           ans=max(ans,max(dfs(2,-1,0),dfs(2,-1,1)+vec[2]));
    
    cout << ans<<endl;

  
}
return 0;

}