oj.uz

Submission #208293

# Submission time Handle Problem Language Result Execution time Memory
208293 2020-03-10T15:26:20 Z Sorting Friend (IOI14_friend) C++14
0 / 100
 5 ms 428 KB 
#include "friend.h"
#include <bits/stdc++.h>

using namespace std;

const int kN = 1007;

vector<int> adj[kN];
pair<int, bool> dp[kN][2];

int solve(int u, bool can, int parent, int confidence[]){
	if(dp[u][can].second)
		return dp[u][can].first;

	dp[u][can].second = true;
	int &ans = dp[u][can].first;
	ans = 0;

	if(can){
		int curr_ans = confidence[u];
		for(int to: adj[u]){
			if(to == parent)
				continue;

			curr_ans += solve(to, false, u, confidence);
		}
		ans = max(ans, curr_ans);
	}

	int curr_ans = 0;
	for(int to: adj[u]){
		if(to == parent)
			continue;

		curr_ans += solve(to, true, u, confidence);
	}
	ans = max(ans, curr_ans);

	return ans;
}

int findSample(int n, int confidence[], int host[], int protocol[]){
	for(int i = 1; i < n; ++i){
		adj[host[i]].push_back(i);
		adj[i].push_back(i);
	}

	return solve(0, true, -1, confidence);
}

Subtask #1
0 / 11.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 8.0

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

Subtask #4
0 / 19.0

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

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Incorrect 5 ms 428 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

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