oj.uz

Submission #146578

# Submission time Handle Problem Language Result Execution time Memory
146578 2019-08-24T13:26:29 Z jwvg0425 Safety (NOI18_safety) C++17
18 / 100
 132 ms 3704 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];

int main()
{
	scanf("%d %d", &n, &h);

	if (h == 0)
	{
		h0();
		return 0;
	}

	for (int i = 0; i < n; i++)
	{
		scanf("%d", &arr[i]);

		if (n > 500)
		{
			printf("-1\n");
			return 0;
		}
	}

	memset(table, -1, sizeof(table));

	for (int v = 0; v <= 400; v++)
		table[n - 1][v] = 0;

	for (int idx = n - 2; idx >= 0; idx--)
	{
		for (int v = 0; v <= 400; v++)
		{
			for (int s = max(0, v - h); s <= min(400, v + h); s++)
			{
				auto now = abs(arr[idx + 1] - s) + table[idx + 1][s];

				if (table[idx][v] == -1 || now < table[idx][v])
					table[idx][v] = now;
			}
		}
	}

	i64 ans = table[0][arr[0]];
	for (int i = 0; i <= 400; i++)
		ans = min(ans, abs(i - arr[0]) + table[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:54: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:64: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 4 ms 1912 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 6 ms 1912 KB Output is correct
5 Correct 3 ms 1912 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 376 KB Output is correct
2 Correct 3 ms 1912 KB Output is correct
3 Correct 4 ms 1912 KB Output is correct
4 Correct 3 ms 1912 KB Output is correct
5 Correct 3 ms 1912 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 6 ms 3704 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 38 ms 888 KB Output is correct
2 Correct 54 ms 1116 KB Output is correct
3 Correct 57 ms 1244 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 4 ms 1912 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 6 ms 1912 KB Output is correct
5 Correct 3 ms 1912 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 376 KB Output is correct
9 Correct 3 ms 1912 KB Output is correct
10 Correct 4 ms 1912 KB Output is correct
11 Correct 3 ms 1912 KB Output is correct
12 Correct 3 ms 1912 KB Output is correct
13 Correct 11 ms 1912 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 132 ms 1960 KB Output is correct
16 Correct 88 ms 1912 KB Output is correct
17 Correct 120 ms 2040 KB Output is correct
18 Correct 86 ms 1912 KB Output is correct
19 Correct 5 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 4 ms 1912 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 6 ms 1912 KB Output is correct
5 Correct 3 ms 1912 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 376 KB Output is correct
9 Correct 3 ms 1912 KB Output is correct
10 Correct 4 ms 1912 KB Output is correct
11 Correct 3 ms 1912 KB Output is correct
12 Correct 3 ms 1912 KB Output is correct
13 Correct 11 ms 1912 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 132 ms 1960 KB Output is correct
16 Correct 88 ms 1912 KB Output is correct
17 Correct 120 ms 2040 KB Output is correct
18 Correct 86 ms 1912 KB Output is correct
19 Correct 5 ms 1912 KB Output is correct
20 Incorrect 122 ms 1912 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 4 ms 1912 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 6 ms 1912 KB Output is correct
5 Correct 3 ms 1912 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 376 KB Output is correct
9 Correct 3 ms 1912 KB Output is correct
10 Correct 4 ms 1912 KB Output is correct
11 Correct 3 ms 1912 KB Output is correct
12 Correct 3 ms 1912 KB Output is correct
13 Correct 11 ms 1912 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 132 ms 1960 KB Output is correct
16 Correct 88 ms 1912 KB Output is correct
17 Correct 120 ms 2040 KB Output is correct
18 Correct 86 ms 1912 KB Output is correct
19 Correct 5 ms 1912 KB Output is correct
20 Incorrect 122 ms 1912 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 4 ms 1912 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 6 ms 1912 KB Output is correct
5 Correct 3 ms 1912 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 376 KB Output is correct
9 Correct 3 ms 1912 KB Output is correct
10 Correct 4 ms 1912 KB Output is correct
11 Correct 3 ms 1912 KB Output is correct
12 Correct 3 ms 1912 KB Output is correct
13 Runtime error 6 ms 3704 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 4 ms 1912 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 6 ms 1912 KB Output is correct
5 Correct 3 ms 1912 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 376 KB Output is correct
9 Correct 3 ms 1912 KB Output is correct
10 Correct 4 ms 1912 KB Output is correct
11 Correct 3 ms 1912 KB Output is correct
12 Correct 3 ms 1912 KB Output is correct
13 Runtime error 6 ms 3704 KB Execution killed with signal 11 (could be triggered by violating memory limits)
14 Halted 0 ms 0 KB -