Submission #1200644

#TimeUsernameProblemLanguageResultExecution timeMemory
1200644Mohamed_Kachef06Swapping Cities (APIO20_swap)C++17
6 / 100
48 ms6576 KiB
#include "swap.h"
#include <bits/stdc++.h>
using namespace std;
#include <vector>
#define all(x) x.begin() , x.end()

int n , m;
vector<int> u , v , w;
int mx = 0; 

void init(int N, int M,vector<int> U, vector<int> V, vector<int> W) {
  n = N  , m = M , u = U , V = v , w = W; 
  mx = *max_element(w.begin() , w.end()); 
}

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