Submission #1155476

#TimeUsernameProblemLanguageResultExecution timeMemory
1155476alexddFriend (IOI14_friend)C++20
50 / 100
1 ms328 KiB
#include "friend.h" #include<bits/stdc++.h> using namespace std; int dp[100005][2]; int findSample(int n, int confidence[], int host[], int protocol[]) { for(int i=0;i<n;i++) { dp[i][1] = confidence[i]; } for(int i=n-1;i>0;i--) { if(protocol[i]==0) { dp[host[i]][0] += dp[i][1]; dp[host[i]][1] += dp[i][0]; } else if(protocol[i]==1) { dp[host[i]][0] += dp[i][0]; dp[host[i]][1] += dp[i][1]; } else { dp[host[i]][0] = max(dp[host[i]][0] + dp[i][1], dp[host[i]][1] + dp[i][0]); dp[host[i]][1] += dp[i][0]; } dp[host[i]][1] = max(dp[host[i]][1], dp[host[i]][0]); } int mxm=0; for(int i=0;i<n;i++) mxm = max(mxm, max(dp[i][0],dp[i][1])); return mxm; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...