제출 #500635

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
500635		rainboy	Tortoise (CEOI21_tortoise)	C11	48 / 100	25 ms	1292 KiB

tortoise

#include <stdio.h>
#include <string.h>

#define N	300
#define INF	0x3f3f3f3f

int abs_(int a) { return a > 0 ? a : -a; }
int min(int a, int b) { return a < b ? a : b; }
int max(int a, int b) { return a > b ? a : b; }

int main() {
	static int aa[N], dp[N][N * 2 + 1], tt[N][N];
	int n, i, j, k, k_;
	long long ans;

	scanf("%d", &n);
	for (i = 0; i < n; i++)
		scanf("%d", &aa[i]);
	for (i = 0; i < n; i++)
		for (j = i; j < n; j++)
			if (aa[i] != -1 && aa[j] != -1) {
				tt[i][j] = INF;
				for (k = 0; k < n; k++)
					if (aa[k] == -1)
						tt[i][j] = min(tt[i][j], abs_(i - k) + abs_(k - j));
			}
	for (i = 0; i < n; i++)
		memset(dp[i], 0x3f, (n * 2 + 1) * sizeof *dp[i]);
	ans = 0;
	for (i = 0; i < n; i++)
		if (aa[i] > 0) {
			dp[i][1] = i;
			for (k = n * 2; k >= 0; k--) {
				int t = dp[i][k];

				if (t > i * 2)
					continue;
				for (k_ = k + 1; k_ <= n * 2 && k_ - k < aa[i]; k_++)
					dp[i][k_] = min(dp[i][k_], t + tt[i][i] * (k_ - k));
			}
			for (k = 0; k <= n * 2; k++) {
				int t = dp[i][k];

				if (t > i * 2)
					continue;
				ans = max(ans, k);
				for (j = i + 1; j < n; j++)
					if (aa[j] > 0)
						dp[j][k + 1] = min(dp[j][k + 1], t + tt[i][j]);
			}
		}
	ans = -ans;
	for (i = 0; i < n; i++)
		if (aa[i] > 0)
			ans += aa[i];
	printf("%lld\n", ans);
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

tortoise.c: In function 'main':
tortoise.c:16:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |  scanf("%d", &n);
      |  ^~~~~~~~~~~~~~~
tortoise.c:18:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |   scanf("%d", &aa[i]);
      |   ^~~~~~~~~~~~~~~~~~~

• Subtask 1: 8 / 8
• Subtask 2: 10 / 10
• Subtask 3: 30 / 30
• Subtask 4: 0 / 25
• Subtask 5: 0 / 27