oj.uz

답안 #826332

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
826332 2023-08-15T12:58:42 Z MohamedAliSaidane Olympic Bus (JOI20_ho_t4) C++14
37 / 100
 1000 ms 4016 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

#define pb push_back
#define all(x) (x).begin(), (x).end()
#define ff first
#define ss second

const int nax = 205;
const int fax = 5e4 + 4;
const int INF = 1e9;
int n, m;
int seen[nax];
int sp1[nax], ps1[nax], sp2[nax], ps2[nax];
vector<int> adj[nax], rev_adj[nax];
int U[fax], V[fax], is_on_path[fax];
int C[fax];
ll D[fax];
int previ[nax][4];
int vis[nax][nax];

void calculate_sp(int up = -1, int vp = -1, int edg = -1)
{
	priority_queue <pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> pq;
	for(int i = 1; i <= n; i++)
	{
		sp1[i] = ps1[i] = sp2[i] = ps2[i] = INF;
		seen[i] = 0;
	}
	
	sp1[1] = ps1[1] = sp2[n] = ps2[n] = 0ll;
	previ[1][0] = previ[1][1] = -1;

	pq.push({0, 1});

	while(!pq.empty())
	{
		pair<int,int> E = (pq.top());
		pq.pop();
		int node = E.ss;
		if(seen[node])
			continue;
		seen[node] = 1;
		int path = E.ff;
		if(previ[node][0] != -1)
			is_on_path[previ[node][0]] = 1;
		for(auto e: adj[node])
		{
			if(e == edg)
				continue;
			int v = V[e];
			if(sp1[v] <= path + C[e])
				continue;
			sp1[v] = path + C[e];
			previ[v][0] = e;
			pq.push({path + C[e], v});
		}	
		if(node == vp)
		{
			int v = up;
			if(sp1[v] <= path + C[edg])
				continue;
			sp1[v] = path + C[edg];
			pq.push({path + C[edg], v});
		}
	}
	for(int i= 1; i <= n; i++)
		seen[i] = 0;
	pq.push({0, 1});

	while(!pq.empty())
	{
		pair<int,int> E = (pq.top());
		pq.pop();
		int node = E.ss;
		if(seen[node])
			continue;
		seen[node] = 1;
		int path = E.ff;
		if(previ[node][1] != -1)
			is_on_path[previ[node][1]] = 1;
		for(auto e: rev_adj[node])
		{
			if(e == edg)
				continue;
			int v = U[e];
			if(ps1[v] <= path + C[e])
				continue;
			ps1[v] = path + C[e];
			pq.push({path + C[e], v});
		}	
		if(node == up)
		{
			int v = vp;
			if(ps1[v] <= path + C[edg])
				continue;
			ps1[v] = path + C[edg];
			pq.push({path + C[edg], v});
		}
	}
	
	previ[n][2] = previ[n][3] = -1;
	for(int i =1; i <= n; i++)
		seen[i] = 0;
	pq.push({0, n});

	while(!pq.empty())
	{
		pair<int,int> E = (pq.top());
		pq.pop();
		int node = E.ss;
		if(seen[node])
			continue;
		seen[node] = 1;
		int path = E.ff;
		if(previ[node][2] != -1)
			is_on_path[previ[node][2]] = 1;
		for(auto e: adj[node])
		{
			if(e == edg)
				continue;
			int v = V[e];
			if(sp2[v] <= path + C[e])
				continue;
			sp2[v] = path + C[e];
			previ[v][2] = e;
			pq.push({path + C[e], v});
		}	
		if(node == vp)
		{
			int v = up;
			if(sp2[v] <= path + C[edg])
				continue;
			sp2[v] = path + C[edg];
			pq.push({path + C[edg], v});
		}
	}
	for(int i =1; i <= n; i++)
		seen[i] = 0;
	pq.push({0, n});

	while(!pq.empty())
	{
		pair<int,int> E = (pq.top());
		pq.pop();
		int node = E.ss;
		if(seen[node])
			continue;
		seen[node] = 1;
		int path = E.ff;
		if(previ[node][3] != -1)
			is_on_path[previ[node][3]] = 1;
		for(auto e: rev_adj[node])
		{
			if(e == edg)
				continue;
			int v = U[e];
			if(ps2[v] <= path + C[e])
				continue;
			ps2[v] = path + C[e];
			previ[v][3] = e;
			pq.push({path + C[e], v});
		}	
		if(node == up)
		{
			int v = vp;
			if(ps2[v] <= path + C[edg])
				continue;
			ps2[v] = path + C[edg];
			pq.push({path + C[edg], v});
		}

	}
	assert(sp1[1] == 0);
	assert(sp2[n] == 0);
	assert(sp1[n] == ps2[1]);
	assert(sp2[1] == ps1[n]);
}
void solve()
{
	cin >> n >> m;
	vector<pair<int,int>> VEC;
	for(int i = 0; i < m; i++)
	{
		cin >> U[i] >> V[i] >> C[i] >> D[i];
		VEC.pb({C[i], i});
	}
	sort(all(VEC));
	for(auto p: VEC)
	{
		int e = p.ss;
		if(vis[U[e]][V[e]] == 2)
			continue;
		adj[U[e]].pb(e);
		rev_adj[V[e]].pb(e);
		vis[U[e]][V[e]]++;
	}
	calculate_sp();
	vector<int> NON, YES;
	for(int i = 0; i < m; i++)
	{
		if(is_on_path[i])
			YES.pb(i);
		else
			NON.pb(i);
	}
	assert((int)(YES.size()) <= 4 * n);
	ll ans = sp1[n] >= INF || sp2[1] >= INF? 2ll * INF: sp1[n] + sp2[1];
	for(auto i: NON)
	{
		int u = U[i], v = V[i];
		ll c =  C[i], d = D[i];
		ll un = sp1[n];
		ll uV = sp1[v];
		ll Un = ps2[u];
		ll nu = sp2[1];
		ll nV = sp2[v];
		ll Uu = ps1[u];
		if((un >= INF && uV + c + Un >= INF) || (nu >= INF && nV + c + Uu >= INF))
				continue;
		ll rep = d + min(un, uV + c + Un) + min(nu, nV + c + Uu);
		ans = min(ans, rep);
	}
	for(auto i: YES)
	{

		calculate_sp(U[i], V[i], i);
		if(sp1[n] >= INF || sp2[1] >= INF)
			continue;
		ans = min(ans, (ll)(sp1[n]) + (ll)(sp2[1]) + D[i]);
		//cout << sp1[n] << ' ' << sp2[1] << '\n';
	}
	if(ans >= 2ll * INF)
		cout << "-1";
	else
		cout << ans;
}

int32_t main()
{
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);

	int tt = 1; // cin >> tt;
	while(tt--)
		solve();
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 604 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 33 ms 616 KB Output is correct
4 Correct 37 ms 552 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 392 KB Output is correct
10 Correct 27 ms 596 KB Output is correct
11 Correct 35 ms 596 KB Output is correct
12 Correct 33 ms 468 KB Output is correct
13 Correct 6 ms 596 KB Output is correct
14 Correct 20 ms 608 KB Output is correct
15 Correct 14 ms 608 KB Output is correct
16 Correct 18 ms 608 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 226 ms 4000 KB Output is correct
2 Correct 240 ms 3952 KB Output is correct
3 Correct 245 ms 4016 KB Output is correct
4 Correct 32 ms 664 KB Output is correct
5 Correct 11 ms 476 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 65 ms 3816 KB Output is correct
10 Correct 63 ms 3796 KB Output is correct
11 Correct 118 ms 3896 KB Output is correct
12 Correct 135 ms 3928 KB Output is correct
13 Correct 120 ms 3956 KB Output is correct
14 Correct 114 ms 3860 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 596 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 216 ms 3336 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 217 ms 3804 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 68 ms 3968 KB Output is correct
9 Correct 67 ms 3940 KB Output is correct
10 Correct 131 ms 3904 KB Output is correct
11 Correct 96 ms 3896 KB Output is correct
12 Correct 100 ms 3900 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 117 ms 3804 KB Output is correct
20 Correct 95 ms 3904 KB Output is correct
21 Correct 91 ms 3832 KB Output is correct
22 Correct 121 ms 3904 KB Output is correct

Subtask #4
0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 604 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 33 ms 616 KB Output is correct
4 Correct 37 ms 552 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 392 KB Output is correct
10 Correct 27 ms 596 KB Output is correct
11 Correct 35 ms 596 KB Output is correct
12 Correct 33 ms 468 KB Output is correct
13 Correct 6 ms 596 KB Output is correct
14 Correct 20 ms 608 KB Output is correct
15 Correct 14 ms 608 KB Output is correct
16 Correct 18 ms 608 KB Output is correct
17 Correct 226 ms 4000 KB Output is correct
18 Correct 240 ms 3952 KB Output is correct
19 Correct 245 ms 4016 KB Output is correct
20 Correct 32 ms 664 KB Output is correct
21 Correct 11 ms 476 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 65 ms 3816 KB Output is correct
26 Correct 63 ms 3796 KB Output is correct
27 Correct 118 ms 3896 KB Output is correct
28 Correct 135 ms 3928 KB Output is correct
29 Correct 120 ms 3956 KB Output is correct
30 Correct 114 ms 3860 KB Output is correct
31 Correct 18 ms 596 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 216 ms 3336 KB Output is correct
34 Correct 2 ms 468 KB Output is correct
35 Correct 217 ms 3804 KB Output is correct
36 Correct 0 ms 336 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 68 ms 3968 KB Output is correct
39 Correct 67 ms 3940 KB Output is correct
40 Correct 131 ms 3904 KB Output is correct
41 Correct 96 ms 3896 KB Output is correct
42 Correct 100 ms 3900 KB Output is correct
43 Correct 0 ms 340 KB Output is correct
44 Correct 0 ms 340 KB Output is correct
45 Correct 0 ms 340 KB Output is correct
46 Correct 0 ms 340 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 0 ms 340 KB Output is correct
49 Correct 117 ms 3804 KB Output is correct
50 Correct 95 ms 3904 KB Output is correct
51 Correct 91 ms 3832 KB Output is correct
52 Correct 121 ms 3904 KB Output is correct
53 Correct 260 ms 3924 KB Output is correct
54 Correct 270 ms 3952 KB Output is correct
55 Correct 261 ms 3924 KB Output is correct
56 Correct 35 ms 596 KB Output is correct
57 Correct 38 ms 596 KB Output is correct
58 Correct 122 ms 3476 KB Output is correct
59 Correct 152 ms 3424 KB Output is correct
60 Correct 211 ms 3468 KB Output is correct
61 Correct 127 ms 3532 KB Output is correct
62 Correct 156 ms 3392 KB Output is correct
63 Correct 244 ms 3476 KB Output is correct
64 Correct 861 ms 3424 KB Output is correct
65 Correct 917 ms 3516 KB Output is correct
66 Execution timed out 1082 ms 3592 KB Time limit exceeded
67 Halted 0 ms 0 KB -