Submission #567519

#	Time	Username	Problem	Language	Result	Execution time	Memory
567519		Stickfish	Swapping Cities (APIO20_swap)	C++17	7 / 100	118 ms	15844 KiB

swap

#include "swap.h"
#include <vector>
#include <algorithm>
using namespace std;

const int MAXN = 1e5 + 123;
vector<pair<int, int>> edg[MAXN];

void init(int n, int m, vector<int> U, vector<int> V, vector<int> W) {
    vector<pair<int, pair<int, int>>> edg_weight(m);
    for (int i = 0; i < m; ++i) {
        edg_weight[i] = {W[i], {U[i], V[i]}};
    }
    sort(edg_weight.begin(), edg_weight.end());
    for (auto [w, e] : edg_weight) {
        auto [u, v] = e;
        edg[u].push_back({v, w});
        edg[v].push_back({u, w});
    }
}

int getMinimumFuelCapacity(int X, int Y) {
    if (edg[0].size() < 3)
        return -1;
    if (X == 0) {
        return max(edg[0][2].second, edg[Y][0].second);
    }
    if (Y == 0)
        return getMinimumFuelCapacity(Y, X);
    return max({edg[0][2].second, edg[X][0].second, edg[Y][0].second});
}

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