Submission #72830020

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>
#include <stdlib.h>
#define INF 1010101010
int n, m;
int k[160];
int x[160][12], d[160][12];
int memo[160][12][160];
int calc(int row, int col, int left) {
  int ans = INF;
  int i, delta;
  if (row > n) return 0;
  if (memo[row][col][left]) return ~memo[row][col][left];
  for (delta = 1; delta <= 2; delta++) {
    int next_left = left - (delta != 1);
    if (next_left >= 0) {
      for (i = 0; i < k[row + delta]; i++) {
        int candidate = calc(row + delta, i, next_left);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>
#include <stdlib.h>

#define INF 1010101010

int n, m;
int k[160];
int x[160][12], d[160][12];

int memo[160][12][160];

int calc(int row, int col, int left) {
	int ans = INF;
	int i, delta;
	if (row > n) return 0;
	if (memo[row][col][left]) return ~memo[row][col][left];
	for (delta = 1; delta <= 2; delta++) {
		int next_left = left - (delta != 1);
		if (next_left >= 0) {
			for (i = 0; i < k[row + delta]; i++) {
				int candidate = calc(row + delta, i, next_left);
				if (1 <= row && row + delta <= n) {
					candidate += (d[row][col] + d[row + delta][i]) * abs(x[row][col] - x[row + delta][i]);
				}
				if (candidate < ans) ans = candidate;
			}
		}
	}
	return ~(memo[row][col][left] = ~ans);
}

int main(void) {
	int i;
	if (scanf("%d%d", &n, &m) != 2) return 1;
	for (i = 1; i <= n; i++) {
		int j;
		if (scanf("%d", &k[i]) != 1) return 1;
		for (j = 0; j < k[i]; j++) {
			if (scanf("%d%d", &x[i][j], &d[i][j]) != 2) return 1;
		}
	}
	k[0] = 1;
	k[n + 1] = 1;
	k[n + 2] = 1;
	printf("%d\n", calc(0, 0, m));
	return 0;
}

Submission Info

Judge Result