Submission #996355

#	Time	Username	Problem	Language	Result	Execution time	Memory
996355		Dan4Life	Swapping Cities (APIO20_swap)	C++17	0 / 100	0 ms	348 KiB

swap

#include "swap.h"
#include <bits/stdc++.h>
using namespace std;
#define all(a) begin(a),end(a)

const int mxN = (int)3e5+10;
multiset<int> S;
int edge[mxN];

void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
	for(auto u : W) S.insert(u);
	for(int i = 0; i < M; i++){
		edge[V[i]] = W[i];
	}
}

int getMinimumFuelCapacity(int X, int Y) {
	if(X>Y) swap(X,Y);
	int ans = 0;
	if(X==0){
		ans = max(ans, edge[Y]);
		S.erase(S.find(edge[Y]));
	}
	else{
		ans = max(ans, edge[X]);
		ans = max(ans, edge[Y]);
		S.erase(S.find(edge[X]));
		S.erase(S.find(edge[Y]));
	}
	ans = max(ans, *begin(S));
	S.insert(edge[Y]);
	if(!X) S.insert(edge[X]);
	return ans;
}

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