Submission #1069264

#	Time	Username	Problem	Language	Result	Execution time	Memory
1069264		NeroZein	Friend (IOI14_friend)	C++17	27 / 100	18 ms	4156 KiB

friend

#include "friend.h"
#include<bits/stdc++.h>
using namespace std;

int dp[100009][2][2];

int findSample(int n,int confidence[],int host[],int protocol[]){
    for(int i=n-1;i>=0;i--) {

        //dp[i][1][0] += confidence[i];
        //dp[i][1][1] += confidence[i];
        if(i==0)break;
        int par=host[i];
        if(protocol[i]==0)
        {
            dp[par][0][1] += dp[i][0][1];//ok
            dp[par][0][0] += max(dp[i][1][1] + confidence[i], dp[i][0][1]);//ok
            dp[par][1][0] += dp[i][0][0];//ok
            dp[par][1][1] += dp[i][0][0];//ok
        }
        if(protocol[i]==1)
        {
            dp[par][0][1] = max(max(dp[par][1][1], dp[par][0][1]) + dp[i][1][1] + confidence[i], dp[par][0][1] + dp[i][0][0]);//ok
            dp[par][0][0] = max(dp[par][1][0] + dp[i][0][1], dp[par][0][0] + dp[i][0][0]);//ok
            dp[par][1][1] = max(dp[par][1][1] + dp[i][0][1], dp[par][1][1] + dp[i][1][1] + confidence[i]);//ok
            dp[par][1][0] += dp[i][0][1];//ok
        }
        if(protocol[i]==2)
        {
          dp[par][0][0] += dp[i][0][1];
          dp[par][0][1] += max(dp[i][1][1],dp[i][0][1]);
          dp[par][1][0] += dp[i][0][0];
          dp[par][1][1] += max(dp[i][0][1],dp[i][1][1]);

        }
        dp[par][0][1] = max(dp[par][0][1], dp[par][0][0]);
        dp[par][1][1] = max(dp[par][1][1], dp[par][1][0]);
        //cerr << i << ' ' << dp[0][0][0] << ' ' << dp[0][0][1] << ' ' << dp[0][1][0] << ' ' << dp[0][1][1] << '\n';
    }
  return max(dp[0][0][1], dp[0][1][1] + confidence[0]);
}

• Subtask 1: 0 / 11
• Subtask 2: 8 / 8
• Subtask 3: 0 / 8
• Subtask 4: 19 / 19
• Subtask 5: 0 / 23
• Subtask 6: 0 / 31