Submission #399688

#	Time	Username	Problem	Language	Result	Execution time	Memory
399688		A_D	Swapping Cities (APIO20_swap)	C++14	7 / 100	127 ms	10652 KiB

swap

#include <bits/stdc++.h>

using namespace std;

const int N=1e5+100;
int a[N];
int mn;
vector<int> vec;
void init(int N, int M,
          std::vector<int> U, std::vector<int> V, std::vector<int> W) {
            for(int i=0;i<M;i++){
                a[V[i]]=W[i];
                vec.push_back(W[i]);
            }
            sort(vec.begin(),vec.end());
            if(N>3)mn=vec[2];
            else mn=-1;
}

int getMinimumFuelCapacity(int X, int Y) {
    if(mn==-1)return mn;
    int ret=max(mn,max(a[X],a[Y]));
    return ret;
}

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