제출 #1230063

#제출 시각아이디문제언어결과실행 시간메모리
1230063Jer자매 도시 (APIO20_swap)C++20
0 / 100
47 ms4524 KiB
#include "swap.h"
#include <bits/stdc++.h>
#include <vector>

using namespace std;

bool pos = false;
int n, m, res = 0;
void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W)
{
	n = N, m = M;
	if (n == m)
		for (int i = 0; i < N; i++)
			res = max(W[i], res);
}

int getMinimumFuelCapacity(int X, int Y)
{
	return (pos) ? res : -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...