Submission #777852

#	Time	Username	Problem	Language	Result	Execution time	Memory
777852		t6twotwo	Swapping Cities (APIO20_swap)	C++17	0 / 100	70 ms	5204 KiB

swap

#include "swap.h"
#include <bits/stdc++.h>
using namespace std;
int N, x, y, z;
vector<int> a;
constexpr int inf = 2e9;
void init(int n, int M, vector<int> U, vector<int> V, vector<int> W) {
    N = n;
    a.resize(N);
    for (int i = 0; i < M; i++) {
        a[V[i]] = W[i];
    }
    sort(W.begin(), W.end());
    if (N >= 4) {
        x = W[0];
        y = W[1];
        z = W[2];
    }
}
int getMinimumFuelCapacity(int X, int Y) {
    if (N < 4) {
        return -1;
    }
    if (X == 0) {
        return (a[Y] == x || a[Y] == y) ? z : y;
    }
    if (Y == 0) {
        return (a[X] == x || a[X] == y) ? z : y;
    }
    if (a[X] > a[Y]) {
        swap(X, Y);
    }
    return x == a[X] ? (y == a[Y] ? z : y) : x;
}

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