Submission #375317

#	Time	Username	Problem	Language	Result	Execution time	Memory
375317		astoria	Swapping Cities (APIO20_swap)	C++14	7 / 100	132 ms	10748 KiB

swap

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

const int NN=100005;
int len[NN];
vector<int> vals;

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++){
		int v = V[i];
		len[v] = W[i];
		vals.push_back(len[v]);
	}
	sort(vals.begin(),vals.end());
}

int getMinimumFuelCapacity(int X, int Y) {
	
	if(vals.size()==2) return -1;
	
	if(X==0||Y==0){
		if(vals.size()<=3) return -1;
		if(len[Y]==vals[0]||len[Y]==vals[1]) return vals[2];
		else return len[Y];
	}
	
	int mx = max(len[X],len[Y]);
	
	if(vals[0]==len[X]&&vals[1]==len[Y]){
		mx = vals[2];
	}
	if(vals[0]==len[Y]&&vals[1]==len[X]){
		mx = vals[2];
	}
	
	return mx;
}

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