Submission #1233384

#TimeUsernameProblemLanguageResultExecution timeMemory
1233384inesfiSwapping Cities (APIO20_swap)C++20
6 / 100
49 ms5804 KiB
#include "swap.h" #include<bits/stdc++.h> using namespace std; int nbvilles,nbroutes; int pluslongue; void init(int N, int M,vector<int> U, vector<int> V, vector<int> W) { nbvilles=N; nbroutes=M; for (int i=0;i<nbroutes;i++){ pluslongue=max(pluslongue,W[i]); } } int getMinimumFuelCapacity(int X, int Y) { if (nbvilles==nbroutes){ return pluslongue; } 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...