oj.uz

Submission #963843

# Submission time Handle Problem Language Result Execution time Memory
963843 2024-04-15T19:40:09 Z guechotjrhh Safety (NOI18_safety) C++14
5 / 100
 29 ms 2900 KB 
#include<stdio.h>
#include<vector>
#pragma warning (disable:4996)
using namespace std;

#include<algorithm>
#define ll long long
ll ab(ll n) { return n > 0 ? n : -n; }
int sz = 5001;
long long func(int n, int h, vector<int> s) {
	sort(s.begin(), s.end());
	ll r = 0;
	for (int i = 0; i < n; i++) r += ab(s[i] - s[n / 2]);
	return r;

	vector<ll> dp(sz,0);

	int mi = 0;

	for (int i = 0; i < n; i++) {
		vector<ll> ndp(sz);
		for (int j = 0; j < sz; j++) {
			ndp[j] = ab(j - s[i]);
			int d = max(0, j - h), u = min(sz - 1, j + h);
			if (d <= mi && u >= mi) ndp[j] += dp[mi];
			if (d > mi) ndp[j] += dp[d];
			if (u < mi) ndp[j] += dp[u];
			//ll mn = 1e18;
			//for (int k = max(0, j - h); k <= min(sz-1, j + h); k++) mn = min(mn, dp[k]);
			//ndp[j] += mn;
		}
		//for (int j : dp) printf("%d ", j); printf("\n");
		dp = ndp;

		mi = 0;
		for (int i = 0; i < sz; i++) if (dp[i] < dp[mi]) mi = i;
	}

	ll mn = 1e18;
	for (int i = 0; i < sz; i++) mn = min(mn, dp[i]);

	return mn;
}

int main() {
	int N, H;
	scanf("%d%d", &N, &H);
	vector<int> S(N);
	for (int i = 0; i < N; i++) scanf("%d", &S[i]);

	long long ans = func(N, H, move(S));

	printf("%lld\n", ans);
}

Compilation message

safety.cpp:3: warning: ignoring '#pragma warning ' [-Wunknown-pragmas]
    3 | #pragma warning (disable:4996)
      | 
safety.cpp: In function 'int main()':
safety.cpp:47:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |  scanf("%d%d", &N, &H);
      |  ~~~~~^~~~~~~~~~~~~~~~
safety.cpp:49:35: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |  for (int i = 0; i < N; i++) scanf("%d", &S[i]);
      |                              ~~~~~^~~~~~~~~~~~~

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 860 KB Output is correct
2 Correct 28 ms 2900 KB Output is correct
3 Correct 29 ms 2848 KB Output is correct

Subtask #5
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -