Submission #735417

#TimeUsernameProblemLanguageResultExecution timeMemory
735417keisuke6Swapping Cities (APIO20_swap)C++14
6 / 100
91 ms11368 KiB
#include "swap.h" #include <vector> using namespace std; int N,M; vector<int> U,V,W; int m = 0; void init(int NN, int MM, std::vector<int> UU, std::vector<int> VV, std::vector<int> WW) { N = NN; M = MM; U = UU; V = VV; W = WW; for(int x:W) m = max(m,x); } int getMinimumFuelCapacity(int X, int Y) { if(N == M) return m; else return -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...