oj.uz

Submission #396374

# Submission time Handle Problem Language Result Execution time Memory
396374 2021-04-29T21:07:04 Z keta_tsimakuridze Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 549 ms 29136 KB 
#include<bits/stdc++.h>
#define f first
#define int long long
#define s second
#define pii pair<int,int>
using namespace std;
const int N=2e5+5,mod=1e9+7,Inf=1e15;
int t,dist[5][N],a[5],ans[N],n,m,dist1[N],Ans;
vector<pair<int,int> > V[N];
vector<int> ds[2];
priority_queue<pii,vector<pii>,greater<pii> >q;
string s;
void Go(int I){
	for(int i=1;i<=n;i++){
		ans[i] = Inf;
		dist1[i] = Inf;
	}
	dist1[a[2]] = 0;
	dist1[a[0]] = dist[2][a[0]];

	for(int j=0;j<ds[I].size();j++){
			int v = ds[I][j]; 
			for(int k=0;k<V[v].size();k++){
				if(dist[0][V[v][k].f]<dist[0][v]) continue;
				dist1[V[v][k].f] = min(dist1[V[v][k].f],min(dist1[v]+V[v][k].s,dist[2][V[v][k].f]));
				if(dist[0][v]+dist[1][V[v][k].f]+V[v][k].s == dist[0][a[1]]) dist1[V[v][k].f] = min(dist1[V[v][k].f],dist1[v]);
			
			}
		}

	for(int i=1;i<=n;i++){
		Ans=min(Ans,dist1[i]+dist[3][i]);
	}	

}
 main(){
	// t=1;
	cin>>n>>m;
	cin>>a[0]>>a[1]>>a[2]>>a[3];
	for(int i=1;i<=m;i++){
		int u,v,w;
		cin>>u>>v>>w;
		V[u].push_back({v,w});
		V[v].push_back({u,w});
	}
	for(int i=0;i<4;i++){
		for(int j=1;j<=n;j++) dist[i][j] = Inf;
		dist[i][a[i]]=0; 
		q.push({0,a[i]});
		while(q.size()){
			int d=q.top().f;
			int u=q.top().s; if(i<=1)ds[i].push_back(u);
			q.pop();
			if(dist[i][u]<d) continue;
			for(int j=0;j<V[u].size();j++){
				if(dist[i][V[u][j].f]>d+V[u][j].s) {
					dist[i][V[u][j].f]=d+V[u][j].s;
					q.push({dist[i][V[u][j].f],V[u][j].f});
				}
			}
		}
	}
	Ans=1e17;
	Go(0);
	swap(a[0],a[1]); swap(dist[0],dist[1]);
	Go(1);
	cout<<Ans;	
}

Compilation message

commuter_pass.cpp: In function 'void Go(long long int)':
commuter_pass.cpp:21:15: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |  for(int j=0;j<ds[I].size();j++){
      |              ~^~~~~~~~~~~~~
commuter_pass.cpp:23:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |    for(int k=0;k<V[v].size();k++){
      |                ~^~~~~~~~~~~~
commuter_pass.cpp: At global scope:
commuter_pass.cpp:36:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   36 |  main(){
      |       ^
commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:55:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |    for(int j=0;j<V[u].size();j++){
      |                ~^~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 508 ms 27304 KB Output is correct
2 Correct 513 ms 27300 KB Output is correct
3 Correct 527 ms 27440 KB Output is correct
4 Correct 490 ms 27180 KB Output is correct
5 Correct 495 ms 26724 KB Output is correct
6 Correct 521 ms 27684 KB Output is correct
7 Correct 503 ms 27112 KB Output is correct
8 Correct 512 ms 27180 KB Output is correct
9 Correct 538 ms 27664 KB Output is correct
10 Correct 457 ms 26936 KB Output is correct
11 Correct 232 ms 20280 KB Output is correct
12 Correct 544 ms 29136 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 533 ms 27508 KB Output is correct
2 Correct 534 ms 27680 KB Output is correct
3 Correct 526 ms 27564 KB Output is correct
4 Correct 541 ms 27704 KB Output is correct
5 Correct 535 ms 29028 KB Output is correct
6 Correct 514 ms 28864 KB Output is correct
7 Correct 549 ms 28956 KB Output is correct
8 Correct 541 ms 28992 KB Output is correct
9 Correct 540 ms 28980 KB Output is correct
10 Correct 541 ms 28920 KB Output is correct
11 Correct 220 ms 20196 KB Output is correct
12 Correct 517 ms 29016 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 9808 KB Output is correct
2 Correct 7 ms 8140 KB Output is correct
3 Correct 7 ms 8140 KB Output is correct
4 Correct 48 ms 11588 KB Output is correct
5 Correct 27 ms 9832 KB Output is correct
6 Correct 7 ms 8216 KB Output is correct
7 Correct 8 ms 8268 KB Output is correct
8 Correct 10 ms 8396 KB Output is correct
9 Correct 8 ms 8268 KB Output is correct
10 Correct 27 ms 9772 KB Output is correct
11 Correct 6 ms 8140 KB Output is correct
12 Correct 6 ms 8212 KB Output is correct
13 Correct 6 ms 8140 KB Output is correct
14 Correct 7 ms 8220 KB Output is correct
15 Correct 7 ms 8140 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 508 ms 27304 KB Output is correct
2 Correct 513 ms 27300 KB Output is correct
3 Correct 527 ms 27440 KB Output is correct
4 Correct 490 ms 27180 KB Output is correct
5 Correct 495 ms 26724 KB Output is correct
6 Correct 521 ms 27684 KB Output is correct
7 Correct 503 ms 27112 KB Output is correct
8 Correct 512 ms 27180 KB Output is correct
9 Correct 538 ms 27664 KB Output is correct
10 Correct 457 ms 26936 KB Output is correct
11 Correct 232 ms 20280 KB Output is correct
12 Correct 544 ms 29136 KB Output is correct
13 Correct 533 ms 27508 KB Output is correct
14 Correct 534 ms 27680 KB Output is correct
15 Correct 526 ms 27564 KB Output is correct
16 Correct 541 ms 27704 KB Output is correct
17 Correct 535 ms 29028 KB Output is correct
18 Correct 514 ms 28864 KB Output is correct
19 Correct 549 ms 28956 KB Output is correct
20 Correct 541 ms 28992 KB Output is correct
21 Correct 540 ms 28980 KB Output is correct
22 Correct 541 ms 28920 KB Output is correct
23 Correct 220 ms 20196 KB Output is correct
24 Correct 517 ms 29016 KB Output is correct
25 Correct 28 ms 9808 KB Output is correct
26 Correct 7 ms 8140 KB Output is correct
27 Correct 7 ms 8140 KB Output is correct
28 Correct 48 ms 11588 KB Output is correct
29 Correct 27 ms 9832 KB Output is correct
30 Correct 7 ms 8216 KB Output is correct
31 Correct 8 ms 8268 KB Output is correct
32 Correct 10 ms 8396 KB Output is correct
33 Correct 8 ms 8268 KB Output is correct
34 Correct 27 ms 9772 KB Output is correct
35 Correct 6 ms 8140 KB Output is correct
36 Correct 6 ms 8212 KB Output is correct
37 Correct 6 ms 8140 KB Output is correct
38 Correct 7 ms 8220 KB Output is correct
39 Correct 7 ms 8140 KB Output is correct
40 Correct 499 ms 28828 KB Output is correct
41 Correct 514 ms 28844 KB Output is correct
42 Correct 515 ms 29056 KB Output is correct
43 Correct 237 ms 20340 KB Output is correct
44 Correct 223 ms 20260 KB Output is correct
45 Correct 458 ms 27392 KB Output is correct
46 Correct 439 ms 27000 KB Output is correct
47 Correct 511 ms 28648 KB Output is correct
48 Correct 229 ms 19640 KB Output is correct
49 Correct 426 ms 28636 KB Output is correct
50 Correct 453 ms 27612 KB Output is correct
51 Correct 449 ms 27280 KB Output is correct