oj.uz

Submission #73274

# Submission time Handle Problem Language Result Execution time Memory
73274 2018-08-28T06:28:21 Z nvmdava Friend (IOI14_friend) C++17
0 / 100
 4 ms 644 KB 
#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][0]);
}

Subtask #1
0 / 11.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 8.0

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

Subtask #4
0 / 19.0

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

Subtask #5
0 / 23.0

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

Subtask #6
0 / 31.0

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