結果

問題 No.1 道のショートカット
ユーザー mazesobamazesoba
提出日時 2018-04-21 12:24:57
言語 C
(gcc 12.3.0)
結果
RE  
実行時間 -
コード長 2,458 bytes
コンパイル時間 119 ms
コンパイル使用メモリ 29,960 KB
実行使用メモリ 4,504 KB
最終ジャッジ日時 2023-09-22 13:19:05
合計ジャッジ時間 4,114 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 RE -
testcase_01 RE -
testcase_02 RE -
testcase_03 RE -
testcase_04 RE -
testcase_05 RE -
testcase_06 RE -
testcase_07 RE -
testcase_08 RE -
testcase_09 RE -
testcase_10 RE -
testcase_11 RE -
testcase_12 RE -
testcase_13 RE -
testcase_14 RE -
testcase_15 RE -
testcase_16 RE -
testcase_17 RE -
testcase_18 RE -
testcase_19 RE -
testcase_20 RE -
testcase_21 RE -
testcase_22 RE -
testcase_23 RE -
testcase_24 RE -
testcase_25 RE -
testcase_26 RE -
testcase_27 RE -
testcase_28 RE -
testcase_29 RE -
testcase_30 RE -
testcase_31 RE -
testcase_32 RE -
testcase_33 RE -
testcase_34 RE -
testcase_35 RE -
testcase_36 RE -
testcase_37 RE -
testcase_38 RE -
testcase_39 RE -
testcase_40 RE -
testcase_41 RE -
testcase_42 RE -
testcase_43 RE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <stdio.h>
#include <stdlib.h>
#define True 1

typedef struct state
{
  unsigned int position;
  unsigned int Y_sum;
  unsigned int M_sum;
} state_t;

unsigned int main(void)
{
  unsigned int N; //街の数
  scanf("%d", &N);
  unsigned int C; //手持ちのお金
  scanf("%d", &C);
  unsigned int V; //道の数
  scanf("%d", &V);

  unsigned int *S; //S街から
  S = malloc(V * sizeof(unsigned int));
  for (unsigned int i = 0; i < V; i++)
  {
    scanf("%d", &S[i]);
  }

  unsigned int *T; //T街までの移動
  T = malloc(V * sizeof(unsigned int));
  for (unsigned int i = 0; i < V; i++)
  {
    scanf("%d", &T[i]);
  }

  unsigned int *Y; //コスト
  Y = malloc(V * sizeof(unsigned int));
  for (unsigned int i = 0; i < V; i++)
  {
    scanf("%d", &Y[i]);
  }

  unsigned int *M; //時間
  M = malloc(V * sizeof(unsigned int));
  for (unsigned int i = 0; i < V; i++)
  {
    scanf("%d", &M[i]);
  }

  unsigned int min_time = 1000 * 1500 + 1; //No.1の道がかかる時間
  state_t *current_state;
  current_state = malloc(V * sizeof(state_t));
  state_t *next_state;
  next_state = malloc(V * sizeof(state_t));
  unsigned int current_num = 1;
  unsigned int next_num;
  current_state[0].position = 1;
  current_state[0].Y_sum = 0;
  current_state[0].M_sum = 0;
  unsigned int next_Y;
  unsigned int next_M;
  while (True)
  {
    next_num = 0;
    for (unsigned int i = 0; i < current_num; i++)
    {
      for (unsigned int j = 0; j < V; j++)
      {
        if (current_state[i].position == S[j])
        {
          next_Y = current_state[i].Y_sum + Y[j];
          next_M = current_state[i].M_sum + M[j];
          if (T[j] != N && next_Y <= C)
          {
            next_state[next_num].position = T[j];
            next_state[next_num].Y_sum = next_Y;
            next_state[next_num].M_sum = next_M;
            next_num++;
          }
          else if (next_Y <= C)
          {
            if (next_M < min_time)
            {
              min_time = next_M;
            }
          }
        }
      }
    }
    if (next_num == 0)
    {
      break;
    }

    for (unsigned int i = 0; i < next_num; i++)
    {
      current_state[i].position = next_state[i].position;
      current_state[i].Y_sum = next_state[i].Y_sum;
      current_state[i].M_sum = next_state[i].M_sum;
    }
    current_num = next_num;
  }
  if (min_time == 1000 * 1500 + 1)
  {
    printf("-1\n");
  }
  else
  {
    printf("%d\n", min_time);
  }
}
0