제출 #1316173

#제출 시각아이디문제언어결과실행 시간메모리
1316173boclobanchat친구 (IOI14_friend)C++20
35 / 100
1 ms332 KiB
#include"friend.h" #include<bits/stdc++.h> using namespace std; const int MAXN=1e5+5; int dp[MAXN][2]; int findSample(int n,int confidence[],int host[],int protocol[]) { for(int i=0;i<n;i++) dp[i][0]=0,dp[i][1]=confidence[i]; for(int i=n-1;i;i--) { if(protocol[i]==0) { dp[host[i]][1]+=dp[i][0]; dp[host[i]][0]+=max(dp[i][0],dp[i][1]); } else if(protocol[i]==1) { dp[host[i]][1]+=max(dp[i][0],dp[i][1]); dp[host[i]][0]+=dp[i][0]; } else { dp[host[i]][1]=max(dp[host[i]][1]+dp[i][0],dp[host[i]][0]+dp[i][1]); dp[host[i]][0]+=dp[i][0]; } } return max(dp[0][0],dp[0][1]); }
#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...