제출 #414352

#제출 시각아이디문제언어결과실행 시간메모리
414352prvocisloSwapping Cities (APIO20_swap)C++17
6 / 100
136 ms10244 KiB
#include <bits/stdc++.h> using namespace std; int maxi = -1; void init(int n, int m, vector<int> u, vector<int> v, vector<int> w) { if (m >= n) maxi = *max_element(w.begin(), w.end()); } int getMinimumFuelCapacity(int x, int y) { return maxi; }
#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...