結果
問題 | No.1812 Uribo Road |
ユーザー |
👑 |
提出日時 | 2021-12-29 22:46:57 |
言語 | C (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 71 ms / 5,000 ms |
コード長 | 2,686 bytes |
コンパイル時間 | 237 ms |
コンパイル使用メモリ | 33,856 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-10-07 00:48:48 |
合計ジャッジ時間 | 1,628 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 30 |
ソースコード
#include <stdio.h>const int bit[13] = {1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096};typedef struct {int key, id;} data;typedef struct {data obj[40001];int size;} min_heap;void push(min_heap* h, data x){int i = ++(h->size), j = i >> 1;data tmp;h->obj[i] = x;while (j > 0) {if (h->obj[i].key < h->obj[j].key) {tmp = h->obj[j];h->obj[j] = h->obj[i];h->obj[i] = tmp;i = j;j >>= 1;} else break;}}data pop(min_heap* h){int i = 1, j = 2;data output = h->obj[1], tmp;h->obj[1] = h->obj[(h->size)--];while (j <= h->size) {if (j < h->size && h->obj[j^1].key < h->obj[j].key) j ^= 1;if (h->obj[j].key < h->obj[i].key) {tmp = h->obj[j];h->obj[j] = h->obj[i];h->obj[i] = tmp;i = j;j <<= 1;} else break;}return output;}typedef struct Edge {struct Edge *next;int v, cost;} edge;void chmin(int* a, int b){if (*a > b) *a = b;}int main(){int i, j, N, M, K, u, w, c, R[13], T[13][2];edge *adj[10001] = {}, e[40001], *p;scanf("%d %d %d", &N, &M, &K);for (i = 0; i < K; i++) {scanf("%d", &(R[i]));R[i]--;}for (i = 0; i < M; i++) {scanf("%d %d %d", &u, &w, &c);e[i*2].v = w;e[i*2+1].v = u;e[i*2].cost = c;e[i*2+1].cost = c;e[i*2].next = adj[u];e[i*2+1].next = adj[w];adj[u] = &(e[i*2]);adj[w] = &(e[i*2+1]);}for (i = 0, T[K][0] = N, T[K][1] = 1; i < K; i++) for (j = 0; j < 2; j++) T[i][j] = e[R[i]*2+j].v;const int sup = (1 << 30) - 1;int dist[13][2][10001];data d;min_heap h;h.size = 0;for (i = 0; i <= K; i++) {for (j = 0; j < 2; j++) {for (u = 1; u <= N; u++) dist[i][j][u] = sup;dist[i][j][T[i][j]] = 0;d.key = 0;d.id = T[i][j];push(&h, d);while (h.size > 0) {d = pop(&h);u = d.id;if (d.key != dist[i][j][u]) continue;for (p = adj[u]; p != NULL; p = p->next) {w = p->v;if (dist[i][j][w] > dist[i][j][u] + p->cost) {dist[i][j][w] = dist[i][j][u] + p->cost;d.key = dist[i][j][w];d.id = w;push(&h, d);}}}}}int ii, jj, k, dp[4096][13][2];for (k = 0; k < bit[K]; k++) for (i = 0; i <= K; i++) for (j = 0; j < 2; j++) dp[k][i][j] = sup;dp[0][K][1] = 0;for (k = 1; k < bit[K]; k++) {for (i = 0; i < K; i++) {if ((k & bit[i]) == 0) continue;for (j = 0; j < 2; j++) {for (ii = 0; ii <= K; ii++) for (jj = 0; jj < 2; jj++) chmin(&(dp[k][i][j]), dp[k^bit[i]][ii][jj] + dist[ii][jj][T[i][j^1]] + e[R[i]*2].cost);}}}int ans = sup;for (i = 0; i < K; i++) for (j = 0; j < 2; j++) chmin(&ans, dp[bit[K]-1][i][j] + dist[i][j][N]);printf("%d\n", ans);fflush(stdout);return 0;}