#82248 (C++11) No.1 道のショートカット

• 問題: No.1 道のショートカット
• ユーザー: tsukio
• 提出日時: 2016-03-18 01:50:28
• 言語: C++11 (gcc 11.4.0)
• 結果: WA
• 実行時間: -
• コード長: 1,399 bytes
• コンパイル時間: 636 ms
• コンパイル使用メモリ: 68,276 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-08 04:24:56
• 合計ジャッジ時間: 1,522 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	1 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	WA	-
testcase_04	AC	1 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	WA	-
testcase_07	AC	1 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	2 ms; 5,376 KB
testcase_11	AC	3 ms; 5,376 KB
testcase_12	AC	4 ms; 5,376 KB
testcase_13	AC	3 ms; 5,376 KB
testcase_14	AC	2 ms; 5,376 KB
testcase_15	WA	-
testcase_16	AC	2 ms; 5,376 KB
testcase_17	WA	-
testcase_18	AC	2 ms; 5,376 KB
testcase_19	AC	1 ms; 5,376 KB
testcase_20	AC	1 ms; 5,376 KB
testcase_21	AC	2 ms; 5,376 KB
testcase_22	AC	1 ms; 5,376 KB
testcase_23	AC	5 ms; 5,376 KB
testcase_24	AC	6 ms; 5,376 KB
testcase_25	AC	2 ms; 5,376 KB
testcase_26	AC	2 ms; 5,376 KB
testcase_27	AC	3 ms; 5,376 KB
testcase_28	AC	1 ms; 5,376 KB
testcase_29	AC	3 ms; 5,376 KB
testcase_30	AC	1 ms; 5,376 KB
testcase_31	AC	2 ms; 5,376 KB
testcase_32	AC	2 ms; 5,376 KB
testcase_33	AC	2 ms; 5,376 KB
testcase_34	AC	4 ms; 5,376 KB
testcase_35	AC	2 ms; 5,376 KB
testcase_36	AC	2 ms; 5,376 KB
testcase_37	AC	2 ms; 5,376 KB
testcase_38	AC	1 ms; 5,376 KB
testcase_39	AC	1 ms; 5,376 KB
testcase_40	AC	2 ms; 5,376 KB
testcase_41	AC	2 ms; 5,376 KB
testcase_42	AC	1 ms; 5,376 KB
testcase_43	WA	-

ソースコード

#include <iostream>
#include <vector>
#include <queue>
#include <climits>
using namespace std;

struct Road {
	int town_num;
	int money;
	int time;
};

struct State {
	int town_num;
	int remaining_money;
	int total_time;
};

int main() {
	int n, c, v;
	cin >> n >> c >> v;

	int data[1500][4];
	for (int y = 0; y < 4; y++) {
		for (int x = 0; x < v; x++) {
			cin >> data[x][y];
		}
	}

	vector<Road> all_roads[51];
	for (int x = 0; x < v; x++) {
		all_roads[data[x][0]].emplace_back(Road{ data[x][1], data[x][2], data[x][3] });
	}

	int dist[51][301];
	for (int i = 0; i <= n; i++) {
		for (int j = 0; j <= c; j++) {
			dist[i][j] = INT_MAX;
		}
	}
	
	queue<State> states;
	states.push(State{ 1, c, 0 });

	while (!states.empty()) {
		State state = states.front(); states.pop();
		vector<Road> roads = all_roads[state.town_num];
		for (int i = 0; i < roads.size(); i++) {
			Road road = roads[i];

			int remaining_money = state.remaining_money - road.money;
			if (remaining_money < 0)
				continue;

			int total_time = state.total_time + road.time;
			int cost = dist[road.town_num][remaining_money];
			if (total_time >= cost)
				continue;
			dist[road.town_num][remaining_money] = total_time;

			states.push(State{ road.town_num, remaining_money, total_time});
		}
	}

	int ans = INT_MAX;
	for (int i = 0; i <= c; i++) {
		ans = min(ans, dist[n][i]);
	}

	cout << ans << endl;

	return 0;
}