oj.uz

Submission #211194

# Submission time Handle Problem Language Result Execution time Memory
211194 2020-03-19T11:48:05 Z kshitij_sodani Olympic Bus (JOI20_ho_t4) C++17
0 / 100
 36 ms 5104 KB 
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef  int64_t llo;
#define mp make_pair
#define pb push_back
#define a first
#define b second
vector<pair<llo,llo>> adj[201];
vector<pair<llo,llo>> adj2[201];
vector<llo> cost[201];
llo vis[201];
llo kk,ll;

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	llo n,m;

	memset(vis,0,sizeof(vis));
	cin>>n>>m;
	
	llo ac,bb,cc,dd;
	vector<pair<pair<llo,llo>,pair<llo,llo>>> ed;
	llo kk=1;
	
	for(llo i=0;i<m;i++){
		cin>>ac>>bb>>cc>>dd;
		adj[ac-1].pb({bb-1,cc});
	//	adj[bb-1].pb({ac-1,cc});
		ed.pb({{ac-1,bb-1},{cc,dd}});
		adj2[bb-1].pb({ac-1,cc});
		cost[ac-1].pb(dd);
	}
	priority_queue<pair<llo,llo>> aa;
	aa.push({0,0});
	llo dis[n];
	for(llo i=0;i<n;i++){
		dis[i]=-1;
	}
	dis[0]=0;
	while(!aa.empty()){
		pair<llo,llo> no=aa.top();
		aa.pop();
		no.a=-no.a;
		for(auto nn:adj[no.b]){
			if(dis[nn.a]==-1 or dis[nn.a]>no.a+nn.b){
				dis[nn.a]=no.a+nn.b;
				aa.push({-dis[nn.a],nn.a});
			}
		}
	}
	llo dis2[n];
	for(llo i=0;i<n;i++){
		dis2[i]=-1;
	}
	dis2[n-1]=0;
	aa.push({0,n-1});
	while(!aa.empty()){
		pair<llo,llo> no=aa.top();
		aa.pop();
		no.a=-no.a;
		for(auto nn:adj[no.b]){
			if(dis2[nn.a]==-1 or dis2[nn.a]>no.a+nn.b){
				dis2[nn.a]=no.a+nn.b;
				aa.push({-dis2[nn.a],nn.a});
			}
		}
	}
	llo dis3[n];
	for(llo i=0;i<n;i++){
		dis3[i]=-1;
	}
	dis3[0]=0;
	aa.push({0,0});
	while(!aa.empty()){
		pair<llo,llo> no=aa.top();
		aa.pop();
		no.a=-no.a;
		for(auto nn:adj2[no.b]){
			if(dis3[nn.a]==-1 or dis3[nn.a]>no.a+nn.b){
				dis3[nn.a]=no.a+nn.b;
				aa.push({-dis3[nn.a],nn.a});
			}
		}
	}
	llo dis4[n];
	for(llo i=0;i<n;i++){
		dis4[i]=-1;
	}
	dis4[n-1]=0;
	aa.push({0,n-1});
	while(!aa.empty()){
		pair<llo,llo> no=aa.top();
		aa.pop();
		no.a=-no.a;
		for(auto nn:adj2[no.b]){
			if(dis4[nn.a]==-1 or dis4[nn.a]>no.a+nn.b){
				dis4[nn.a]=no.a+nn.b;
				aa.push({-dis4[nn.a],nn.a});
			}
		}
	}
	llo ans=-1;
	if(dis[n-1]>-1 and dis2[0]>-1){
		ans=dis[n-1]+dis2[0];
	}
/*	cout<<ans<<endl;
	for(int i=0;i<n;i++){
		cout<<dis[i]<<" ";
	}
	cout<<endl;
	for(int i=0;i<n;i++){
		cout<<dis2[i]<<" ";
	}
	cout<<endl;
	for(int i=0;i<n;i++){
		cout<<dis3[i]<<" ";
	}
	cout<<endl;
	for(int i=0;i<n;i++){
		cout<<dis4[i]<<" ";
	}
	cout<<endl;*/
	for(llo i=0;i<n;i++){
		for(llo j=0;j<adj[i].size();j++){
			llo nn=adj[i][j].a;
			if(dis[nn]>-1 and dis4[i]>-1 and dis2[0]>-1){

				if(ans==-1){
					ans=dis2[0]+cost[i][j]+dis[nn]+dis4[i]+adj[i][j].b;
				}
				ans=min(ans,dis2[0]+cost[i][j]+dis[nn]+dis4[i]+adj[i][j].b);
			}
			if(dis2[nn]>-1 and dis3[i]>-1 and dis[n-1]>-1){
				if(ans==-1){
					ans=dis[n-1]+cost[i][j]+adj[i][j].b+dis2[nn]+dis3[i];
				}
				ans=min(ans,dis[n-1]+cost[i][j]+adj[i][j].b+dis2[nn]+dis3[i]);

			}
		}
	}
	cout<<ans<<endl;










	return 0;
}

Compilation message

ho_t4.cpp: In function 'int main()':
ho_t4.cpp:126:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(llo j=0;j<adj[i].size();j++){
               ~^~~~~~~~~~~~~~
ho_t4.cpp:25:6: warning: unused variable 'kk' [-Wunused-variable]
  llo kk=1;
      ^~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Incorrect 4 ms 384 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 5104 KB Output is correct
2 Correct 31 ms 5096 KB Output is correct
3 Correct 36 ms 5104 KB Output is correct
4 Correct 6 ms 512 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Incorrect 32 ms 4984 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 24 ms 4596 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 30 ms 4964 KB Output is correct
6 Incorrect 4 ms 384 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Incorrect 4 ms 384 KB Output isn't correct
8 Halted 0 ms 0 KB -