제출 #717453

#제출 시각아이디문제언어결과실행 시간메모리
7174531ne자매 도시 (APIO20_swap)C++14
6 / 100
110 ms10296 KiB
#include "swap.h"

#include <vector>
#include <bits/stdc++.h>
using namespace std;
int n,m,maxxy = 0;
void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
	n = N;
	m = M;
	for (auto x:W){
		maxxy = max(maxxy,x);
	}

}

int getMinimumFuelCapacity(int X, int Y) {
   if (m == n - 1)return -1;
	return maxxy;
}
#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...