oj.uz

Submission #146576

# Submission time Handle Problem Language Result Execution time Memory
146576 2019-08-24T12:53:33 Z jwvg0425 Safety (NOI18_safety) C++17
18 / 100
 339 ms 3708 KB 
#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

safety.cpp: In function 'void h0()':
safety.cpp:35:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &s[i]);
   ~~~~~^~~~~~~~~~~~~
safety.cpp: In function 'int main()':
safety.cpp:75:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &h);
  ~~~~~^~~~~~~~~~~~~~~~~
safety.cpp:84:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &arr[i]);
   ~~~~~^~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1912 KB Output is correct
2 Correct 3 ms 1912 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 9 ms 1912 KB Output is correct
5 Correct 3 ms 1888 KB Output is correct
6 Correct 3 ms 1912 KB Output is correct
7 Correct 3 ms 1912 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 3 ms 1912 KB Output is correct
3 Correct 3 ms 1912 KB Output is correct
4 Correct 3 ms 1916 KB Output is correct
5 Correct 3 ms 1916 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 6 ms 3708 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 888 KB Output is correct
2 Correct 56 ms 1108 KB Output is correct
3 Correct 57 ms 1144 KB Output is correct

Subtask #5
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1912 KB Output is correct
2 Correct 3 ms 1912 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 9 ms 1912 KB Output is correct
5 Correct 3 ms 1888 KB Output is correct
6 Correct 3 ms 1912 KB Output is correct
7 Correct 3 ms 1912 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 3 ms 1912 KB Output is correct
10 Correct 3 ms 1912 KB Output is correct
11 Correct 3 ms 1916 KB Output is correct
12 Correct 3 ms 1916 KB Output is correct
13 Correct 22 ms 1912 KB Output is correct
14 Correct 2 ms 380 KB Output is correct
15 Correct 339 ms 2040 KB Output is correct
16 Correct 220 ms 2040 KB Output is correct
17 Correct 303 ms 2040 KB Output is correct
18 Correct 213 ms 2012 KB Output is correct
19 Correct 8 ms 1912 KB Output is correct

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1912 KB Output is correct
2 Correct 3 ms 1912 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 9 ms 1912 KB Output is correct
5 Correct 3 ms 1888 KB Output is correct
6 Correct 3 ms 1912 KB Output is correct
7 Correct 3 ms 1912 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 3 ms 1912 KB Output is correct
10 Correct 3 ms 1912 KB Output is correct
11 Correct 3 ms 1916 KB Output is correct
12 Correct 3 ms 1916 KB Output is correct
13 Correct 22 ms 1912 KB Output is correct
14 Correct 2 ms 380 KB Output is correct
15 Correct 339 ms 2040 KB Output is correct
16 Correct 220 ms 2040 KB Output is correct
17 Correct 303 ms 2040 KB Output is correct
18 Correct 213 ms 2012 KB Output is correct
19 Correct 8 ms 1912 KB Output is correct
20 Incorrect 327 ms 1916 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #7
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1912 KB Output is correct
2 Correct 3 ms 1912 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 9 ms 1912 KB Output is correct
5 Correct 3 ms 1888 KB Output is correct
6 Correct 3 ms 1912 KB Output is correct
7 Correct 3 ms 1912 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 3 ms 1912 KB Output is correct
10 Correct 3 ms 1912 KB Output is correct
11 Correct 3 ms 1916 KB Output is correct
12 Correct 3 ms 1916 KB Output is correct
13 Correct 22 ms 1912 KB Output is correct
14 Correct 2 ms 380 KB Output is correct
15 Correct 339 ms 2040 KB Output is correct
16 Correct 220 ms 2040 KB Output is correct
17 Correct 303 ms 2040 KB Output is correct
18 Correct 213 ms 2012 KB Output is correct
19 Correct 8 ms 1912 KB Output is correct
20 Incorrect 327 ms 1916 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #8
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1912 KB Output is correct
2 Correct 3 ms 1912 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 9 ms 1912 KB Output is correct
5 Correct 3 ms 1888 KB Output is correct
6 Correct 3 ms 1912 KB Output is correct
7 Correct 3 ms 1912 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 3 ms 1912 KB Output is correct
10 Correct 3 ms 1912 KB Output is correct
11 Correct 3 ms 1916 KB Output is correct
12 Correct 3 ms 1916 KB Output is correct
13 Runtime error 6 ms 3708 KB Execution killed with signal 11 (could be triggered by violating memory limits)
14 Halted 0 ms 0 KB -

Subtask #9
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1912 KB Output is correct
2 Correct 3 ms 1912 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 9 ms 1912 KB Output is correct
5 Correct 3 ms 1888 KB Output is correct
6 Correct 3 ms 1912 KB Output is correct
7 Correct 3 ms 1912 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 3 ms 1912 KB Output is correct
10 Correct 3 ms 1912 KB Output is correct
11 Correct 3 ms 1916 KB Output is correct
12 Correct 3 ms 1916 KB Output is correct
13 Runtime error 6 ms 3708 KB Execution killed with signal 11 (could be triggered by violating memory limits)
14 Halted 0 ms 0 KB -