Submission #668394

# Submission time Handle Problem Language Result Execution time Memory
668394 2022-12-03T19:37:56 Z 600Mihnea Safety (NOI18_safety) C++17
13 / 100
2000 ms 724 KB
#include <bits/stdc++.h>


using namespace std;

#define int long long

const int N = 5000 + 7;
const int INF = (int) 1e18 + 7;
int n, dmax, a[N], dp[N], ndp[N];

signed main()
{
#ifdef ONPC
  freopen ("input.txt", "r", stdin);
#endif // ONPC

#ifndef ONPC
  ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#endif // ONPC

  cin >> n >> dmax;

  for (int i = 1; i <= n; i++)
  {
    cin >> a[i];
  }

  int big = *max_element(a + 1, a + n + 1);

  if (*max_element(a + 1, a + n + 1) <= dmax)
  {
    cout << "0\n";
    return 0;
  }

  assert(n < N && dmax < N);

  for (int x = 0; x <= big; x++)
  {
    dp[x] = abs(x - a[1]);
  }

  for (int step = 2; step <= n; step++)
  {
    for (int x = 0; x <= big; x++)
    {
      ndp[x] = INF;
      for (int y = 0; y <= big; y++)
      {
        if (abs(x - y) <= dmax)
        {
          ndp[x] = min(ndp[x], dp[y] + abs(a[step] - x));
        }
      }
    }
    for (int x = 0; x <= big; x++)
    {
      dp[x] = ndp[x];
    }
  }
  int best = dp[0];
  for (int x = 0; x <= big; x++)
  {
    best = min(best, dp[x]);
  }
  cout << best << "\n";

  return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 596 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 724 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 73 ms 212 KB Output is correct
14 Correct 61 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 201 ms 320 KB Output is correct
17 Correct 235 ms 340 KB Output is correct
18 Correct 174 ms 340 KB Output is correct
19 Correct 61 ms 328 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 73 ms 212 KB Output is correct
14 Correct 61 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 201 ms 320 KB Output is correct
17 Correct 235 ms 340 KB Output is correct
18 Correct 174 ms 340 KB Output is correct
19 Correct 61 ms 328 KB Output is correct
20 Execution timed out 2076 ms 376 KB Time limit exceeded
21 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 73 ms 212 KB Output is correct
14 Correct 61 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 201 ms 320 KB Output is correct
17 Correct 235 ms 340 KB Output is correct
18 Correct 174 ms 340 KB Output is correct
19 Correct 61 ms 328 KB Output is correct
20 Execution timed out 2076 ms 376 KB Time limit exceeded
21 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Runtime error 1 ms 596 KB Execution killed with signal 11
14 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Runtime error 1 ms 596 KB Execution killed with signal 11
14 Halted 0 ms 0 KB -