Submission #738208

#	Time	Username	Problem	Language	Result	Execution time	Memory
738208		PoonYaPat	Swapping Cities (APIO20_swap)	C++14	0 / 100	105 ms	9604 KiB

swap

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

int n,mx,w[100001];

void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
    n=N;
    set<int> h;
    for (int i=0; i<M; ++i) w[V[i]]=W[i];
    for (auto s : W) h.insert(s);
    if (n>3) {
        auto it=h.begin();
        ++it; ++it;
        mx=*it;
    }
}

int getMinimumFuelCapacity(int X, int Y) {
    if (n<=3) return -1;
    if (X==0 || Y==0) return -1;
    return max({mx,w[X],w[Y]});
}

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