제출 #1153289

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1153289		Math4Life2020	Swapping Cities (APIO20_swap)	C++20	7 / 100	54 ms	6876 KiB

swap

#include <bits/stdc++.h>
using namespace std;
using ll = int; using pii = pair<ll,ll>;

ll N;
vector<ll> WC,W;
vector<ll> Wm;
ll c0 = -1;

void init(ll N1, ll M, vector<ll> U, vector<ll> V, vector<ll> W1) {
    WC = W1;
    W = W1;
    N = N1;
    Wm = vector<ll>(N-1,-1);
    for (ll i=0;i<(N-1);i++) {
        Wm[V[i]-1]=W1[i];
    }
    sort(W.begin(),W.end());
    if (N>=4) {
        c0 = W[2];
    }
}


ll getMinimumFuelCapacity(ll a, ll b) {
    if (N<=3) {
        return -1;
    }
    ll ans = c0;
    if (a>0) {
        ans = max(ans,Wm[a-1]);
    }
    if (b>0) {
        ans = max(ans,Wm[b-1]);
    }
    return ans;
}

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