# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
146576 | jwvg0425 | Safety (NOI18_safety) | C++17 | 339 ms | 3708 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
#include <vector>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>
#include <bitset>
#include <map>
#include <set>
#include <tuple>
#include <string.h>
#include <math.h>
#include <random>
#include <functional>
#include <assert.h>
#include <math.h>
#define all(x) (x).begin(), (x).end()
#define xx first
#define yy second
#define MOD 998244353
#define BUCKET 700
using namespace std;
using i64 = long long int;
using ii = pair<int, int>;
using ii64 = pair<i64, i64>;
int n, h;
void h0()
{
vector<int> s(n);
for (int i = 0; i < n; i++)
scanf("%d", &s[i]);
sort(all(s));
int m = s[n / 2];
i64 ans = 0;
for (int i = 0; i < n; i++)
ans += abs(m - s[i]);
printf("%lld\n", ans);
}
int arr[200005];
i64 table[505][405];
i64 solve(int idx, int v)
{
if (idx == n - 1)
return 0;
if (table[idx][v] != -1)
return table[idx][v];
auto& res = table[idx][v];
for (int s = max(0, v - h); s <= min(400, v + h); s++)
{
auto now = abs(arr[idx + 1] - s) + solve(idx + 1, s);
if (res == -1 || now < res)
res = now;
}
return res;
}
int main()
{
scanf("%d %d", &n, &h);
if (h == 0)
{
h0();
return 0;
}
for (int i = 0; i < n; i++)
scanf("%d", &arr[i]);
memset(table, -1, sizeof(table));
i64 ans = solve(0, arr[0]);
for (int i = 0; i <= 400; i++)
ans = min(ans, abs(i - arr[0]) + solve(0, i));
printf("%lld\n", ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |