oj.uz

답안 #131413

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
131413 2019-07-17T06:43:28 Z Mahdi_Jfri 친구 (IOI14_friend) C++14
19 / 100
 7 ms 508 KB 
#include "friend.h"
#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back

const int maxn = 1e3 + 20;

vector<int> adj[maxn] , adj2[maxn];

int dp[maxn][2] , a[maxn];
bool is[maxn];

void plant(int v)
{
	dp[v][1] = a[v];
	for(auto u : adj[v])
	{
		plant(u);
		dp[v][0] += dp[u][1];
		dp[v][1] += dp[u][0];
	}

	dp[v][1] = max(dp[v][1] , dp[v][0]);
}

int findSample(int n,int A[],int host[],int pt[])
{
	bool has[3] = {0 , 0 , 0};
	for(int i = 1; i < n; i++)
	{
		has[pt[i]] = 1;
		if(pt[i] == 0)
			adj[host[i]].pb(i);
		else
			adj2[host[i]].pb(i);

		is[i] = (pt[i] == 2);
	}

	for(int i = 0; i < n; i++)
		a[i] = A[i];

	pt[0] = 1;
	for(int i = 0; i < n; i++)
		if(!i || pt[i])
			plant(i);

	return dp[0][1];
}

Compilation message

friend.cpp: In function 'int findSample(int, int*, int*, int*)':
friend.cpp:31:7: warning: variable 'has' set but not used [-Wunused-but-set-variable]
  bool has[3] = {0 , 0 , 0};
       ^~~

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 352 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Incorrect 2 ms 504 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 7 ms 504 KB Output is correct
11 Correct 2 ms 380 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 504 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 424 KB Output is correct
4 Correct 2 ms 508 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 424 KB Output is correct
7 Incorrect 2 ms 376 KB Output isn't correct
8 Halted 0 ms 0 KB -