oj.uz

Submission #408764

# Submission time Handle Problem Language Result Execution time Memory
408764 2021-05-19T15:33:05 Z Cantfindme Robot (JOI21_ho_t4) C++17
100 / 100
 1075 ms 88864 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> pi;
#define f first
#define s second
#define FAST ios_base::sync_with_stdio(0); cin.tie(0);
#define all(x) x.begin(),x.end()
 
const int maxn = 100010;
const int INF = LLONG_MAX/2;
const int mod = 1e9+7; 

typedef pair<int, pi> pii;

//struct edge {
	//int v, c, p;
//};

map <int, vector <pii>> adjlist[maxn];
map <int, int> dp[maxn], sum[maxn];
int dist[maxn];

int n, e;

int32_t main() {
	FAST
	
	cin >> n >> e;
	for (int i =0;i<e;i++) {
		int a,b, c, p;
		cin >> a >> b >> c >> p;
		adjlist[a][c].push_back(pii(b,pi(c,p)));
		adjlist[b][c].push_back(pii(a,pi(c,p)));
		sum[a][c] += p;
		sum[b][c] += p;
	}

	//(1) Only change edge i to completely unique colour (guaranteed to exist)
	//(2) Change rest of edges with same colour as edge i

	memset(dist,-1,sizeof dist);

	priority_queue<pii, vector<pii>,greater<pii>> pq;
	pq.push(pii(0,pi(1,0)));
	dist[1] = 0;
	
	while (!pq.empty()) {
		auto [d, cur] = pq.top(); pq.pop();
		auto [x, c] = cur;
		
		if (c != 0) {
			//We must take a (2) here if not void
			if (d != dp[x][c]) continue;
			
			for (auto [v,xx] : adjlist[x][c]) {
				auto [cc, p] = xx;
				
				//if (cc != c) continue;
				
				int nd = d + sum[x][c] - p;
				if (dist[v] == -1 or dist[v] > nd) {
					pq.push(pii(nd,pi(v,0)));
					dist[v] = nd;
				}
			}
		} else {
			if (d != dist[x]) continue;
			
			for (auto gaygay : adjlist[x]) {
				for (auto [v, xx]: gaygay.s) {
					auto [cc, p] = xx;
					
					int nd = d + p;
				
					//Take a (1)
					//Straight to dist
					if (dist[v] == -1 or dist[v] > nd) {
						dist[v] = nd;
						pq.push(pii(nd,pi(v,0)));
					}
					
					//Do a suspension
					nd = d;
					if (dp[v].count(cc) == 0 or dp[v][cc] > nd) {
						dp[v][cc] = nd;
						pq.push(pii(nd,pi(v,cc)));
					}				
					
					//Take a (2)
					nd = d + sum[x][cc] - p;
					if (dist[v] == -1 or dist[v] > nd) {
						dist[v] = nd;
						pq.push(pii(nd,pi(v,0)));
					}
				}
			}
		}
 	}
 	
 	cout << dist[n];
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 15180 KB Output is correct
2 Correct 9 ms 15160 KB Output is correct
3 Correct 9 ms 15184 KB Output is correct
4 Correct 9 ms 15180 KB Output is correct
5 Correct 9 ms 15208 KB Output is correct
6 Correct 10 ms 15180 KB Output is correct
7 Correct 10 ms 15324 KB Output is correct
8 Correct 10 ms 15180 KB Output is correct
9 Correct 13 ms 15904 KB Output is correct
10 Correct 14 ms 15692 KB Output is correct
11 Correct 10 ms 15544 KB Output is correct
12 Correct 11 ms 15564 KB Output is correct
13 Correct 11 ms 15576 KB Output is correct
14 Correct 11 ms 15564 KB Output is correct
15 Correct 10 ms 15436 KB Output is correct
16 Correct 11 ms 15564 KB Output is correct
17 Correct 11 ms 15564 KB Output is correct
18 Correct 10 ms 15308 KB Output is correct
19 Correct 10 ms 15456 KB Output is correct
20 Correct 11 ms 15436 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 253 ms 35240 KB Output is correct
2 Correct 90 ms 25340 KB Output is correct
3 Correct 264 ms 32968 KB Output is correct
4 Correct 143 ms 28504 KB Output is correct
5 Correct 1062 ms 83308 KB Output is correct
6 Correct 836 ms 76712 KB Output is correct
7 Correct 360 ms 59080 KB Output is correct
8 Correct 460 ms 54244 KB Output is correct
9 Correct 501 ms 54268 KB Output is correct
10 Correct 396 ms 50044 KB Output is correct
11 Correct 147 ms 34372 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 15180 KB Output is correct
2 Correct 9 ms 15160 KB Output is correct
3 Correct 9 ms 15184 KB Output is correct
4 Correct 9 ms 15180 KB Output is correct
5 Correct 9 ms 15208 KB Output is correct
6 Correct 10 ms 15180 KB Output is correct
7 Correct 10 ms 15324 KB Output is correct
8 Correct 10 ms 15180 KB Output is correct
9 Correct 13 ms 15904 KB Output is correct
10 Correct 14 ms 15692 KB Output is correct
11 Correct 10 ms 15544 KB Output is correct
12 Correct 11 ms 15564 KB Output is correct
13 Correct 11 ms 15576 KB Output is correct
14 Correct 11 ms 15564 KB Output is correct
15 Correct 10 ms 15436 KB Output is correct
16 Correct 11 ms 15564 KB Output is correct
17 Correct 11 ms 15564 KB Output is correct
18 Correct 10 ms 15308 KB Output is correct
19 Correct 10 ms 15456 KB Output is correct
20 Correct 11 ms 15436 KB Output is correct
21 Correct 253 ms 35240 KB Output is correct
22 Correct 90 ms 25340 KB Output is correct
23 Correct 264 ms 32968 KB Output is correct
24 Correct 143 ms 28504 KB Output is correct
25 Correct 1062 ms 83308 KB Output is correct
26 Correct 836 ms 76712 KB Output is correct
27 Correct 360 ms 59080 KB Output is correct
28 Correct 460 ms 54244 KB Output is correct
29 Correct 501 ms 54268 KB Output is correct
30 Correct 396 ms 50044 KB Output is correct
31 Correct 147 ms 34372 KB Output is correct
32 Correct 154 ms 33196 KB Output is correct
33 Correct 174 ms 33576 KB Output is correct
34 Correct 441 ms 53380 KB Output is correct
35 Correct 339 ms 44248 KB Output is correct
36 Correct 324 ms 49140 KB Output is correct
37 Correct 392 ms 53588 KB Output is correct
38 Correct 397 ms 65188 KB Output is correct
39 Correct 183 ms 37884 KB Output is correct
40 Correct 470 ms 55448 KB Output is correct
41 Correct 501 ms 55820 KB Output is correct
42 Correct 548 ms 64208 KB Output is correct
43 Correct 237 ms 39288 KB Output is correct
44 Correct 506 ms 47788 KB Output is correct
45 Correct 355 ms 50036 KB Output is correct
46 Correct 311 ms 50016 KB Output is correct
47 Correct 352 ms 52680 KB Output is correct
48 Correct 1075 ms 88864 KB Output is correct