oj.uz

Submission #532069

# Submission time Handle Problem Language Result Execution time Memory
532069 2022-03-02T05:08:32 Z amunduzbaev Robot (JOI21_ho_t4) C++17
100 / 100
 1098 ms 104748 KB 
#include "bits/stdc++.h"
using namespace std;

#define ar array
#define int long long

const int N = 1e5 + 5;
map<int, vector<ar<int, 2>>> edges[N];
map<int, int> ss[N], uu[N];
int d[N], used[N];

signed main(){
	ios::sync_with_stdio(0); cin.tie(0);
	
	int n, m; cin>>n>>m;
	for(int i=0;i<m;i++){
		int a, b, c, p; cin>>a>>b>>c>>p;
		edges[a][c].push_back({b, p});
		edges[b][c].push_back({a, p});
		ss[a][c] += p;
		ss[b][c] += p;
	}
	
	priority_queue<ar<int, 3>, vector<ar<int, 3>>, greater<ar<int, 3>>> q;
	q.push({0, 1, 0});
	memset(d, 127, sizeof d);
	while(!q.empty()){
		int D = q.top()[0], u = q.top()[1], c = q.top()[2]; q.pop();
		if(c < 0){ 
			c = abs(c);
			if(uu[u].count(c)) continue;
			uu[u][c];
			int& sum = ss[u][c];
			for(auto x : edges[u][c]){
				q.push({D + sum - x[1], x[0], 0});
			}
		} else if(!used[u]) {
			used[u] = 1;
			d[u] = D;
			for(auto [c, v] : edges[u]){
				int& sum = ss[u][c];
				for(auto x : v){
					q.push({D, x[0], -c});
					q.push({D + min(sum - x[1], x[1]), x[0], 0});
				}
			}
		}
	}
	
	if(d[n] > 1e18) cout<<-1<<"\n";
	else cout<<d[n]<<"\n";
}

Subtask #1
34.0 / 34.0

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

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 302 ms 38064 KB Output is correct
2 Correct 138 ms 26700 KB Output is correct
3 Correct 402 ms 40744 KB Output is correct
4 Correct 183 ms 30832 KB Output is correct
5 Correct 1070 ms 93516 KB Output is correct
6 Correct 980 ms 79624 KB Output is correct
7 Correct 571 ms 75112 KB Output is correct
8 Correct 547 ms 51720 KB Output is correct
9 Correct 580 ms 51752 KB Output is correct
10 Correct 419 ms 52512 KB Output is correct
11 Correct 163 ms 33420 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 15180 KB Output is correct
2 Correct 7 ms 15180 KB Output is correct
3 Correct 9 ms 15180 KB Output is correct
4 Correct 11 ms 15180 KB Output is correct
5 Correct 8 ms 15180 KB Output is correct
6 Correct 8 ms 15208 KB Output is correct
7 Correct 9 ms 15456 KB Output is correct
8 Correct 8 ms 15328 KB Output is correct
9 Correct 12 ms 15948 KB Output is correct
10 Correct 12 ms 15912 KB Output is correct
11 Correct 11 ms 15748 KB Output is correct
12 Correct 10 ms 15564 KB Output is correct
13 Correct 10 ms 15692 KB Output is correct
14 Correct 11 ms 15692 KB Output is correct
15 Correct 9 ms 15436 KB Output is correct
16 Correct 13 ms 15436 KB Output is correct
17 Correct 11 ms 15564 KB Output is correct
18 Correct 8 ms 15308 KB Output is correct
19 Correct 11 ms 15692 KB Output is correct
20 Correct 13 ms 15436 KB Output is correct
21 Correct 302 ms 38064 KB Output is correct
22 Correct 138 ms 26700 KB Output is correct
23 Correct 402 ms 40744 KB Output is correct
24 Correct 183 ms 30832 KB Output is correct
25 Correct 1070 ms 93516 KB Output is correct
26 Correct 980 ms 79624 KB Output is correct
27 Correct 571 ms 75112 KB Output is correct
28 Correct 547 ms 51720 KB Output is correct
29 Correct 580 ms 51752 KB Output is correct
30 Correct 419 ms 52512 KB Output is correct
31 Correct 163 ms 33420 KB Output is correct
32 Correct 320 ms 53356 KB Output is correct
33 Correct 330 ms 40476 KB Output is correct
34 Correct 566 ms 59248 KB Output is correct
35 Correct 447 ms 52088 KB Output is correct
36 Correct 462 ms 57132 KB Output is correct
37 Correct 560 ms 56940 KB Output is correct
38 Correct 562 ms 75452 KB Output is correct
39 Correct 366 ms 43844 KB Output is correct
40 Correct 506 ms 53008 KB Output is correct
41 Correct 555 ms 53424 KB Output is correct
42 Correct 667 ms 69968 KB Output is correct
43 Correct 280 ms 42604 KB Output is correct
44 Correct 761 ms 67372 KB Output is correct
45 Correct 402 ms 48476 KB Output is correct
46 Correct 322 ms 48588 KB Output is correct
47 Correct 491 ms 59544 KB Output is correct
48 Correct 1098 ms 104748 KB Output is correct