답안 #103786

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
103786	2019-04-02T16:21:05 Z	naoai	친구 (IOI14_friend)	C++14	16 / 100	4 ms	452 KB

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]);
}

Compilation message

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.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Incorrect	2 ms	384 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #2
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	384 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	3 ms	384 KB	Output is correct
4	Correct	4 ms	384 KB	Output is correct
5	Correct	3 ms	384 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	452 KB	Output is correct
8	Correct	3 ms	384 KB	Output is correct
9	Correct	3 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct

Subtask #3
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	3 ms	384 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	3 ms	384 KB	Output is correct
5	Correct	4 ms	384 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	3 ms	384 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	3 ms	384 KB	Output is correct
10	Correct	3 ms	384 KB	Output is correct