Submission #1201623

#TimeUsernameProblemLanguageResultExecution timeMemory
1201623dibamboo23Swapping Cities (APIO20_swap)C++20
0 / 100
51 ms4524 KiB
#include "swap.h" #include <bits/stdc++.h> using namespace std; int n,m; int sum=0; void init(int N, int M,std::vector<int> U, std::vector<int> V, std::vector<int> W){ n=N; m=M; sort(W.begin(),W.end()); if((int)W.size()>1)sum=max(W[0],W[1]); return; } int getMinimumFuelCapacity(int X, int Y) { if(n==2&&m>1)return sum; 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...