Submission #1230077

#	Time	Username	Problem	Language	Result	Execution time	Memory
1230077		Jer	자매 도시 (APIO20_swap)	C++20	7 / 100	52 ms	6108 KiB

swap

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

using namespace std;

int n, m, a, b, c;
vector<int> w;
void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W)
{
	n = N, m = M;
	w.resize(n);
	for (int i = 0; i < n; i++)
		w[V[i]] = W[i];
	sort(W.begin(), W.end()), a = W[0], b = W[1], c = W[2];
}

int getMinimumFuelCapacity(int x, int y)
{
	return (n > 3) ? max({c, w[x], w[y]}) : -1;
}

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