Submission #122520

#	Time	Username	Problem	Language	Result	Execution time	Memory
122520		brcode	Friend (IOI14_friend)	C++14	100 / 100	34 ms	2656 KiB

friend

#include <iostream>
#include <vector>
#include <set>
#include "friend.h"
using namespace std;
const int MAXN = 1e3+5;
bool visited[MAXN];
bool visited2[MAXN];
int val[MAXN];
vector<int> v1[MAXN];
int first;
 
set<int> s1;
int dprotocol[MAXN][6];
int findSample(int n, int confidence[], int host[], int protocol[]){
    int ans = 0;
    for(int i=n-1;i>=0;i--){
        if(protocol[i] == 0){
            ans+=confidence[i];
            confidence[host[i]] = max(0,confidence[host[i]]-confidence[i]);
        }
        if(protocol[i] == 1){
            confidence[host[i]] += confidence[i];
        }
        if(protocol[i] == 2){
            confidence[host[i]] = max(confidence[host[i]],confidence[i]);
        }
    }
    return ans+confidence[0];
}

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