Submission #874121

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
874121	2023-11-16T09:30:10 Z	itslq	Friend (IOI14_friend)	C++17	8 / 100	1 ms	348 KB

friend

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

vector<int> children[1005];
int dp(int w[], int id, bool t) {
    int s = 0;
    if (t == 1) {
        for (int c: children[id]) {
            s += max(dp(w, c, 1), dp(w, c, 0));
        }
    } else {
        s += w[id];
        for (int c: children[id]) {
            s += dp(w, c, 0);
        }
    }
    return s;
}

int findSample(int n, int confidence[], int host[], int protocol[]) {
    if (protocol[1] == 0) {
        for (int i = 1; i < n; i++) children[host[i]].push_back(i);
        return max(dp(confidence, 0, 0), dp(confidence, 0, 1));
    } else if (protocol[1] == 2) {
        int m = -1;
        for (int i = 0; i < n; i++) m = max(m, confidence[i]);
        return m;
    }
    return -1;
}

Subtask #1
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	348 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #2
0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	348 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #3
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct