oj.uz

Submission #819805

# Submission time Handle Problem Language Result Execution time Memory
819805 2023-08-10T13:44:02 Z Cyber_Wolf Friend (IOI14_friend) C++17
0 / 100
 6 ms 9808 KB 
#include <bits/stdc++.h>
#include "friend.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("Ofast")

using namespace std;
using namespace __gnu_pbds;

#define lg long long
#define ordered_set	tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

const lg N = 2e5+5;

lg par[N];
vector<set<lg>> adj(N);

lg get(lg src)
{
	if(src == par[src])	return src;
	return par[src] = get(par[src]);
}

void join(lg u, lg v)
{
	par[u] = v;
	return;
}

int findSample(int n, int c[], int h[], int p[])
{
	int ans = c[0];
	// for(int i = 1; i < n; i++)
	// {
		// h[i]++;
	// }
	for(int i = 1; i < n; i++)
	{
		if(h[i])	ans += c[i];
	}
	for(int i = 1; i < n; i++)
	{
		int sum = c[i];
		for(int j = i-1; j >= 0; j--)
		{
			if(j == h[i])	continue;
			// cout << j << ' ';
			sum += c[j];
		}
		for(int j = i+1; j < n; j++)
		{
			if(h[j] == i)	continue;
			// cout << j << ' ';
			sum += c[j];
		}
		// cout << ans << '\n';
		ans = max(ans, sum);
	}
	return ans;
}

Subtask #1
0 / 11.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 8.0

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

Subtask #4
0 / 19.0

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

Subtask #5
0 / 23.0

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

Subtask #6
0 / 31.0

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