Submission #31172

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
31172	2017-08-12 09:10:32	cscandkswon	Friend (IOI14_friend)	C++14	27 / 100	56 ms	3972 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
#include "friend.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN=100000;
int p[MAXN], q[MAXN];
int findSample(int n,int confidence[],int host[],int protocol[]){
  int i;
  for(i=0; i<n; i++) p[i]=confidence[i], q[i]=0;
  for(i=n-1; i>0; i--){
    if(protocol[i]==0){
      p[host[i]]=p[host[i]]+q[i];
      q[host[i]]=q[host[i]]+p[i];
    }
    else if(protocol[i]==1){
      p[host[i]]=max(p[host[i]]+p[i], max(p[host[i]]+q[i], q[host[i]]+p[i]));
      q[host[i]]=q[host[i]]+q[i];
    }
    else{
      p[host[i]]=max(p[host[i]]+q[i], q[host[i]]+p[i]);
      q[host[i]]=q[host[i]]+q[i];
    }
  }
  return max(p[0], q[0]);
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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