Submission #964228

#	Time	Username	Problem	Language	Result	Execution time	Memory
964228		guechotjrhh	Safety (NOI18_safety)	C++14	71 / 100	2070 ms	3748 KiB

safety

#include<stdio.h>
#include<vector>
#pragma warning (disable:4996)
using namespace std;

#include<algorithm>
#include<iostream>
#define ll long long
ll ab(ll n) { return n > 0 ? n : -n; }
int sz = 5001, inf = 1e9;
long long func(int n, int h, vector<int> s) {
	if (h == 0) {
		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<int> le = { 0 }, ri = { inf };
	ll val = 0;
	
	//vector<ll> dp(sz, 0);

	//int mi = 0;

	for (int i = 0; i < n; i++) {
		for (int j = 0; j < ri.size(); j++) {
			ri[j] += h; if (ri[j] > inf) ri[j] = inf;
		}
		for (int j = 0; j < le.size(); j++) {
			le[j] -= h; if (le[j] < 0) le[j] = 0;
		}
		
		vector<int> nle, nri;
		ll nval;
		if (s[i] <= ri[0] && s[i] >= le[0]) {
			nval = val;
			nle = { s[i] };
			//if (s[i] != le[0]) nle.push_back(le[0]);
			for (int j = 0; j < le.size(); j++) nle.push_back(le[j]);
			nri = { s[i] };
			//if (ri[0] != s[i]) nri.push_back(ri[0]);
			for (int j = 0; j < ri.size(); j++) nri.push_back(ri[j]);
		}
		else if (s[i] > ri[0]) {
			nval = val + s[i] - ri[0];
			nle = { ri[0] };
			//if (ri[0] != le[0]) nle.push_back(le[0]);
			for (int j = 0; j < le.size(); j++) nle.push_back(le[j]);
			nri = { ri[1], s[i], s[i] };
			for (int j = 2; j < ri.size();j++) nri.push_back(ri[j]);
			sort(nri.begin(), nri.end());
		}
		else {
			nval = val + le[0] - s[i];
			nle = { le[1], s[i], s[i] };
			for (int j = 2; j < le.size(); j++) nle.push_back(le[j]);
			sort(nle.begin(), nle.end());
			reverse(nle.begin(), nle.end());
			nri = { le[0] };
			//if (ri[0] != le[0]) nri.push_back(ri[0]);
			for (int j = 0; j < ri.size();j++) nri.push_back(ri[j]);
		}
		val = nval;
		ri = nri;
		le = nle;
		
		/*vector<ll> sdp(sz);
		for (int j = le[0]; j <= ri[0]; j++) sdp[j] = val;
		for (int j = 1; j < le.size(); j++) for (int w = le[j - 1] - 1; w >= le[j]; w--) sdp[w] = sdp[w + 1] + j;
		for (int j = 1; j < ri.size(); j++) for (int w = ri[j - 1] + 1; w <= ri[j]; w++) sdp[w] = sdp[w - 1] + j;
		//cout << val << endl;
		//for (int i : le) cout << i << ' '; cout << endl;
		//for (int i : ri) cout << i << ' '; cout << endl;


		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;

		if (sdp != dp) {
			cout << i << endl;
			for (int j : sdp) cout << j << ' '; cout << endl;
			for (int j : dp) cout << j << ' '; cout << endl;
			return 0;
		}*/
	}
	return val;

	/*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 (stderr)

safety.cpp:3: warning: ignoring '#pragma warning ' [-Wunknown-pragmas]
    3 | #pragma warning (disable:4996)
      | 
safety.cpp: In function 'long long int func(int, int, std::vector<int>)':
safety.cpp:27:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |   for (int j = 0; j < ri.size(); j++) {
      |                   ~~^~~~~~~~~~~
safety.cpp:30:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |   for (int j = 0; j < le.size(); j++) {
      |                   ~~^~~~~~~~~~~
safety.cpp:40:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |    for (int j = 0; j < le.size(); j++) nle.push_back(le[j]);
      |                    ~~^~~~~~~~~~~
safety.cpp:43:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |    for (int j = 0; j < ri.size(); j++) nri.push_back(ri[j]);
      |                    ~~^~~~~~~~~~~
safety.cpp:49:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |    for (int j = 0; j < le.size(); j++) nle.push_back(le[j]);
      |                    ~~^~~~~~~~~~~
safety.cpp:51:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |    for (int j = 2; j < ri.size();j++) nri.push_back(ri[j]);
      |                    ~~^~~~~~~~~~~
safety.cpp:57:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |    for (int j = 2; j < le.size(); j++) nle.push_back(le[j]);
      |                    ~~^~~~~~~~~~~
safety.cpp:62:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |    for (int j = 0; j < ri.size();j++) nri.push_back(ri[j]);
      |                    ~~^~~~~~~~~~~
safety.cpp: In function 'int main()':
safety.cpp:134:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  134 |  scanf("%d%d", &N, &H);
      |  ~~~~~^~~~~~~~~~~~~~~~
safety.cpp:136:35: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  136 |  for (int i = 0; i < N; i++) scanf("%d", &S[i]);
      |                              ~~~~~^~~~~~~~~~~~~

• Subtask 1: 3 / 3
• Subtask 2: 4 / 4
• Subtask 3: 9 / 9
• Subtask 4: 5 / 5
• Subtask 5: 6 / 6
• Subtask 6: 11 / 11
• Subtask 7: 11 / 11
• Subtask 8: 22 / 22
• Subtask 9: 0 / 29