Submission #868985

# Submission time Handle Problem Language Result Execution time Memory
868985 2023-11-02T18:48:01 Z tch1cherin Swapping Cities (APIO20_swap) C++17
0 / 100
0 ms 348 KB
#include "swap.h"
#include <algorithm>
#include <vector>

int ans;

void init(int N, int M,
          std::vector<int> U, std::vector<int> V, std::vector<int> W) {
  ans = N == M ? *std::max_element(W.begin(), W.end()) : 0;
}

int getMinimumFuelCapacity(int X, int Y) {
  return ans;
}
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -