Submission #874043

#	Time	Username	Problem	Language	Result	Execution time	Memory
874043		simuyu	Friend (IOI14_friend)	C++14	0 / 100	0 ms	600 KiB

friend

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

int findSample(int n, int confidence[], int host[], int protocol[]) {
    int p = protocol[1];
    bool st234 = true;
    for (int idx=2; idx<n; idx++) {
        if (protocol[idx] != p) {
            st234=false;
            break;
        }
    }

    if (st234) {
        // subtasks 2, 3, 4
        if (p==0) { // IAmYourFriend, st4
            // just get all pairs by host and host index
            int res = 0;
            for (int guest=1; guest<n; guest++) {
                res = max(res, confidence[host[guest]] + confidence[guest] );
            }
            return res;

        } else if (p==1) { // MyFriendsAreYourFriends, st2
            // nobody is freinds lol, just get max
            int res = 0;
            for (int person=0; person<n; person++) {
                res = max(res, confidence[person]);
            }
            return res;

        } else if (p==2) { // WeAreYourFriends, st3
            // it's just all of them summed up
            int res = 0;
            for (int person=0; person<n; person++) {
                res += confidence[person];
            }
            return res;

        } else {
            // smtg weird
            return -1;

        }
    } else {
        // do whole graph with all. st1 or st5 (or unsolved st6)
        return 0; // TODO
    }

}

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