Submission #72774521

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>
#define INF 1010101010
int n, k;
int query[5123][4];
int ans[128][128];
int main(void) {
  int i, j, l;
  if (scanf("%d%d", &n, &k) != 2) return 1;
  for (i = 0; i < k; i++) {
    if (scanf("%d%d%d", &query[i][0], &query[i][1],  &query[i][2]) != 3) return 1;
    if (query[i][0] == 1 && scanf("%d", &query[i][3]) != 1) return 1;
  }
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= n; j++) ans[i][j] = INF;
    ans[i][i] = 0;
  }
  for (i = 0; i < k; i++) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

#define INF 1010101010

int n, k;
int query[5123][4];

int ans[128][128];

int main(void) {
	int i, j, l;
	if (scanf("%d%d", &n, &k) != 2) return 1;
	for (i = 0; i < k; i++) {
		if (scanf("%d%d%d", &query[i][0], &query[i][1],  &query[i][2]) != 3) return 1;
		if (query[i][0] == 1 && scanf("%d", &query[i][3]) != 1) return 1;
	}
	for (i = 1; i <= n; i++) {
		for (j = 1; j <= n; j++) ans[i][j] = INF;
		ans[i][i] = 0;
	}
	for (i = 0; i < k; i++) {
		if (query[i][0] == 0) {
			int res = ans[query[i][1]][query[i][2]];
			printf("%d\n", res < INF ? res : -1);
		} else if (query[i][0] == 1) {
			int f = query[i][1], t = query[i][2], cost = query[i][3];
			if (ans[f][t] > cost) {
				ans[f][t] = cost;
				for (j = 1; j <= n; j++) {
					for (l = 1; l <= n; l++) {
						int newcost = ans[j][f] + ans[f][t] + ans[t][l];
						if (newcost < ans[j][l]) ans[j][l] = newcost;
					}
				}
			}
			if (ans[t][f] > cost) {
				ans[t][f] = cost;
				for (j = 1; j <= n; j++) {
					for (l = 1; l <= n; l++) {
						int newcost = ans[j][t] + ans[t][f] + ans[f][l];
						if (newcost < ans[j][l]) ans[j][l] = newcost;
					}
				}
			}
		}
	}
	return 0;
}

Submission Info

Judge Result