제출 #1230064

#제출 시각아이디문제언어결과실행 시간메모리
1230064JerSwapping Cities (APIO20_swap)C++20
6 / 100
48 ms5944 KiB
#include "swap.h" #include <bits/stdc++.h> #include <vector> using namespace std; 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 (n == m) ? 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...