Submission #394282

#TimeUsernameProblemLanguageResultExecution timeMemory
394282irmuunSwapping Cities (APIO20_swap)C++17
0 / 100
1 ms204 KiB
#include "swap.h"
#include<bits/stdc++.h>
using namespace std;
int ans=0,i,n,m;
void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
	ans=W[0];
  	n=N;
  	m=M;
	for(i=0;i<M;i++){
		ans=max(ans,W[i]);
	}
}
int getMinimumFuelCapacity(int X, int Y) {
	if(m+1==n){
		return 0;
	}
	else{
		return ans;
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...