Submission #874060

#TimeUsernameProblemLanguageResultExecution timeMemory
874060dzuizzFriend (IOI14_friend)C++14
16 / 100
1 ms348 KiB
// Subtask 3

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

int findSample(int n, int confidence[], int host[], int protocol[]) {
    bool subtask2 = 1, subtask3 = 1;
    for (int i=1; i<n; i++) {
        if (protocol[i] != 1) subtask2 = 0;
        if (protocol[i] != 2) subtask3 = 0;
    }

    if (subtask2) {
        int ans=0;
        for (int i=0; i<n; i++) ans += confidence[i];

        return ans;
    }

    if (subtask3) {
        int ans=0;
        for (int i=0; i<n; i++) ans = max(ans, confidence[i]);

        return ans;
    }

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...