Submission #72925519

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <stdio.h>
int N, D;
int price[400][3123];
int price_rui[400][3123];
int memo[400];
int calc(int day) {
  int ans = -1;
  int i, j;
  if (day >= D) return 0;
  if (memo[day]) return ~memo[day];
  for (i = 0; i < N; i++) {
    int candidate;
    candidate = calc(day + 1) + price[day][i];
    if (ans < 0 || candidate < ans) ans = candidate;
    if (day + 1 < D) {
      candidate = calc(day + 2) + price[day][i] + price[day + 1][i] * 9 / 10;
      if (ans < 0 || candidate < ans) ans = candidate;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

int N, D;
int price[400][3123];

int price_rui[400][3123];

int memo[400];

int calc(int day) {
	int ans = -1;
	int i, j;
	if (day >= D) return 0;
	if (memo[day]) return ~memo[day];
	for (i = 0; i < N; i++) {
		int candidate;
		candidate = calc(day + 1) + price[day][i];
		if (ans < 0 || candidate < ans) ans = candidate;
		if (day + 1 < D) {
			candidate = calc(day + 2) + price[day][i] + price[day + 1][i] * 9 / 10;
			if (ans < 0 || candidate < ans) ans = candidate;
		}
		for (j = day + 2; j < D; j++) {
			candidate = calc(j + 1);
			candidate += price[day][i];
			candidate += price[day + 1][i] * 9 / 10;
			candidate += (price_rui[j][i] - price_rui[day + 1][i]) * 7 / 10;
			if (ans < 0 || candidate < ans) ans = candidate;
		}
	}
	return ~(memo[day] = ~ans);
}

int main(void) {
	int i, j;
	if (scanf("%d%d", &N, &D) != 2) return 1;
	for (i = 0; i < D; i++) {
		for (j = 0; j < N; j++) {
			if (scanf("%d", &price[i][j]) != 1) return 1;
			price_rui[i][j] = (i == 0 ? 0 : price_rui[i - 1][j]) + price[i][j];
		}
	}
	printf("%d\n", calc(0));
	return 0;
}

Submission Info

Judge Result