제출 #1225951

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1225951		Jer	자매 도시 (APIO20_swap)	C++20	0 / 100	56 ms	7008 KiB

swap

#include "swap.h"
#include <bits/stdc++.h>
#include <vector>

using namespace std;

const int MAXN = 1e5 + 5;
vector<pair<int, int>> w; // value, node
int n;
int s[MAXN];

void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
	n = N;
	for (int i = 0; i < n - 1; i++)
		w.push_back({W[i], V[i]}), s[V[i]] = W[i];
	
	sort(w.begin(), w.end());
}

#define is_best(i) w[i] == s[1]
#define is_second(i) w[i] == s[2]

int getMinimumFuelCapacity(int x, int y) {
  	if (n <= 3) return -1;
	if (x == 0){
		int res = 2 * s[y];
		int chose;
		for (int i = 0; i < n; i++)
			if (w[i].second != y) {chose = i, res += 2 * w[i].first; break;}
		for (int i = 0; i < n; i++) 
			if (w[i].second != y and i != chose) {res += 2 * w[i].first; break;}
		return res;
	}

	int res = 2 * s[y] + 2 * s[x];
	for (int i = 0; i < n; i++)
		if (w[i].second != x and w[i].second != y) {res += 2 * w[i].first; break;}
	return res;
}

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