oj.uz

Submission #513634

# Submission time Handle Problem Language Result Execution time Memory
513634 2022-01-17T10:59:04 Z CSQ31 Olympic Bus (JOI20_ho_t4) C++17
100 / 100
 377 ms 5832 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int MAXN = 5e4+5;
const ll INF = 1e18;
#define sz(a) (int)(a.size())
ll c[MAXN],d[MAXN];
int n,m;
array<int,2>spar[201],tpar[201],par[201];
vector<array<int,2>>g[201],gr[201];
bool block[MAXN],vis[201];
 
//distances 
ll dist[201];
ll from_s[201],from_t[200];
ll to_s[201],to_t[200];
void djikstra(int v,vector<array<int,2>>*g,ll *dist,array<int,2>*par){
	dist[0] = INF;
	for(int i=1;i<=n;i++)dist[i] = INF,vis[i] = 0;
	dist[v] = 0;
	while(true){
		int u = 0;
		for(int i=1;i<=n;i++)if(dist[i] < dist[u] && !vis[i])u = i;
		if(!u)break;
		vis[u] = 1;
		for(auto x:g[u]){
			if(block[x[1]])continue;
			if(dist[u] + c[x[1]] < dist[x[0]]){
				dist[x[0]] = dist[u] + c[x[1]];
				par[x[0]] = {u,x[1]};
			}
		}
	}
}
ll s_to_t[2][MAXN],t_to_s[2][MAXN];
int main()
{
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>n>>m;
	vector<array<int,2>>edge;
	for(int i=0;i<m;i++){
		int v,u;
		cin>>v>>u>>c[i]>>d[i];
		g[v].push_back({u,i});
		gr[u].push_back({v,i});
		edge.push_back({v,u});
	}
	djikstra(1,g,from_s,spar);
	ll none = from_s[n];
	for(int i=0;i<m;i++)s_to_t[0][i] = from_s[n];
	//first case not use inverted path at all
	//some might intersect so bad
	if(from_s[n] != INF){
		int cur = n;
		while(cur != 1){
			int p = spar[cur][1];
			block[p] = 1;
			djikstra(1,g,dist,par);
			s_to_t[0][p] = dist[n];
			block[p] = 0;
			cur = spar[cur][0];
		}
	}
	//second case invert v->u
	//use 1->u->v then v->n
	//1->u can't use 1->v->u since v->u can only be the last edge only need to consider another last edge if v->u just happens to be used in best path
	//v->n cant use v->u->n can be treated similarly as 1->u
	djikstra(n,gr,to_t,tpar);
	for(int i=0;i<m;i++){
		int v = edge[i][0],u = edge[i][1];
		ll cost = from_s[u] + to_t[v] + c[i];
		if(spar[u][1] == i){
			cost-=from_s[u];
			block[spar[u][1]] = 1;
			djikstra(1,g,dist,par);
			cost+=dist[u];
			block[spar[u][1]] = 0;
		}
		if(tpar[v][1] == i){
			cost-=to_t[v];
			block[tpar[v][1]] = 1;
			djikstra(n,gr,dist,par);
			cost+=dist[v];
			block[tpar[v][1]] = 0;
		}
		s_to_t[1][i] = cost;
	}
	///////////// n->t;
	djikstra(n,g,from_t,tpar);
	none+=from_t[1];
	for(int i=0;i<m;i++)t_to_s[0][i] = from_t[1];
	if(from_t[1] != INF){
		int cur = 1;
		while(cur != n){
			int p = tpar[cur][1];
			block[p] = 1;
			djikstra(n,g,dist,par);
			t_to_s[0][p] = dist[1];
			block[p] = 0;
			cur = tpar[cur][0];
		}
	}
 
	djikstra(1,gr,to_s,spar);
	for(int i=0;i<m;i++){
		int v = edge[i][0],u = edge[i][1];
		ll cost = from_t[u] + to_s[v] + c[i];
		if(tpar[u][1] == i){
			cost-=from_t[u];
			block[tpar[u][1]] = 1;
			djikstra(n,g,dist,par);
			cost+=dist[u];
			block[tpar[u][1]] = 0;
		}
		if(spar[v][1] == i){
			cost-=to_s[v];
			block[spar[v][1]] = 1;
			djikstra(1,gr,dist,par);
			cost+=dist[v];
			block[spar[v][1]] = 0;
		}
		t_to_s[1][i] = cost;
	}
	
	ll ans = min(INF,none);
	for(int i=0;i<m;i++){
		ans = min(ans,s_to_t[0][i] + t_to_s[0][i]);
		ans = min(ans,min(s_to_t[1][i],s_to_t[0][i]) + min(t_to_s[1][i],t_to_s[0][i]) + d[i]); 
	}
	if(ans == INF)ans=-1;
	cout<<ans<<'\n';
	
	
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 436 KB Output is correct
2 Correct 3 ms 332 KB Output is correct
3 Correct 91 ms 556 KB Output is correct
4 Correct 72 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 6 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 122 ms 424 KB Output is correct
11 Correct 122 ms 416 KB Output is correct
12 Correct 114 ms 452 KB Output is correct
13 Correct 19 ms 332 KB Output is correct
14 Correct 51 ms 548 KB Output is correct
15 Correct 55 ms 440 KB Output is correct
16 Correct 51 ms 432 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 182 ms 4356 KB Output is correct
2 Correct 162 ms 4408 KB Output is correct
3 Correct 160 ms 4436 KB Output is correct
4 Correct 74 ms 624 KB Output is correct
5 Correct 63 ms 428 KB Output is correct
6 Correct 18 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 48 ms 5540 KB Output is correct
10 Correct 48 ms 5508 KB Output is correct
11 Correct 108 ms 5584 KB Output is correct
12 Correct 108 ms 5568 KB Output is correct
13 Correct 126 ms 5548 KB Output is correct
14 Correct 146 ms 5832 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 432 KB Output is correct
2 Correct 16 ms 396 KB Output is correct
3 Correct 141 ms 3348 KB Output is correct
4 Correct 6 ms 396 KB Output is correct
5 Correct 145 ms 5276 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 41 ms 5256 KB Output is correct
9 Correct 50 ms 5356 KB Output is correct
10 Correct 94 ms 5280 KB Output is correct
11 Correct 112 ms 5324 KB Output is correct
12 Correct 98 ms 5436 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 129 ms 5412 KB Output is correct
20 Correct 93 ms 5380 KB Output is correct
21 Correct 86 ms 5244 KB Output is correct
22 Correct 92 ms 5312 KB Output is correct

Subtask #4
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 436 KB Output is correct
2 Correct 3 ms 332 KB Output is correct
3 Correct 91 ms 556 KB Output is correct
4 Correct 72 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 6 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 122 ms 424 KB Output is correct
11 Correct 122 ms 416 KB Output is correct
12 Correct 114 ms 452 KB Output is correct
13 Correct 19 ms 332 KB Output is correct
14 Correct 51 ms 548 KB Output is correct
15 Correct 55 ms 440 KB Output is correct
16 Correct 51 ms 432 KB Output is correct
17 Correct 182 ms 4356 KB Output is correct
18 Correct 162 ms 4408 KB Output is correct
19 Correct 160 ms 4436 KB Output is correct
20 Correct 74 ms 624 KB Output is correct
21 Correct 63 ms 428 KB Output is correct
22 Correct 18 ms 332 KB Output is correct
23 Correct 2 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 48 ms 5540 KB Output is correct
26 Correct 48 ms 5508 KB Output is correct
27 Correct 108 ms 5584 KB Output is correct
28 Correct 108 ms 5568 KB Output is correct
29 Correct 126 ms 5548 KB Output is correct
30 Correct 146 ms 5832 KB Output is correct
31 Correct 47 ms 432 KB Output is correct
32 Correct 16 ms 396 KB Output is correct
33 Correct 141 ms 3348 KB Output is correct
34 Correct 6 ms 396 KB Output is correct
35 Correct 145 ms 5276 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Correct 41 ms 5256 KB Output is correct
39 Correct 50 ms 5356 KB Output is correct
40 Correct 94 ms 5280 KB Output is correct
41 Correct 112 ms 5324 KB Output is correct
42 Correct 98 ms 5436 KB Output is correct
43 Correct 0 ms 332 KB Output is correct
44 Correct 0 ms 332 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 0 ms 332 KB Output is correct
47 Correct 0 ms 332 KB Output is correct
48 Correct 0 ms 332 KB Output is correct
49 Correct 129 ms 5412 KB Output is correct
50 Correct 93 ms 5380 KB Output is correct
51 Correct 86 ms 5244 KB Output is correct
52 Correct 92 ms 5312 KB Output is correct
53 Correct 184 ms 5364 KB Output is correct
54 Correct 207 ms 5336 KB Output is correct
55 Correct 173 ms 5384 KB Output is correct
56 Correct 73 ms 456 KB Output is correct
57 Correct 74 ms 456 KB Output is correct
58 Correct 229 ms 4336 KB Output is correct
59 Correct 223 ms 4420 KB Output is correct
60 Correct 224 ms 4288 KB Output is correct
61 Correct 199 ms 4244 KB Output is correct
62 Correct 216 ms 4388 KB Output is correct
63 Correct 222 ms 4268 KB Output is correct
64 Correct 377 ms 4436 KB Output is correct
65 Correct 350 ms 4528 KB Output is correct
66 Correct 288 ms 4424 KB Output is correct
67 Correct 20 ms 4072 KB Output is correct
68 Correct 69 ms 5560 KB Output is correct
69 Correct 54 ms 5572 KB Output is correct
70 Correct 131 ms 5576 KB Output is correct
71 Correct 131 ms 5576 KB Output is correct
72 Correct 125 ms 5584 KB Output is correct
73 Correct 139 ms 5608 KB Output is correct
74 Correct 146 ms 5604 KB Output is correct