Submission #12806

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
12806	2015-01-04 08:40:58	qja0950	Friend (IOI14_friend)	C++98	100 / 100	36 ms	3048 KiB

friend

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "friend.h"
#include <algorithm>
using namespace std;
#define MAX_N 101101
int N;
int Dy[MAX_N][2];
int findSample(int n,int confidence[],int host[],int protocol[]) {
    N = n;
    for(int i=0; i<N; i++)
        Dy[i][1] = confidence[i];
    
    for(int i=N; i>=1; i--) {
        int p = protocol[i];
        int h = host[i];
        
        int i0 = Dy[i][0], i1 = Dy[i][1];
        int h0 = Dy[h][0], h1 = Dy[h][1];
        
        if(p == 0) {
            Dy[h][0] += max(i0, i1);
            Dy[h][1] += i0;
        }else if(p == 1) {
            Dy[h][0] += i0;
            Dy[h][1] = max(h1 + i1, max(h1 + i0, h0 + i1) );
        }else if(p == 2) {
            Dy[h][0] += i0;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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