oj.uz

답안 #211201

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
211201 2020-03-19T12:04:15 Z kshitij_sodani Olympic Bus (JOI20_ho_t4) C++17
0 / 100
 45 ms 5616 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 dis[201][201];
int mat[201][201];
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	llo n,m;
	memset(dis,-1,sizeof(dis));
	memset(mat,0,sizeof(mat));

	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);
		dis[ac-1][bb-1]=cc;
	}
	for(int i=0;i<n;i++){
		dis[i][i]=0;
	}
	for(int k=0;k<n;k++){
		for(int i=0;i<n;i++){
			for(int j=0;j<n;j++){
				if(dis[i][k]!=-1 and dis[k][j]!=-1){
					if(dis[i][j]==-1){
						dis[i][j]=dis[i][k]+dis[k][j];
					}
					else{
						dis[i][j]=min(dis[i][j],dis[i][k]+dis[k][j]);
					}
				}
			}
		}
	}
	/*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});
			}
		}
	}*/

/*	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;*/
	llo ans=-1;
	if(dis[0][n-1]>-1 and dis[n-1][0]>-1){
		ans=dis[0][n-1]+dis[n-1][0];
	}
	for(llo i=0;i<n;i++){
		for(llo j=0;j<adj[i].size();j++){
			llo nn=adj[i][j].a;
			if(dis[i][0]>-1 and dis[0][n-1]>-1 and dis[n-1][nn]>-1){

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

				if(ans==-1){
					ans=dis[i][n-1]+cost[i][j]+dis[0][nn]+dis[n-1][0]+adj[i][j].b;
				}
				ans=min(ans,dis[i][n-1]+cost[i][j]+dis[0][nn]+dis[n-1][0]+adj[i][j].b);
			}
		}
	}
	cout<<ans<<endl;










	return 0;
}

Compilation message

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

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 768 KB Output is correct
2 Correct 14 ms 640 KB Output is correct
3 Correct 16 ms 768 KB Output is correct
4 Correct 16 ms 768 KB Output is correct
5 Incorrect 5 ms 768 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 45 ms 5608 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 896 KB Output is correct
2 Correct 13 ms 640 KB Output is correct
3 Correct 37 ms 5100 KB Output is correct
4 Correct 12 ms 640 KB Output is correct
5 Correct 41 ms 5616 KB Output is correct
6 Incorrect 5 ms 640 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 768 KB Output is correct
2 Correct 14 ms 640 KB Output is correct
3 Correct 16 ms 768 KB Output is correct
4 Correct 16 ms 768 KB Output is correct
5 Incorrect 5 ms 768 KB Output isn't correct
6 Halted 0 ms 0 KB -