oj.uz

답안 #964135

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
964135 2024-04-16T10:59:36 Z guechotjrhh Safety (NOI18_safety) C++14
38 / 100
 209 ms 2612 KB 
#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;
	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] };
			for (int j : le) if (j < s[i]) nle.push_back(j);
			nri = { s[i] };
			for (int j : ri) if (j > s[i]) nri.push_back(j);
		}
		else if (s[i] > ri[0]) {
			nval = val + s[i] - ri[0];
			nle = { ri[0] };
			for (int j : le) if (j < ri[0]) nle.push_back(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] };
			for (int j : ri) if (j > le[0]) nri.push_back(j);
		}
		val = nval;
		ri = nri;
		le = nle;

		//cout << val << endl;
		//for (int i : le) cout << i << ' '; cout << endl;
		//for (int i : ri) cout << i << ' '; cout << endl;
	}
	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

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:22:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |   for (int j = 0; j < ri.size(); j++) {
      |                   ~~^~~~~~~~~~~
safety.cpp:25:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |   for (int j = 0; j < le.size(); 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 = 2; 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 = 2; j < le.size(); j++) nle.push_back(le[j]);
      |                    ~~^~~~~~~~~~~
safety.cpp:81:3: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   81 |   for (int j : dp) printf("%d ", j); printf("\n");
      |   ^~~
safety.cpp:81:38: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   81 |   for (int j : dp) printf("%d ", j); printf("\n");
      |                                      ^~~~~~
safety.cpp: In function 'int main()':
safety.cpp:96:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   96 |  scanf("%d%d", &N, &H);
      |  ~~~~~^~~~~~~~~~~~~~~~
safety.cpp:98:35: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   98 |  for (int i = 0; i < N; i++) scanf("%d", &S[i]);
      |                              ~~~~~^~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 440 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 436 KB Output is correct
5 Correct 1 ms 344 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 508 KB Output is correct
5 Correct 0 ms 436 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 1952 KB Output is correct
2 Correct 30 ms 2612 KB Output is correct
3 Correct 34 ms 2284 KB Output is correct

Subtask #5
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 440 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 436 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 2 ms 436 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 440 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 436 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 2 ms 436 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 1 ms 432 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 3 ms 348 KB Output is correct

Subtask #7
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 440 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 436 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 2 ms 436 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 1 ms 432 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 3 ms 348 KB Output is correct
28 Incorrect 209 ms 612 KB Output isn't correct
29 Halted 0 ms 0 KB -

Subtask #8
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 440 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 436 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 508 KB Output is correct
17 Correct 0 ms 436 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 2 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 2 ms 436 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 2 ms 348 KB Output is correct
28 Correct 1 ms 432 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 2 ms 348 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 3 ms 348 KB Output is correct
34 Incorrect 209 ms 612 KB Output isn't correct
35 Halted 0 ms 0 KB -

Subtask #9
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 440 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 436 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 508 KB Output is correct
17 Correct 0 ms 436 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 21 ms 1952 KB Output is correct
20 Correct 30 ms 2612 KB Output is correct
21 Correct 34 ms 2284 KB Output is correct
22 Correct 2 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 2 ms 436 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 2 ms 348 KB Output is correct
31 Correct 1 ms 432 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 2 ms 348 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 3 ms 348 KB Output is correct
37 Incorrect 209 ms 612 KB Output isn't correct
38 Halted 0 ms 0 KB -