oj.uz

Submission #532076

# Submission time Handle Problem Language Result Execution time Memory
532076 2022-03-02T05:13:48 Z amunduzbaev Robot (JOI21_ho_t4) C++17
100 / 100
 922 ms 135316 KB 
#include "bits/stdc++.h"
using namespace std;
 
#define ar array
#define int long long
 
const int N = 1e5 + 5;
struct node{
	int a, b, c, p;
};
vector<int> edges[N];
vector<ar<int, 3>> ee[N];
map<int, vector<ar<int, 2>>> ed[N];
map<int, int> uu[N];
int d[N], used[N];
node e[N * 2];
 
/*
 
5 5
1 2 2 0
2 3 1 2
3 4 1 2
4 5 3 0
2 4 1 3
 
4 3
1 2 1 2
2 3 1 1
3 4 1 2
 
*/
 
signed main(){
	ios::sync_with_stdio(0); cin.tie(0);
	
	int n, m; cin>>n>>m;
	for(int i=0;i<m;i++){
		node& x = e[i]; cin>>x.a>>x.b>>x.c>>x.p;
		edges[x.a].push_back(i);
		edges[x.b].push_back(i);
	}
	
	for(int i=0;i<n;i++){
		map<int, int>& mm = uu[i];
		for(auto in : edges[i]){ auto& x = e[in];
			mm[x.c] += x.p;
		}
		
		for(auto in : edges[i]){ auto& x = e[in];
			int b = x.a + x.b - i;
			if(mm[x.c] > x.p){
				ee[i].push_back({b, x.p, -x.c});
				if(x.p > mm[x.c] - x.p){
					ee[i].push_back({b, mm[x.c] - x.p, x.c});
				}
			} else {
				ee[i].push_back({b, 0, x.c});
			}
			
			ed[i][x.c].push_back({b, x.p});
		}
	}
	
	priority_queue<ar<int, 5>, vector<ar<int, 5>>, greater<ar<int, 5>>> q;
	q.push({0, 1, 0, 0, 0});
	memset(d, 127, sizeof d);
	while(!q.empty()){
		int D = q.top()[0], u = q.top()[1], c = q.top()[2], p = q.top()[3], v = q.top()[4]; q.pop();
		if(c < 0){ c = -c;
			int sum = uu[u][c], is = 0;
			for(auto x : ed[u][c]){
				if(x[0] == v) { is = 1; continue; }
				q.push({D + sum - x[1], x[0], c, x[1], u});
			}
			ed[u][c].clear();
			if(is) ed[u][c].push_back({v, p});
		} else if(!used[u]) {
			d[u] = min(d[u], D);
			used[u] = 1;
			for(auto x : ee[u]){
				q.push({D + x[1], x[0], abs(x[2]), x[1], u});
				if(x[2] < 0) {
					q.push({D, x[0], x[2], x[1], u});
				}
			}
		}
	}
	
	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 9 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 9 ms 15180 KB Output is correct
5 Correct 8 ms 15228 KB Output is correct
6 Correct 8 ms 15180 KB Output is correct
7 Correct 10 ms 15660 KB Output is correct
8 Correct 8 ms 15436 KB Output is correct
9 Correct 11 ms 16124 KB Output is correct
10 Correct 12 ms 16076 KB Output is correct
11 Correct 11 ms 16104 KB Output is correct
12 Correct 10 ms 15892 KB Output is correct
13 Correct 10 ms 16044 KB Output is correct
14 Correct 12 ms 16020 KB Output is correct
15 Correct 9 ms 15564 KB Output is correct
16 Correct 10 ms 15756 KB Output is correct
17 Correct 11 ms 15916 KB Output is correct
18 Correct 8 ms 15392 KB Output is correct
19 Correct 15 ms 16048 KB Output is correct
20 Correct 10 ms 15564 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 260 ms 48940 KB Output is correct
2 Correct 99 ms 31736 KB Output is correct
3 Correct 436 ms 63616 KB Output is correct
4 Correct 168 ms 35948 KB Output is correct
5 Correct 820 ms 107092 KB Output is correct
6 Correct 799 ms 99116 KB Output is correct
7 Correct 598 ms 103328 KB Output is correct
8 Correct 461 ms 65320 KB Output is correct
9 Correct 458 ms 65456 KB Output is correct
10 Correct 310 ms 64720 KB Output is correct
11 Correct 128 ms 43696 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 7 ms 15180 KB Output is correct
3 Correct 9 ms 15180 KB Output is correct
4 Correct 9 ms 15180 KB Output is correct
5 Correct 8 ms 15228 KB Output is correct
6 Correct 8 ms 15180 KB Output is correct
7 Correct 10 ms 15660 KB Output is correct
8 Correct 8 ms 15436 KB Output is correct
9 Correct 11 ms 16124 KB Output is correct
10 Correct 12 ms 16076 KB Output is correct
11 Correct 11 ms 16104 KB Output is correct
12 Correct 10 ms 15892 KB Output is correct
13 Correct 10 ms 16044 KB Output is correct
14 Correct 12 ms 16020 KB Output is correct
15 Correct 9 ms 15564 KB Output is correct
16 Correct 10 ms 15756 KB Output is correct
17 Correct 11 ms 15916 KB Output is correct
18 Correct 8 ms 15392 KB Output is correct
19 Correct 15 ms 16048 KB Output is correct
20 Correct 10 ms 15564 KB Output is correct
21 Correct 260 ms 48940 KB Output is correct
22 Correct 99 ms 31736 KB Output is correct
23 Correct 436 ms 63616 KB Output is correct
24 Correct 168 ms 35948 KB Output is correct
25 Correct 820 ms 107092 KB Output is correct
26 Correct 799 ms 99116 KB Output is correct
27 Correct 598 ms 103328 KB Output is correct
28 Correct 461 ms 65320 KB Output is correct
29 Correct 458 ms 65456 KB Output is correct
30 Correct 310 ms 64720 KB Output is correct
31 Correct 128 ms 43696 KB Output is correct
32 Correct 438 ms 80992 KB Output is correct
33 Correct 327 ms 58140 KB Output is correct
34 Correct 499 ms 77888 KB Output is correct
35 Correct 400 ms 67996 KB Output is correct
36 Correct 488 ms 76368 KB Output is correct
37 Correct 518 ms 81940 KB Output is correct
38 Correct 609 ms 103696 KB Output is correct
39 Correct 391 ms 67920 KB Output is correct
40 Correct 497 ms 67212 KB Output is correct
41 Correct 478 ms 67616 KB Output is correct
42 Correct 573 ms 91592 KB Output is correct
43 Correct 244 ms 54572 KB Output is correct
44 Correct 696 ms 99812 KB Output is correct
45 Correct 364 ms 58280 KB Output is correct
46 Correct 349 ms 56004 KB Output is correct
47 Correct 435 ms 77840 KB Output is correct
48 Correct 922 ms 135316 KB Output is correct