Submission #1226084

#	Time	Username	Problem	Language	Result	Execution time	Memory
1226084		sokratisi	Swapping Cities (APIO20_swap)	C++20	0 / 100	53 ms	6748 KiB

swap

#include "swap.h"
#include <vector>
#include <algorithm>

using namespace std;

int n, m;
int dist[100005];
vector<pair<int, int>> sd;

void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
    n = N;
    m = M;
    for (int i = 0; i < m; i++) dist[V[i]] = W[i];
    for (int i = 1; i < n; i++) sd.push_back({dist[i], i});
    sort(sd.begin(), sd.end());
}

int getMinimumFuelCapacity(int x, int y) {
    if (x > y) swap(x, y);
    if (x == 0) {
        if (n == 2) return -1;
        int other = sd[0].first;
        if (y == sd[0].second) other = sd[1].first;
        return max(other, dist[y]);
    }
    else {
        if (n <= 3) return -1;
        int temp = max(dist[x], dist[y]);
        return max(temp, dist[2]);
    }

    return -1;
}

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