oj.uz

Submission #587123

# Submission time Handle Problem Language Result Execution time Memory
587123 2022-07-01T10:52:46 Z hibiki Friend (IOI14_friend) C++11
35 / 100
 2 ms 468 KB 
#include "friend.h"
#include<bits/stdc++.h>
using namespace std;

#define pb push_back

// Find out best sample
int ans = 0;
int con[1005];
vector<int> v[1005];
int dp[1005][2];

void dfs(int nw, int fa)
{
	dp[nw][0] = 0;
	dp[nw][1] = con[nw];
	for(auto go: v[nw])
	{
		if(go == fa) continue;
		dfs(go, nw);

		dp[nw][0] += max(dp[go][0], dp[go][1]);
		dp[nw][1] += dp[go][0];
	}
}

int findSample(int n,int c[],int h[],int p[]){
	int ty;
	for(int i = 0; i < n; i++)
		con[i] = c[i];
	for(int i = 1; i < n; i++)
		ty = p[i];
	// if(n < 20) ty = 3;
	if(ty == 0)
	{
		for(int i = 1; i < n; i++)
			v[h[i]].pb(i);
		dfs(0, -1);
		ans = max(dp[0][0], dp[0][1]);
	}
	else if(ty == 1)
	{
		for(int i = 0; i < n; i++)
			ans += c[i];
	}
	else if(ty == 2)
	{
		for(int i = 0; i < n; i++)
			ans = max(ans, c[i]);
	}
	else
	{

	}
	return ans;
}

Compilation message

friend.cpp: In function 'int findSample(int, int*, int*, int*)':
friend.cpp:41:7: warning: 'ty' may be used uninitialized in this function [-Wmaybe-uninitialized]
   41 |  else if(ty == 1)
      |       ^~

Subtask #1
0 / 11.0

# 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 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 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 -

Subtask #2
8.0 / 8.0

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

Subtask #3
8.0 / 8.0

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

Subtask #4
19.0 / 19.0

# 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 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 360 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 348 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

Subtask #5
0 / 23.0

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

Subtask #6
0 / 31.0

# 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 Incorrect 1 ms 340 KB Output isn't correct
4 Halted 0 ms 0 KB -