oj.uz

Submission #168612

# Submission time Handle Problem Language Result Execution time Memory
168612 2019-12-14T09:20:17 Z johutha Friend (IOI14_friend) C++14
0 / 100
 2 ms 380 KB 
#include "friend.h"
#include <vector>
#include <iostream>
#include <algorithm>

#define int int64_t

using namespace std;

// Find out best sample
signed findSample(signed n, signed confidence[], signed host[], signed protocol[])
{
	vector<int> take;
	for (int i = 0; i < n; i++) take.push_back(confidence[i]);
	vector<int> nottake(n, 0);

	for (int i = n - 1; i > 0; i--)
	{
		int hs = host[i];
		if (protocol[i] == 0)
		{
			take[i] += nottake[hs];
			nottake[i] += max(take[hs], nottake[hs]);
		}
		else if (protocol[i] == 1)
		{
			take[i] = max(take[i] + max(take[hs], nottake[hs]), nottake[i] + take[hs]);
			nottake[i] += nottake[hs];
		}
		else
		{
			take[i] = max(take[i] + nottake[hs], take[hs] + nottake[i]);
			nottake[i] += nottake[hs];
		}
		
	}


	return max(take[0], nottake[0]);
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 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 2 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 2 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 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

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

Subtask #6
0 / 31.0

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