Submission #874034

#	Time	Username	Problem	Language	Result	Execution time	Memory
874034		salmon	Friend (IOI14_friend)	C++14	100 / 100	24 ms	2396 KiB

friend

#include <bits/stdc++.h>
using namespace std;

int findSample(int N, int confidence[], int host[], int protocol[]){
    int cas = 0;

    for(int i = 1; i < N; i++){
        if(protocol[i] != 2){
            cas = 1;
        }
    }

    if(cas == 0){
        int big = 0;

        for(int i = 0; i < N; i++){
            big = max(big,confidence[i]);
        }

        return big;
    }

    for(int i = 1; i < N; i++){
        if(protocol[i] != 1){
            cas = 2;
        }
    }

    if(cas == 1){
        int big = 0;

        for(int i = 0; i < N; i++){
            big += confidence[i];
        }

        return big;
    }


    int sum = 0;

    for(int i = N - 1; i > 0; i--){
        if(protocol[i] == 0){
            if(confidence[i] > 0){
                confidence[host[i]] -= confidence[i];
                sum += confidence[i];
            }
        }
        else if(protocol[i] == 1){
            confidence[host[i]] = max(confidence[host[i]],max(confidence[i],confidence[i] + confidence[host[i]] ));
        }
        else if(protocol[i] == 2){
            confidence[host[i]] = max(confidence[host[i]],confidence[i]);
        }
    }

    if(confidence[0] > 0) sum += confidence[0];

    return sum;
}

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