oj.uz

답안 #382731

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
382731 2021-03-28T06:17:26 Z jainbot27 Robot (JOI21_ho_t4) C++17
100 / 100
 1176 ms 84572 KB 
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
 
const ll INF = 1e18;
 
struct Edge {
	int to, c;
	ll p;
};
 
map<int, vector<Edge>> graph[100001];
ll dp[100001];
map<int, ll> dp2[100001], psum[100001];
 
int main() {
	cin.tie(0)->sync_with_stdio(0);
	int n, m;
	cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		int u, v, c;
		ll p;
		cin >> u >> v >> c >> p;
		graph[u][c].push_back({v, c, p});
		graph[v][c].push_back({u, c, p});
		psum[u][c] += p;
		psum[v][c] += p;
	}
 
	memset(dp, 0x3f, sizeof dp);
	dp[1] = 0;
	priority_queue<tuple<ll, int, int>> pq;
	pq.push({0, 1, 0});
	while (pq.size()) {
		ll cost;
		int node, c;
		tie(cost, node, c) = pq.top();
		pq.pop();
 
		if (c) {
			if (dp2[node][c] != -cost) continue;
			for (Edge i : graph[node][c]) {
				// We can't flip i in this case
				ll case1 = psum[node][c] - i.p;
				if (case1 - cost < dp[i.to]) {
					dp[i.to] = case1 - cost;
					pq.push({-dp[i.to], i.to, 0});
				}
			}
		} else {
			if (dp[node] != -cost) continue;
			for (auto& i : graph[node]) {
				for (Edge j : i.second) {
					// Case 1: We don't flip j
					ll case1 = psum[node][j.c] - j.p - cost;
					if (case1 < dp[j.to]) {
						dp[j.to] = case1;
						pq.push({-dp[j.to], j.to, 0});
					}
					// Case 2: We flip j but not another edge of the same colour
					ll case2 = j.p - cost;
					if (case2 < dp[j.to]) {
						dp[j.to] = case2;
						pq.push({-dp[j.to], j.to, 0});
					}
					// Case 3: We flip j and another edge of the same colour
					ll case3 = -cost;
					if (!dp2[j.to].count(j.c) || case3 < dp2[j.to][j.c]) {
						dp2[j.to][j.c] = case3;
						pq.push({-dp2[j.to][j.c], j.to, j.c});
					}
				}
			}
		}
	}
	cout << (dp[n] > INF ? -1 : dp[n]);
	return 0;
}

Subtask #1
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 15212 KB Output is correct
2 Correct 11 ms 15212 KB Output is correct
3 Correct 11 ms 15212 KB Output is correct
4 Correct 13 ms 15212 KB Output is correct
5 Correct 11 ms 15212 KB Output is correct
6 Correct 11 ms 15212 KB Output is correct
7 Correct 14 ms 15340 KB Output is correct
8 Correct 11 ms 15212 KB Output is correct
9 Correct 15 ms 15852 KB Output is correct
10 Correct 15 ms 15816 KB Output is correct
11 Correct 13 ms 15596 KB Output is correct
12 Correct 13 ms 15596 KB Output is correct
13 Correct 13 ms 15596 KB Output is correct
14 Correct 13 ms 15596 KB Output is correct
15 Correct 12 ms 15468 KB Output is correct
16 Correct 16 ms 15596 KB Output is correct
17 Correct 13 ms 15596 KB Output is correct
18 Correct 14 ms 15340 KB Output is correct
19 Correct 13 ms 15468 KB Output is correct
20 Correct 12 ms 15468 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 238 ms 33632 KB Output is correct
2 Correct 101 ms 24676 KB Output is correct
3 Correct 259 ms 29816 KB Output is correct
4 Correct 146 ms 27360 KB Output is correct
5 Correct 1118 ms 78940 KB Output is correct
6 Correct 819 ms 68180 KB Output is correct
7 Correct 436 ms 52552 KB Output is correct
8 Correct 462 ms 46828 KB Output is correct
9 Correct 521 ms 47084 KB Output is correct
10 Correct 377 ms 45924 KB Output is correct
11 Correct 160 ms 30956 KB Output is correct

Subtask #3
42.0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 15212 KB Output is correct
2 Correct 11 ms 15212 KB Output is correct
3 Correct 11 ms 15212 KB Output is correct
4 Correct 13 ms 15212 KB Output is correct
5 Correct 11 ms 15212 KB Output is correct
6 Correct 11 ms 15212 KB Output is correct
7 Correct 14 ms 15340 KB Output is correct
8 Correct 11 ms 15212 KB Output is correct
9 Correct 15 ms 15852 KB Output is correct
10 Correct 15 ms 15816 KB Output is correct
11 Correct 13 ms 15596 KB Output is correct
12 Correct 13 ms 15596 KB Output is correct
13 Correct 13 ms 15596 KB Output is correct
14 Correct 13 ms 15596 KB Output is correct
15 Correct 12 ms 15468 KB Output is correct
16 Correct 16 ms 15596 KB Output is correct
17 Correct 13 ms 15596 KB Output is correct
18 Correct 14 ms 15340 KB Output is correct
19 Correct 13 ms 15468 KB Output is correct
20 Correct 12 ms 15468 KB Output is correct
21 Correct 238 ms 33632 KB Output is correct
22 Correct 101 ms 24676 KB Output is correct
23 Correct 259 ms 29816 KB Output is correct
24 Correct 146 ms 27360 KB Output is correct
25 Correct 1118 ms 78940 KB Output is correct
26 Correct 819 ms 68180 KB Output is correct
27 Correct 436 ms 52552 KB Output is correct
28 Correct 462 ms 46828 KB Output is correct
29 Correct 521 ms 47084 KB Output is correct
30 Correct 377 ms 45924 KB Output is correct
31 Correct 160 ms 30956 KB Output is correct
32 Correct 162 ms 29224 KB Output is correct
33 Correct 211 ms 29920 KB Output is correct
34 Correct 507 ms 50652 KB Output is correct
35 Correct 351 ms 41948 KB Output is correct
36 Correct 372 ms 46932 KB Output is correct
37 Correct 446 ms 49320 KB Output is correct
38 Correct 415 ms 55632 KB Output is correct
39 Correct 200 ms 32620 KB Output is correct
40 Correct 510 ms 52360 KB Output is correct
41 Correct 532 ms 52740 KB Output is correct
42 Correct 568 ms 61148 KB Output is correct
43 Correct 272 ms 37600 KB Output is correct
44 Correct 570 ms 43616 KB Output is correct
45 Correct 389 ms 47644 KB Output is correct
46 Correct 331 ms 48016 KB Output is correct
47 Correct 403 ms 49484 KB Output is correct
48 Correct 1176 ms 84572 KB Output is correct