Submission #1164681

#	Time	Username	Problem	Language	Result	Execution time	Memory
1164681		just	Swapping Cities (APIO20_swap)	C++20	7 / 100	248 ms	25500 KiB

swap

#include "bits/stdc++.h"
using namespace std;

#define vec vector
#define all(x) x.begin(), x.end()


int N, M;
vec<int> U, V, W;
vec<vec<int>> adj;

vec<int> weights;
map<pair<int,int>, int> edges;

int ans = 0;

void init(int n, int m, vec<int> u, vec<int> v, vec<int> w) {
    N = n;
    M = m;
    U = u;
    V = v;
    W = w;

    assert(U.size() == M);
    assert(V.size() == M);
    assert(W.size() == M);


    adj.resize(N);
    for (int i = 0; i < M; i++) {
        adj[U[i]].push_back(V[i]);
        adj[V[i]].push_back(U[i]);
    }

    for (int i = 0; i < M; i++) {
        edges[{U[i], V[i]}] = W[i];
        edges[{V[i], U[i]}] = W[i];
    }

    weights = W;
    sort(all(weights));
}
    

int getMinimumFuelCapacity(int x, int y) {
    if (x > y) swap(x, y);
    if (N <= 2) return -1;

    if (N == 3 && x != 0 && y != 0) return -1;

    return max({weights[2], edges[{0, x}], edges[{0, y}]});
}

#ifdef debug
signed main() {}
#endif

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