Submission #979721

#	Time	Username	Problem	Language	Result	Execution time	Memory
979721		Marcus	Swapping Cities (APIO20_swap)	C++17	6 / 100	123 ms	16060 KiB

swap

#include <swap.h>
#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<vector<pair<int, int>>> adj;
vector<bool> visited;

bool cycle = false;
int gas = 0;
void dfs(int s, int v)
{
	if (visited[s]) return;
	visited[s] = true;
	for (auto u: adj[s])
	{
		if (visited[u.first] && u.first != v) cycle = true;
		gas = max(gas, u.second);
		dfs(u.first, s);
	}
}

void init(int n1, int m1, std::vector<int> v, std::vector<int> u, std::vector<int> w) {
	n = n1;
	m = m1;
	adj.resize(n+1);
	visited.resize(n+1);
	for (int i=0; i<m; i++)
	{
		adj[v[i]].push_back({u[i], w[i]});
		adj[u[i]].push_back({v[i], w[i]});
	}
}

int getMinimumFuelCapacity(int x, int y){
	dfs(1, 0);
	return (cycle ? gas : -1);
}

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