Submission #24221651


Source Code Expand

#include <algorithm>
#include <cstdint>
#include <functional>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <vector>
namespace jikka {
template <class T, class... Args>
std::array<T, sizeof...(Args)> make_array(Args... args) {
  return {args...};
}
}
int64_t solve(int64_t n_0, std::vector<int64_t> h_1) {
  int64_t x6;
  if (n_0 + -1 == 0) {
    x6 = 0;
  } else {
    std::vector<std::array<int64_t, 2>> x2 =
        std::vector<std::array<int64_t, 2>>(n_0 + -2 + 1);
    x2[0] = jikka::make_array<int64_t>(
        0, std::max<int64_t>(-h_1[0] + h_1[1], h_1[0] + -h_1[1]));
    for (int32_t i3 = 0; i3 < int32_t(n_0 + -2); ++i3) {
      x2[(i3 + 1)] = jikka::make_array<int64_t>(
          x2[i3][1],
          std::min<int64_t>(
              x2[i3][1] + std::max<int64_t>(-h_1[(i3 + 1)] + h_1[(i3 + 2)],
                                            h_1[(i3 + 1)] + -h_1[(i3 + 2)]),
              x2[i3][0] + std::max<int64_t>(-h_1[i3] + h_1[(i3 + 2)],
                                            h_1[i3] + -h_1[(i3 + 2)])));
    }
    x6 = x2[(n_0 + -2)][1];
  }
  return x6;
}
int main() {
  int64_t n_7 = -1;
  std::cin >> n_7;
  std::vector<int64_t> h_8 = std::vector<int64_t>(n_7, -1);
  for (int32_t i9 = 0; i9 < n_7; ++i9) {
    std::cin >> h_8[i9];
  }
  auto ans_10 = solve(n_7, h_8);
  std::cout << ans_10 << ' ';
  std::cout << '\n' << ' ';
}

Submission Info

Submission Time
Task A - Frog 1
User kimiyuki
Language C++ (GCC 9.2.1)
Score 100
Code Size 1441 Byte
Status AC
Exec Time 33 ms
Memory 6424 KiB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 11
Set Name Test Cases
All 0_00, 0_01, 0_02, 1_00, 1_01, 1_02, 1_03, 1_04, 1_05, 1_06, 1_07
Case Name Status Exec Time Memory
0_00 AC 6 ms 3548 KiB
0_01 AC 3 ms 3456 KiB
0_02 AC 2 ms 3548 KiB
1_00 AC 2 ms 3536 KiB
1_01 AC 2 ms 3548 KiB
1_02 AC 25 ms 6424 KiB
1_03 AC 31 ms 6356 KiB
1_04 AC 30 ms 6180 KiB
1_05 AC 31 ms 6416 KiB
1_06 AC 33 ms 6256 KiB
1_07 AC 29 ms 6268 KiB