Submission #1201626

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