Submission #917762

#	Time	Username	Problem	Language	Result	Execution time	Memory
917762		XXBabaProBerkay	Cyberland (APIO23_cyberland)	C++17	0 / 100	1311 ms	2097152 KiB

cyberland

#include <bits/stdc++.h>
using namespace std;

#define F first
#define S second

using ll = long long;

vector<vector<pair<int, int>>> adj;

int dfs(int k, int p, int &H)
{
	if (k == H)
		return 1;

	for (pair<int, int> i : adj[k])
		if (i.F != p)
		{
			int x = dfs(i.F, k, H);
			if (x > 0)
				return x + i.S;
		}

	return 0;
}

double solve(int N, int M, int H, int K, vector<int> x, vector<int> y, vector<int> c, vector<int> arr)
{
	adj.resize(N);
	for (int i = 0; i < M; i++)
	{
		adj[x[i]].emplace_back(y[i], c[i]);
		adj[y[i]].emplace_back(x[i], c[i]);
	}

	return double(dfs(0, 0, H) - 1);
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 8
• Subtask 3: 0 / 13
• Subtask 4: 0 / 19
• Subtask 5: 0 / 7
• Subtask 6: 0 / 16
• Subtask 7: 0 / 29
• Subtask 8: 0 / 3