제출 #1247605

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1247605		cuongngoo	Rabbit Carrot (LMIO19_triusis)	C++20	63 / 100	1097 ms	3396 KiB

triusis

#include<bits/stdc++.h>
#define int long long

using namespace std;

const int N = 2e5 + 5, inf = 1e18;

int n, m;
int h[N], f[N];

int32_t main() {
  cin.tie(0) -> sync_with_stdio(0);

  #define task "RABBIT CARROT"

  if (fopen ("task.inp", "r")) {
    freopen ("task.inp", "r", stdin);
    freopen ("task.out", "w", stdout);
  }

  if (fopen (task".inp", "r")) {
    freopen (task".inp", "r", stdin);
    freopen (task".out", "w", stdout);
  }

  cin >> n >> m;
  for (int i = 1; i <= n + 1; ++i) cin >> h[i];

  for (int i = 1; i <= n; ++i) f[i] = inf;

  for (int i = 1; i <= n; ++i)
    for (int j = i - 1; j >= 0; --j)
      if (h[j] + m >= h[i] - m * (i - j - 1))
        f[i] = min(f[i], f[j] + (i - j - 1));

  for (int i = 0; i <= n; ++i) f[n] = min(f[n], f[i] + (n - i));

  cout << f[n];
}

컴파일 시 표준 에러 (stderr) 메시지

triusis.cpp: In function 'int32_t main()':
triusis.cpp:17:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |     freopen ("task.inp", "r", stdin);
      |     ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
triusis.cpp:18:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |     freopen ("task.out", "w", stdout);
      |     ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
triusis.cpp:22:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |     freopen (task".inp", "r", stdin);
      |     ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
triusis.cpp:23:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |     freopen (task".out", "w", stdout);
      |     ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 14 / 14
• Subtask 2: 21 / 21
• Subtask 3: 28 / 28
• Subtask 4: 0 / 37