Submission #73276

#TimeUsernameProblemLanguageResultExecution timeMemory
73276nvmdavaFriend (IOI14_friend)C++17
19 / 100
4 ms972 KiB
#include "friend.h"
#include<bits/stdc++.h>
using namespace std;

vector<int> p[1001];
int ans[1001][2];

inline void go(int v){
	for(auto x : p[v]){
		go(x);
		ans[v][0] += max(ans[x][1], ans[x][0]);
		ans[v][1] += ans[x][0];
	}
}

int findSample(int n,int confidence[],int host[],int protocol[]){
	
	ans[0][1] = confidence[0];
	for(int i = 1; i < n; i++){
		p[host[i]].push_back(i);
		ans[i][1] = confidence[i];
	}
	go(0);
	return max(ans[0][0], ans[0][1]);
}
#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...