Submission #1066172

#	Time	Username	Problem	Language	Result	Execution time	Memory
1066172		mc061	Friend (IOI14_friend)	C++17	27 / 100	1 ms	444 KiB

friend

#pragma once 
#include <bits/stdc++.h>
using namespace std;
 
const int N = 1e5+6;
 
int dp[N][3]={};
 
int findSample(int n,int confidence[],int host[],int protocol[]) {
    for (int i = 0; i < n; ++i) {
        dp[i][2] += confidence[i];
    }
    for (int i = n - 1; i > 0; --i) {
        int par = host[i];
        if (protocol[i] == 0) {
            dp[par][0] += max({dp[i][0], dp[i][1], dp[i][2]});
            dp[par][1] += max({dp[i][0]});
            dp[par][2] += dp[i][0];
        }
        if (protocol[i] == 1) {
            /*take nothing*/
            dp[par][0] += dp[i][0];
            /*take one of them*/
            dp[par][1] += max({dp[i][0], dp[i][1], dp[i][2]});
            dp[par][2] += max({dp[i][0], dp[i][1], dp[i][2]});
        }
        if (protocol[i] == 2) {
            dp[par][0] += dp[i][0];
            dp[par][1] += max(dp[i][0], dp[i][2]);
            dp[par][2] += max(dp[i][0], dp[i][1]);
        }
    }
    return max({dp[0][0], dp[0][1], dp[0][2]});
}

Compilation message (stderr)

friend.cpp:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

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