oj.uz

답안 #668397

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
668397 2022-12-03T19:41:05 Z 600Mihnea Safety (NOI18_safety) C++17
35 / 100
 144 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++)
  {
    deque<int> d;
    int y = 0;
    for (int x = 0; x <= big; x++)
    {
      while (y <= big && y <= x + dmax)
      {
        while (!d.empty() && dp[d.back()] > dp[y])
        {
          d.pop_back();
        }
        d.push_back(y);
        y++;
      }
      assert(!d.empty());
      if (!d.empty() && d.front() < x - dmax)
      {
        d.pop_front();
      }
      assert(!d.empty());
      assert(abs(x - d.front()) <= dmax);
      ndp[x] = dp[d.front()] + 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;
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 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

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 596 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 3 ms 724 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 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 0 ms 328 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 2 ms 468 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 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 0 ms 328 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 20 ms 324 KB Output is correct
21 Correct 14 ms 340 KB Output is correct
22 Correct 12 ms 340 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 18 ms 440 KB Output is correct
25 Correct 11 ms 444 KB Output is correct
26 Correct 15 ms 324 KB Output is correct
27 Correct 13 ms 412 KB Output is correct

Subtask #7
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 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 0 ms 328 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 20 ms 324 KB Output is correct
21 Correct 14 ms 340 KB Output is correct
22 Correct 12 ms 340 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 18 ms 440 KB Output is correct
25 Correct 11 ms 444 KB Output is correct
26 Correct 15 ms 324 KB Output is correct
27 Correct 13 ms 412 KB Output is correct
28 Correct 144 ms 448 KB Output is correct
29 Correct 132 ms 440 KB Output is correct
30 Correct 135 ms 480 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 110 ms 340 KB Output is correct
33 Correct 134 ms 468 KB Output is correct
34 Correct 116 ms 492 KB Output is correct

Subtask #8
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 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 0 ms 328 KB Output is correct
11 Correct 1 ms 212 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 -

Subtask #9
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 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 0 ms 328 KB Output is correct
11 Correct 1 ms 212 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 -