Submission #1225965

#TimeUsernameProblemLanguageResultExecution timeMemory
1225965Godgift42Swapping Cities (APIO20_swap)C++20
6 / 100
49 ms5804 KiB
#include "swap.h"
#include <bits/stdc++.h>
#include <vector>
using namespace std;
int n;
int m;
int ma=0;
void init(int N, int M,
          std::vector<int> U, std::vector<int> V, std::vector<int> W) {
  m=M;
  n=N;
  for(int i=0;i<M;i++){
    ma=max(ma,W[i]);
  }
}

int getMinimumFuelCapacity(int X, int Y) {
  if(m==n-1)return -1;
  return ma;
}
#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...