Submission #405942

#	Time	Username	Problem	Language	Result	Execution time	Memory
405942		Maqsut_03	Swapping Cities (APIO20_swap)	C++17	0 / 100	2 ms	1100 KiB

swap

#include "swap.h"
#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<deque>

#define ll int
#define pl pair<ll, ll> 
#define llv vector<ll>
#define pb push_back
#define ppb(x, y) push_back({x, y})
#define pv vector<pl>
#define sz size()
#define ss second
#define ff first

using namespace std;
const int N = 2 * 1e5 + 3;

ll n, m, a = 0, b = 0, c;
llv v(N);
pl w[N];
bool q = 1;

void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) 
{
    n = N;
    m = M;
/*    for (int i=0; i<m; i++) 
	{
    	v[V[i]].ppb(U[i], W[i]);
    	v[U[i]].ppb(V[i], W[i]);
	}
*/	
	for (int i=0; i<m; i++)
	    	w[i] = {W[i], V[i]};
    
	for (int i=0; i<m; i++) v[w[i].ss] = w[i].ff;
	sort(w, w+m);
	a = w[0].ss;
	b = w[1].ss;
	c = w[2].ss;
	return ;
}

int getMinimumFuelCapacity(int X, int Y) 
{
	ll ans;
	if ((X == a && Y == b) || (X == b && Y == a)) ans = c ;
	else if (X == a || Y == a) ans = b;
	else ans = a;
	ans = max({ans, v[Y], v[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