제출 #868985

#제출 시각아이디문제언어결과실행 시간메모리
868985tch1cherinSwapping Cities (APIO20_swap)C++17
0 / 100
0 ms348 KiB
#include "swap.h"
#include <algorithm>
#include <vector>

int ans;

void init(int N, int M,
          std::vector<int> U, std::vector<int> V, std::vector<int> W) {
  ans = N == M ? *std::max_element(W.begin(), W.end()) : 0;
}

int getMinimumFuelCapacity(int X, int Y) {
  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...