Submission #41173

# Submission time Handle Problem Language Result Execution time Memory
41173 2018-02-13T11:35:51 Z IvanC Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
1073 ms 31740 KB
#include <bits/stdc++.h>
#define MT make_tuple
using namespace std;
const int MAXN = 1e5 + 10;
typedef long long ll;
typedef tuple<ll,ll,ll> trinca;
typedef pair<ll,ll> ii;
vector<ii> grafo[MAXN];
ll N,M,processado[MAXN][8],dist[MAXN][8],ans,S,T,U,V,menorcaminho;
void Dijskra(ll origem,ll idx){
	priority_queue<ii, vector<ii> , greater<ii> > pq;
	pq.push(ii(0,origem));
	while(!pq.empty()){
		ll percorrido = pq.top().first, v = pq.top().second;
		pq.pop();
		if(processado[v][idx]) continue;
		processado[v][idx] = 1;
		dist[v][idx] = percorrido;
		for(int i = 0;i<grafo[v].size();i++){
			ll u = grafo[v][i].first, w = grafo[v][i].second;
			if(!processado[u][idx]) pq.push(ii(w + percorrido,u));
		}
	}
}
void solve(ll origem,ll qualsoma,ll idx, ll qualminimiza, ll qualtenta ){
	priority_queue<trinca, vector<trinca> , greater<trinca> > pq;
	pq.push(MT(0,(ll)1e18,origem));
	while(!pq.empty()){
		trinca davez = pq.top();
		pq.pop();
		ll percorrido = get<0>(davez), menor = get<1>(davez) , v = get<2>(davez);
		if(processado[v][idx]) continue;
		processado[v][idx] = 1;
		dist[v][idx] = percorrido;
		if(percorrido + dist[v][qualsoma] == menorcaminho){
			ans = min(ans, menorcaminho + menor + dist[v][qualtenta] );
		}
		menor = min(menor,dist[v][qualminimiza]);
		for(int i = 0;i<grafo[v].size();i++){
			ll u = grafo[v][i].first, w = grafo[v][i].second;
			if(!processado[u][idx]) pq.push(MT(w + percorrido,menor,u));
		}
	}
}
int main(){
	cin.tie(0);ios_base::sync_with_stdio(0);
	cin >> N >> M >> S >> T >> U >> V;
	for(int i = 1;i<=M;i++){
		ll u,v,w;
		cin >> u >> v >> w;
		grafo[u].push_back(ii(v,w));
		grafo[v].push_back(ii(u,w));
	}
	Dijskra(S,0);
	Dijskra(T,1);
	Dijskra(U,2);
	Dijskra(V,3);
	ans = dist[T][0] + dist[V][2];
	menorcaminho = dist[T][0];
	solve(S,1,4,2,3);
	solve(S,1,5,3,2);
	solve(T,0,6,2,3);
	solve(T,0,7,3,2);
	cout << ans - menorcaminho << endl;
	return 0;
}

Compilation message

commuter_pass.cpp: In function 'void Dijskra(ll, ll)':
commuter_pass.cpp:19:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0;i<grafo[v].size();i++){
                  ^
commuter_pass.cpp: In function 'void solve(ll, ll, ll, ll, ll)':
commuter_pass.cpp:39:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0;i<grafo[v].size();i++){
                  ^
# Verdict Execution time Memory Grader output
1 Correct 983 ms 31560 KB Output is correct
2 Correct 927 ms 31560 KB Output is correct
3 Correct 966 ms 31560 KB Output is correct
4 Correct 979 ms 31560 KB Output is correct
5 Correct 888 ms 31560 KB Output is correct
6 Correct 987 ms 31740 KB Output is correct
7 Correct 889 ms 31740 KB Output is correct
8 Correct 973 ms 31740 KB Output is correct
9 Correct 988 ms 31740 KB Output is correct
10 Correct 984 ms 31740 KB Output is correct
11 Correct 284 ms 31740 KB Output is correct
12 Correct 952 ms 31740 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1000 ms 31740 KB Output is correct
2 Correct 945 ms 31740 KB Output is correct
3 Correct 919 ms 31740 KB Output is correct
4 Correct 940 ms 31740 KB Output is correct
5 Correct 909 ms 31740 KB Output is correct
6 Correct 954 ms 31740 KB Output is correct
7 Correct 946 ms 31740 KB Output is correct
8 Correct 944 ms 31740 KB Output is correct
9 Correct 944 ms 31740 KB Output is correct
10 Correct 941 ms 31740 KB Output is correct
11 Correct 276 ms 31740 KB Output is correct
12 Correct 983 ms 31740 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 49 ms 31740 KB Output is correct
2 Correct 5 ms 31740 KB Output is correct
3 Correct 5 ms 31740 KB Output is correct
4 Correct 96 ms 31740 KB Output is correct
5 Correct 48 ms 31740 KB Output is correct
6 Correct 5 ms 31740 KB Output is correct
7 Correct 7 ms 31740 KB Output is correct
8 Correct 10 ms 31740 KB Output is correct
9 Correct 5 ms 31740 KB Output is correct
10 Correct 45 ms 31740 KB Output is correct
11 Correct 3 ms 31740 KB Output is correct
12 Correct 4 ms 31740 KB Output is correct
13 Correct 4 ms 31740 KB Output is correct
14 Correct 5 ms 31740 KB Output is correct
15 Correct 5 ms 31740 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 983 ms 31560 KB Output is correct
2 Correct 927 ms 31560 KB Output is correct
3 Correct 966 ms 31560 KB Output is correct
4 Correct 979 ms 31560 KB Output is correct
5 Correct 888 ms 31560 KB Output is correct
6 Correct 987 ms 31740 KB Output is correct
7 Correct 889 ms 31740 KB Output is correct
8 Correct 973 ms 31740 KB Output is correct
9 Correct 988 ms 31740 KB Output is correct
10 Correct 984 ms 31740 KB Output is correct
11 Correct 284 ms 31740 KB Output is correct
12 Correct 952 ms 31740 KB Output is correct
13 Correct 1000 ms 31740 KB Output is correct
14 Correct 945 ms 31740 KB Output is correct
15 Correct 919 ms 31740 KB Output is correct
16 Correct 940 ms 31740 KB Output is correct
17 Correct 909 ms 31740 KB Output is correct
18 Correct 954 ms 31740 KB Output is correct
19 Correct 946 ms 31740 KB Output is correct
20 Correct 944 ms 31740 KB Output is correct
21 Correct 944 ms 31740 KB Output is correct
22 Correct 941 ms 31740 KB Output is correct
23 Correct 276 ms 31740 KB Output is correct
24 Correct 983 ms 31740 KB Output is correct
25 Correct 49 ms 31740 KB Output is correct
26 Correct 5 ms 31740 KB Output is correct
27 Correct 5 ms 31740 KB Output is correct
28 Correct 96 ms 31740 KB Output is correct
29 Correct 48 ms 31740 KB Output is correct
30 Correct 5 ms 31740 KB Output is correct
31 Correct 7 ms 31740 KB Output is correct
32 Correct 10 ms 31740 KB Output is correct
33 Correct 5 ms 31740 KB Output is correct
34 Correct 45 ms 31740 KB Output is correct
35 Correct 3 ms 31740 KB Output is correct
36 Correct 4 ms 31740 KB Output is correct
37 Correct 4 ms 31740 KB Output is correct
38 Correct 5 ms 31740 KB Output is correct
39 Correct 5 ms 31740 KB Output is correct
40 Correct 1073 ms 31740 KB Output is correct
41 Correct 937 ms 31740 KB Output is correct
42 Correct 929 ms 31740 KB Output is correct
43 Correct 283 ms 31740 KB Output is correct
44 Correct 279 ms 31740 KB Output is correct
45 Correct 880 ms 31740 KB Output is correct
46 Correct 886 ms 31740 KB Output is correct
47 Correct 937 ms 31740 KB Output is correct
48 Correct 326 ms 31740 KB Output is correct
49 Correct 951 ms 31740 KB Output is correct
50 Correct 829 ms 31740 KB Output is correct
51 Correct 842 ms 31740 KB Output is correct