Submission #974683

#	Time	Username	Problem	Language	Result	Execution time	Memory
974683		XXBabaProBerkay	Swapping Cities (APIO20_swap)	C++17	37 / 100	2061 ms	20888 KiB

swap

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

#define F first
#define S second

using ll = long long;

bool ans;
vector<bool> vis;
vector<vector<pair<int, int>>> adj;

void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) //init(N, M, U, V, W)
{
	adj.resize(N);
	vis.resize(N);
	for (int i = 0; i < M; i++)
	{
		adj[U[i]].emplace_back(V[i], W[i]);
		adj[V[i]].emplace_back(U[i], W[i]);
	}
}

void DFS(int k, int p, int& s, int& t, int& x)
{
	if (vis[k])
	{
		ans = 1;
		return;
	}

	int c = 0;
	vis[k] = 1;
	for (auto i : adj[k])
		if (i.S <= x && i.F != p)
		{
			c++;
			DFS(i.F, k, s, t, x);
		}

	ans |= (k != t && k != s && c > 1);
}

int getMinimumFuelCapacity(int X, int Y)
{
	int l = 1, r = 1e9;
	while (l <= r)
	{
		int m = (l + r) >> 1;
		ans = 0;
		fill(vis.begin(), vis.end(), 0);

		DFS(X, X, X, Y, m);

		if (ans && vis[Y])
			r = m - 1;
		else
			l = m + 1;
	}

	return (l < 1e9 ? l : -1);
}

• Subtask 1: 0 / 6
• Subtask 2: 0 / 7
• Subtask 3: 17 / 17
• Subtask 4: 20 / 20
• Subtask 5: 0 / 23
• Subtask 6: 0 / 27