Submission #103802

#	Time	Username	Problem	Language	Result	Execution time	Memory
103802		naoai	Friend (IOI14_friend)	C++14	100 / 100	32 ms	3236 KiB

friend

#include "friend.h"
#include <bits/stdc++.h>

using namespace std;

const int nmax = 1e5 + 5;

int d[nmax + 1][2];

int findSample(int n,int confidence[],int host[],int protocol[]){
    for (int i = 0; i < n; ++ i)
        d[i][1] = confidence[i];

	for (int i = n - 1; i > 0; -- i) {
        int h = host[i];

        int x = d[h][0], y = d[h][1];

        if (protocol[i] == 0) {
            d[h][0] = x + max(d[i][0], d[i][1]);
            d[h][1] = y + d[i][0];
        } else if (protocol[i] == 1) {
            d[h][0] = x + d[i][0];
            d[h][1] = max(y + max(d[i][0], d[i][1]), x + d[i][1]);
        } else {
            d[h][0] = x + d[i][0];
            d[h][1] = max(x + d[i][1], y + d[i][0]);
        }
	}

	return max(d[0][0], d[0][1]);
}

Compilation message (stderr)

friend.cpp: In function 'int findSample(int, int*, int*, int*)':
friend.cpp:11:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
     for (int i = 0; i < n; ++ i)
     ^~~
friend.cpp:14:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  for (int i = n - 1; i > 0; -- i) {
  ^~~

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