Submission #749925

# Submission time Handle Problem Language Result Execution time Memory
749925 2023-05-29T01:19:07 Z Abrar_Al_Samit Friend (IOI14_friend) C++17
19 / 100
1 ms 468 KB
#include "friend.h"
#include <bits/stdc++.h>

using namespace std;


const int nax = 1000;
vector<int>g[nax];
int a[nax];
long long dp[nax][2];

long long dfs(int v, int perm) {
	long long &ret = dp[v][perm];
	if(ret!=-1) return ret;

	ret = 0;

	for(int u : g[v]) {
		ret += dfs(u, 1);
	}

	if(perm) {
		long long an = a[v];
		for(int u : g[v]) {
			an += dfs(u, 0);
		}
		ret = max(ret, an);
	}
	return ret;
}
int findSample(int n,int confidence[],int host[],int protocol[]){
	for(int i=0; i<n; ++i) {
		a[i] = confidence[i];
	}

	for(int i=1; i<n; ++i) {
		g[host[i]].push_back(i);
	}

	memset(dp, -1, sizeof dp);
	return dfs(0, 1);
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Incorrect 1 ms 340 KB Output isn't correct
8 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Incorrect 0 ms 340 KB Output isn't correct
4 Halted 0 ms 0 KB -