제출 #103786

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
103786		naoai	친구 (IOI14_friend)	C++14	16 / 100	4 ms	452 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; i > 0; -- i) {
        int h = host[i];

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

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

컴파일 시 표준 에러 (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; i > 0; -- i) {
  ^~~

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