oj.uz

답안 #997930

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
997930 2024-06-13T06:48:58 Z Trisanu_Das 은하철도 (APIO24_train) C++17
5 / 100
 55 ms 18092 KB 
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5+5;
const ll INF = 5e15;
 
vector<array<int, 4> > adj[N];
ll dist[N];
 
long long solve(int n, int m, int w, vector<int> T,
	vector<int> X, vector<int> Y,
	vector<int> A, vector<int> B, vector<int> C,
	vector<int> L, vector<int> R) {
	for (int i = 0; i < n; i++) adj[i].clear();
	for (int i = 0; i < m; i++)
		adj[X[i]].push_back({A[i], B[i], Y[i], C[i]});
	for (int i = 0; i < n; i++) sort(adj[i].begin(), adj[i].end());
	dist[0] = 0;
	for (int i = 1; i < n; i++) dist[i] = INF;
	priority_queue<array<ll, 3>, vector<array<ll, 3>>, greater<array<ll, 3>>> pq;
	pq.push({0, 0, 0});
	while (pq.size()) {
		auto [cost, tim, node] = pq.top();
		pq.pop();
		if (cost > dist[node]) continue;
		dist[node] = cost;
		for (auto [l, r, y, c] : adj[node]) if (l >= tim && cost+c < dist[y]) pq.push({cost+c, r, y});
	}
	return (dist[n-1] == INF ? -1 : dist[n-1]);
}

Subtask #1
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 6488 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 13332 KB Correct.
2 Correct 52 ms 14160 KB Correct.
3 Correct 1 ms 6492 KB Correct.
4 Correct 8 ms 7352 KB Correct.
5 Correct 2 ms 6492 KB Correct.
6 Correct 43 ms 13796 KB Correct.
7 Correct 2 ms 6488 KB Correct.
8 Correct 49 ms 18092 KB Correct.
9 Correct 55 ms 14160 KB Correct.

Subtask #3
0.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 13332 KB Correct.
2 Correct 52 ms 14160 KB Correct.
3 Correct 1 ms 6492 KB Correct.
4 Correct 8 ms 7352 KB Correct.
5 Correct 2 ms 6492 KB Correct.
6 Correct 43 ms 13796 KB Correct.
7 Correct 2 ms 6488 KB Correct.
8 Correct 49 ms 18092 KB Correct.
9 Correct 55 ms 14160 KB Correct.
10 Incorrect 55 ms 15128 KB Wrong Answer.
11 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 6488 KB Wrong Answer.
2 Halted 0 ms 0 KB -