제출 #375302

#제출 시각아이디문제언어결과실행 시간메모리
375302astoriaSwapping Cities (APIO20_swap)C++14
6 / 100
129 ms10324 KiB
#include "bits/stdc++.h"
#include "swap.h"
#include <vector>
using namespace std;
 
int mx;
bool isM;
 
void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
	
	mx=0;
	for(int i : W){
		mx=max(mx,i);
	}
	
	isM=0;
	if(N==M) isM=1;
}
 
int getMinimumFuelCapacity(int X, int Y) {
	if(isM) return mx;
	else return -1;
}
#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...