Submission #741656

#	Time	Username	Problem	Language	Result	Execution time	Memory
741656		bane	Friend (IOI14_friend)	C++17	0 / 100	1 ms	468 KiB

friend

#include "friend.h"
#include<bits/stdc++.h>
using namespace std;
const int maxN = (int)1e5 + 5;
int sz[maxN], link[maxN];

int findSample(int n, int confidence[], int host[], int protocol[]){
	int dp[n][2];
	memset(dp, 0, sizeof(dp));
	for (int i = 0; i < n; i++){
		dp[i][1] = confidence[i];
	}
	for (int i = n; i>=1; i--){
		if (protocol[i] == 0) {
			dp[host[i]][0] += max(dp[i][0], dp[i][1]);
			dp[host[i]][1] += dp[i][0];
		} else if (protocol[i] == 1) {
			dp[host[i]][1] += max(dp[i][0], dp[i][1]);
			dp[host[i]][1] = max(dp[host[i]][1], dp[host[i]][0] + dp[i][1]);
			dp[host[i]][0] += dp[i][0];
		} else {
			dp[host[i]][1] += dp[i][0];
			dp[host[i]][1] = max(dp[host[i]][1], dp[host[i]][0] + dp[i][1]);
			dp[host[i]][0] += dp[i][0];
		}
	}
}

Compilation message (stderr)

friend.cpp: In function 'int findSample(int, int*, int*, int*)':
friend.cpp:27:1: warning: no return statement in function returning non-void [-Wreturn-type]
   27 | }
      | ^

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