oj.uz

Submission #526655

# Submission time Handle Problem Language Result Execution time Memory
526655 2022-02-15T20:59:39 Z LucaDantas Robot (JOI21_ho_t4) C++17
100 / 100
 1644 ms 114936 KB 
#include <bits/stdc++.h>
using namespace std;

constexpr int maxn = 2e5+10;

struct Edge { int a, b, c, p; } edges[maxn];

vector<pair<int,int>> g[maxn];

map<pair<int,int>, long long> dp;
set<pair<int,int>> mark;

map<int, vector<pair<int,int>>> viz[maxn];
map<int,long long> soma[maxn];

priority_queue<pair<long long,pair<int,int>>> q;

inline void add(const pair<int,int>& p, long long val) { if(!dp.count(p) || val < dp[p]) dp[p] = val, q.push({-val, p}); }

void dijkstra() {
	dp[{1,0}] = 0;

	// dp[index][cor]
	q.push({0, {1,0}});

	while(q.size()) {
		auto [u, cor] = q.top().second;
		long long val = -q.top().first; q.pop();

		if(mark.count({u, cor})) continue;
		mark.insert({u, cor});

		if(!cor) {
			for(auto [v, id] : g[u]) {
				int c = edges[id].c, p = edges[id].p;
				add({v, c}, val);
				add({v, 0}, min(val + soma[u][c] - p, val + p));
			}
		} else {
			vector<pair<int,int>>& adj = viz[u][cor];
			for(auto [v, p] : adj)
				add({v, 0}, val + soma[u][cor] - p);
		}
	}
}

int main() {
	int n, m; scanf("%d %d", &n, &m);
	for(int i = 0, a, b, c, p; i < m; i++) {
		scanf("%d %d %d %d", &a, &b, &c, &p), edges[i] = {a, b, c, p};
		g[a].push_back({b, i}), g[b].push_back({a, i});
		viz[a][c].push_back({b, p});
		viz[b][c].push_back({a, p});
		soma[a][c] += p;
		soma[b][c] += p;
	}
	dijkstra();
	printf("%lld\n", dp.count({n, 0}) ? dp[{n, 0}] : -1);
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:48:17: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |  int n, m; scanf("%d %d", &n, &m);
      |            ~~~~~^~~~~~~~~~~~~~~~~
Main.cpp:50:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |   scanf("%d %d %d %d", &a, &b, &c, &p), edges[i] = {a, b, c, p};
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23756 KB Output is correct
2 Correct 14 ms 23664 KB Output is correct
3 Correct 11 ms 23796 KB Output is correct
4 Correct 12 ms 23664 KB Output is correct
5 Correct 12 ms 23736 KB Output is correct
6 Correct 12 ms 23744 KB Output is correct
7 Correct 13 ms 24012 KB Output is correct
8 Correct 12 ms 23824 KB Output is correct
9 Correct 18 ms 24624 KB Output is correct
10 Correct 16 ms 24496 KB Output is correct
11 Correct 15 ms 24268 KB Output is correct
12 Correct 15 ms 24196 KB Output is correct
13 Correct 14 ms 24276 KB Output is correct
14 Correct 15 ms 24268 KB Output is correct
15 Correct 16 ms 24140 KB Output is correct
16 Correct 17 ms 24212 KB Output is correct
17 Correct 16 ms 24268 KB Output is correct
18 Correct 12 ms 23884 KB Output is correct
19 Correct 15 ms 24012 KB Output is correct
20 Correct 14 ms 24268 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 404 ms 50080 KB Output is correct
2 Correct 164 ms 37632 KB Output is correct
3 Correct 504 ms 44076 KB Output is correct
4 Correct 301 ms 42172 KB Output is correct
5 Correct 1536 ms 114636 KB Output is correct
6 Correct 1258 ms 100536 KB Output is correct
7 Correct 728 ms 75456 KB Output is correct
8 Correct 951 ms 76264 KB Output is correct
9 Correct 1064 ms 76128 KB Output is correct
10 Correct 634 ms 66700 KB Output is correct
11 Correct 164 ms 42692 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23756 KB Output is correct
2 Correct 14 ms 23664 KB Output is correct
3 Correct 11 ms 23796 KB Output is correct
4 Correct 12 ms 23664 KB Output is correct
5 Correct 12 ms 23736 KB Output is correct
6 Correct 12 ms 23744 KB Output is correct
7 Correct 13 ms 24012 KB Output is correct
8 Correct 12 ms 23824 KB Output is correct
9 Correct 18 ms 24624 KB Output is correct
10 Correct 16 ms 24496 KB Output is correct
11 Correct 15 ms 24268 KB Output is correct
12 Correct 15 ms 24196 KB Output is correct
13 Correct 14 ms 24276 KB Output is correct
14 Correct 15 ms 24268 KB Output is correct
15 Correct 16 ms 24140 KB Output is correct
16 Correct 17 ms 24212 KB Output is correct
17 Correct 16 ms 24268 KB Output is correct
18 Correct 12 ms 23884 KB Output is correct
19 Correct 15 ms 24012 KB Output is correct
20 Correct 14 ms 24268 KB Output is correct
21 Correct 404 ms 50080 KB Output is correct
22 Correct 164 ms 37632 KB Output is correct
23 Correct 504 ms 44076 KB Output is correct
24 Correct 301 ms 42172 KB Output is correct
25 Correct 1536 ms 114636 KB Output is correct
26 Correct 1258 ms 100536 KB Output is correct
27 Correct 728 ms 75456 KB Output is correct
28 Correct 951 ms 76264 KB Output is correct
29 Correct 1064 ms 76128 KB Output is correct
30 Correct 634 ms 66700 KB Output is correct
31 Correct 164 ms 42692 KB Output is correct
32 Correct 338 ms 35900 KB Output is correct
33 Correct 426 ms 40432 KB Output is correct
34 Correct 873 ms 68744 KB Output is correct
35 Correct 681 ms 58628 KB Output is correct
36 Correct 688 ms 69808 KB Output is correct
37 Correct 807 ms 72680 KB Output is correct
38 Correct 697 ms 77124 KB Output is correct
39 Correct 352 ms 39940 KB Output is correct
40 Correct 965 ms 76176 KB Output is correct
41 Correct 1232 ms 76208 KB Output is correct
42 Correct 1060 ms 83308 KB Output is correct
43 Correct 404 ms 49492 KB Output is correct
44 Correct 923 ms 54512 KB Output is correct
45 Correct 885 ms 72256 KB Output is correct
46 Correct 696 ms 72260 KB Output is correct
47 Correct 781 ms 71448 KB Output is correct
48 Correct 1644 ms 114936 KB Output is correct