Submission #717461

#	Time	Username	Problem	Language	Result	Execution time	Memory
717461		1ne	Swapping Cities (APIO20_swap)	C++14	0 / 100	95 ms	10408 KiB

swap

#include "swap.h"

#include <vector>
#include <bits/stdc++.h>
using namespace std;
int n,m,maxxy = 0;
vector<int>order;
vector<int>cost;
void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
	n = N;
	m = M;	
	order.resize(N - 1);
	cost.resize(N - 1);
	for (int i = 0;i<n;++i){
		cost[V[i]] = W[i];
	}	
	iota(order.begin(),order.end(),1);
	sort(order.begin(),order.end(),[&](int i,int j){
	   return cost[i] < cost[j];
	});
}

int getMinimumFuelCapacity(int X, int Y) {
   if (n <= 3){
   	return -1;	
   }
   if (X == 0){
   	return max({cost[order[3]],cost[X],cost[Y]});
   }
   else{
 		return max({cost[order[2]],cost[X],cost[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