제출 #1008041

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1008041		overwatch9	Swapping Cities (APIO20_swap)	C++17	0 / 100	103 ms	14632 KiB

swap

#include "swap.h"

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

vector <vector <pair <int, int>>> adj;
int n, m;
multiset <int> d;
void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
    adj.resize(N+1);
	n = N;
	m = M;
    for (int i = 0; i < M; i++) {
        adj[U[i]].push_back({V[i], W[i]});
		adj[V[i]].push_back({U[i], W[i]});
		d.insert(W[i]);
	}
}

int getMinimumFuelCapacity(int x, int y) {
	if (n == 2)
		return -1;
	if (n == 3 && x != 0 && y != 0)
		return -1;
	if (n == 3)
		return max(adj[x][0].second, adj[y][0].second);
	if (x == 0 || y == 0) {
		if (adj[max(x, y)][0].second == *d.begin())
			return *(++d.begin());	
		return adj[max(x, y)][0].second;
	}
	return -1;

}
// int main() {
// 	int N, M;
// 	cin >> N >> M;
// 	vector <int> u(M), v(M), w(M);
// 	for (int i = 0; i < M; i++)
// 		cin >> u[i] >> v[i] >> w[i];
// 	init(N, M, u, v, w);
// 	int q;
// 	cin >> q;
// 	while (q--) {
// 		int x, y;
// 		cin >> x >> y;
// 		cout << getMinimumFuelCapacity(x, y) << '\n';
// 	}
// }

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