#893942 (C++17) No.2387 Yokan Factory

• 問題: No.2387 Yokan Factory
• ユーザー: achapi
• 提出日時: 2023-07-21 21:56:58
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 484 ms / 5,000 ms
• コード長: 1,192 bytes
• コンパイル時間: 2,409 ms
• コンパイル使用メモリ: 213,016 KB
• 実行使用メモリ: 13,024 KB
• 最終ジャッジ日時: 2024-09-21 23:28:31
• 合計ジャッジ時間: 7,592 ms
• ジャッジサーバーID （参考情報）: judge1 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	2 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	2 ms; 5,376 KB
testcase_12	AC	2 ms; 5,376 KB
testcase_13	AC	2 ms; 5,376 KB
testcase_14	AC	2 ms; 5,376 KB
testcase_15	AC	262 ms; 13,024 KB
testcase_16	AC	180 ms; 12,008 KB
testcase_17	AC	370 ms; 12,192 KB
testcase_18	AC	375 ms; 10,896 KB
testcase_19	AC	281 ms; 8,800 KB
testcase_20	AC	258 ms; 8,328 KB
testcase_21	AC	484 ms; 10,584 KB
testcase_22	AC	218 ms; 7,892 KB
testcase_23	AC	299 ms; 8,868 KB
testcase_24	AC	139 ms; 8,252 KB
testcase_25	AC	185 ms; 6,612 KB
testcase_26	AC	350 ms; 9,556 KB
testcase_27	AC	410 ms; 10,260 KB
testcase_28	AC	4 ms; 5,376 KB
testcase_29	AC	5 ms; 5,376 KB
testcase_30	AC	4 ms; 5,376 KB
testcase_31	AC	3 ms; 5,376 KB
testcase_32	AC	3 ms; 5,376 KB
testcase_33	AC	3 ms; 5,376 KB
testcase_34	AC	5 ms; 5,376 KB
testcase_35	AC	4 ms; 5,376 KB
testcase_36	AC	3 ms; 5,376 KB
testcase_37	AC	2 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;

struct Edge{
	int to;
	long long cost;
	long long cap;
};
using Graph = vector<vector<Edge>>;
using Pair = pair<long long, int>;

void Dijkstra(const Graph& graph, vector<long long>& distances, int startIndex, int cap){
	priority_queue<Pair, vector<Pair>, greater<Pair>> q;
	q.emplace((distances[startIndex] = 0), startIndex);
	while (!q.empty()){
		const long long distance = q.top().first;
		const int from = q.top().second;
		q.pop();
		if (distances[from] < distance)continue;
		for (const auto& edge : graph[from]){
			const long long d = (distances[from] + edge.cost);
			if (d < distances[edge.to] and edge.cap >= cap){
				q.emplace((distances[edge.to] = d), edge.to);
			}
		}
	}
}

int main() {
	int N, M;
	long long X;
	cin >> N >> M >> X;
	Graph G(N);
	for (int i = 0; i < M; i++){
		int u, v, a, b;
		cin >> u >> v >> a >> b;
		u--;
		v--;
		G[u].push_back({v, a, b});
		G[v].push_back({u, a, b});
	}
	int l = -1, r = 1e9 + 10;
	while (r - l > 1){
		int mid = l + (r - l) / 2;
		vector<long long> d(N, (long long) 1e15);
		Dijkstra(G, d, 0, mid);
		if (d[N - 1] <= X){
			l = mid;
		} else {
			r = mid;
		}
	}
	cout << l << '\n';
}