oj.uz

Submission #960064

# Submission time Handle Problem Language Result Execution time Memory
960064 2024-04-09T15:20:53 Z happy_node Olympic Bus (JOI20_ho_t4) C++17
100 / 100
 820 ms 6100 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int MX=5e4+5;

int N,M;
ll U[MX], V[MX], C[MX], D[MX];
pair<ll, ll> dist[205][205], DIST[205];

vector<array<ll,3>> adj[205];
vector<ll> edges[205], redges[205];

bool crucial[MX], rcrucial[MX];

int main() {
	cin.tie(0); ios_base::sync_with_stdio(0);

	for(int i=0;i<205;i++)
		for(int j=0;j<205;j++)
			dist[i][j]=make_pair(2e9,2e9);

	cin>>N>>M;

	for(int i=0;i<M;i++) {
		cin>>U[i]>>V[i]>>C[i]>>D[i];
		adj[U[i]].push_back({V[i],C[i],i});
	}

	for(int s=1;s<=N;s++) {
		priority_queue<pair<pair<ll,ll>,ll>, vector<pair<pair<ll,ll>,ll>>, greater<pair<pair<ll,ll>,ll>>> pq;

		dist[s][s]=make_pair(0,0);
		pq.push({dist[s][s],s});

		while(!pq.empty()) {
			auto [d,v]=pq.top(); pq.pop();
			if(d>dist[s][v]) continue;
			for(auto [u,w,id]:adj[v]) {
				if(dist[s][u]>make_pair(d.first+w,d.second+1)) {
					dist[s][u]=make_pair(d.first+w,d.second+1);
					pq.push({dist[s][u],u});
				}
			}
		}
	}

	for(int i=0;i<M;i++) {
		int u=U[i],v=V[i],c=C[i];
		if(make_pair(dist[1][u].first+dist[v][N].first+c,dist[1][u].second+dist[v][N].second+1)==dist[1][N]) {
			edges[dist[1][u].second+1].push_back(i);
		}
	}

	for(int i=0;i<M;i++) {
		int u=U[i],v=V[i],c=C[i];
		if(make_pair(dist[N][u].first+dist[v][1].first+c,dist[N][u].second+dist[v][1].second+1)==dist[N][1]) {
			redges[dist[N][u].second+1].push_back(i);
		}
	}


	for(int d=1;d<=N;d++) {
		if(edges[d].size()==1) {
			crucial[edges[d][0]]=1;
		}
		if(redges[d].size()==1) {
			rcrucial[redges[d][0]]=1;
		}
	}

	ll ans=2e9;
	if(dist[1][N].first!=2e9 && dist[N][1].first!=2e9) ans=min(ans,dist[1][N].first+dist[N][1].first);

	for(int i=0;i<M;i++) {
		ll cost=2e9,rcost=2e9;
		ll u=U[i],v=V[i],c=C[i],d=D[i];

		if(crucial[i])  {
			priority_queue<pair<pair<ll,ll>,ll>, vector<pair<pair<ll,ll>,ll>>, greater<pair<pair<ll,ll>,ll>>> pq;

			for(int i=1;i<=N;i++) DIST[i]=make_pair(2e9,2e9);

			DIST[1]=make_pair(0,0);
			pq.push({DIST[1],1});

			while(!pq.empty()) {
				auto [d,v]=pq.top(); pq.pop();
				if(d>DIST[v]) continue;
				for(auto [u,w,id]:adj[v]) {
					if(id==i) continue;
					if(DIST[u]>make_pair(d.first+w,d.second+1)) {
						DIST[u]=make_pair(d.first+w,d.second+1);
						pq.push({DIST[u],u});
					}
				}
				// new edge
				if(v==V[i]) {
					int u=U[i];
					if(DIST[u]>make_pair(d.first+c,d.second+1)) {
						DIST[u]=make_pair(d.first+c,d.second+1);
						pq.push({DIST[u],u});
					}
				}
			}
			cost=min(cost,DIST[N].first);
		} else {
			cost=min(cost,dist[1][v].first+c+dist[u][N].first);
			cost=min(cost,dist[1][N].first);
		}

		if(rcrucial[i])  {
			priority_queue<pair<pair<ll,ll>,ll>, vector<pair<pair<ll,ll>,ll>>, greater<pair<pair<ll,ll>,ll>>> pq;

			for(int i=1;i<=N;i++) DIST[i]=make_pair(2e9,2e9);

			DIST[N]=make_pair(0,0);
			pq.push({DIST[N],N});

			while(!pq.empty()) {
				auto [d,v]=pq.top(); pq.pop();
				if(d>DIST[v]) continue;
				for(auto [u,w,id]:adj[v]) {
					if(id==i) continue;
					if(DIST[u]>make_pair(d.first+w,d.second+1)) {
						DIST[u]=make_pair(d.first+w,d.second+1);
						pq.push({DIST[u],u});
					}
				}
				// new edge
				if(v==V[i]) {
					int u=U[i];
					if(DIST[u]>make_pair(d.first+c,d.second+1)) {
						DIST[u]=make_pair(d.first+c,d.second+1);
						pq.push({DIST[u],u});
					}
				}
			}
			rcost=min(rcost,DIST[1].first);
		} else {
			rcost=min(rcost,dist[N][v].first+c+dist[u][1].first);
			rcost=min(rcost,dist[N][1].first);
		}

		ans=min(ans,d+cost+rcost);
	}

	cout<<(ans==2e9?-1:ans)<<'\n';
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2652 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 7 ms 2652 KB Output is correct
4 Correct 7 ms 2648 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2616 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 23 ms 2652 KB Output is correct
11 Correct 21 ms 2652 KB Output is correct
12 Correct 22 ms 2652 KB Output is correct
13 Correct 4 ms 2652 KB Output is correct
14 Correct 5 ms 2652 KB Output is correct
15 Correct 6 ms 2804 KB Output is correct
16 Correct 5 ms 2648 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 5464 KB Output is correct
2 Correct 40 ms 5468 KB Output is correct
3 Correct 42 ms 5468 KB Output is correct
4 Correct 7 ms 2652 KB Output is correct
5 Correct 4 ms 2396 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 33 ms 5852 KB Output is correct
10 Correct 33 ms 5724 KB Output is correct
11 Correct 34 ms 5464 KB Output is correct
12 Correct 34 ms 5700 KB Output is correct
13 Correct 34 ms 5724 KB Output is correct
14 Correct 34 ms 6100 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2652 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 23 ms 4712 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 28 ms 5464 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 24 ms 5480 KB Output is correct
9 Correct 24 ms 5468 KB Output is correct
10 Correct 26 ms 5852 KB Output is correct
11 Correct 24 ms 5212 KB Output is correct
12 Correct 24 ms 5464 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2592 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 24 ms 5724 KB Output is correct
20 Correct 24 ms 5212 KB Output is correct
21 Correct 29 ms 5724 KB Output is correct
22 Correct 24 ms 5212 KB Output is correct

Subtask #4
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2652 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 7 ms 2652 KB Output is correct
4 Correct 7 ms 2648 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2616 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 23 ms 2652 KB Output is correct
11 Correct 21 ms 2652 KB Output is correct
12 Correct 22 ms 2652 KB Output is correct
13 Correct 4 ms 2652 KB Output is correct
14 Correct 5 ms 2652 KB Output is correct
15 Correct 6 ms 2804 KB Output is correct
16 Correct 5 ms 2648 KB Output is correct
17 Correct 41 ms 5464 KB Output is correct
18 Correct 40 ms 5468 KB Output is correct
19 Correct 42 ms 5468 KB Output is correct
20 Correct 7 ms 2652 KB Output is correct
21 Correct 4 ms 2396 KB Output is correct
22 Correct 2 ms 2396 KB Output is correct
23 Correct 1 ms 2392 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 33 ms 5852 KB Output is correct
26 Correct 33 ms 5724 KB Output is correct
27 Correct 34 ms 5464 KB Output is correct
28 Correct 34 ms 5700 KB Output is correct
29 Correct 34 ms 5724 KB Output is correct
30 Correct 34 ms 6100 KB Output is correct
31 Correct 5 ms 2652 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 23 ms 4712 KB Output is correct
34 Correct 1 ms 2392 KB Output is correct
35 Correct 28 ms 5464 KB Output is correct
36 Correct 1 ms 2392 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct
38 Correct 24 ms 5480 KB Output is correct
39 Correct 24 ms 5468 KB Output is correct
40 Correct 26 ms 5852 KB Output is correct
41 Correct 24 ms 5212 KB Output is correct
42 Correct 24 ms 5464 KB Output is correct
43 Correct 1 ms 2396 KB Output is correct
44 Correct 1 ms 2592 KB Output is correct
45 Correct 1 ms 2396 KB Output is correct
46 Correct 1 ms 2392 KB Output is correct
47 Correct 1 ms 2396 KB Output is correct
48 Correct 1 ms 2396 KB Output is correct
49 Correct 24 ms 5724 KB Output is correct
50 Correct 24 ms 5212 KB Output is correct
51 Correct 29 ms 5724 KB Output is correct
52 Correct 24 ms 5212 KB Output is correct
53 Correct 45 ms 5468 KB Output is correct
54 Correct 46 ms 5612 KB Output is correct
55 Correct 46 ms 5468 KB Output is correct
56 Correct 7 ms 2644 KB Output is correct
57 Correct 7 ms 2668 KB Output is correct
58 Correct 104 ms 4944 KB Output is correct
59 Correct 105 ms 4944 KB Output is correct
60 Correct 108 ms 4944 KB Output is correct
61 Correct 85 ms 4956 KB Output is correct
62 Correct 111 ms 4948 KB Output is correct
63 Correct 107 ms 4832 KB Output is correct
64 Correct 820 ms 5800 KB Output is correct
65 Correct 750 ms 5816 KB Output is correct
66 Correct 708 ms 5644 KB Output is correct
67 Correct 11 ms 5076 KB Output is correct
68 Correct 35 ms 5712 KB Output is correct
69 Correct 35 ms 5724 KB Output is correct
70 Correct 37 ms 5804 KB Output is correct
71 Correct 37 ms 5512 KB Output is correct
72 Correct 36 ms 5468 KB Output is correct
73 Correct 37 ms 5760 KB Output is correct
74 Correct 38 ms 5548 KB Output is correct