oj.uz

답안 #705410

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
705410 2023-03-04T10:25:29 Z blacktulip Olympic Bus (JOI20_ho_t4) C++17
0 / 100
 10 ms 1228 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long lo; 
typedef pair< lo,lo > PII;

#define fi first
#define se second
#define int long long
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 505;
const lo mod = 1000000007;

int n,m,k,flag,t,y[li],z[li],c[li],d[li],dist[li][li],cur1[li],value,yasak[li],par[li];
int cev;
bool vis[li],yolda[li],yolda1[li];
string s;
vector<pair<int,pair<int,int>>> v[li],rv[li];

inline int in(){
    int x;
    scanf("%lld",&x);
    return x;
}

inline void sp(bool cont){
	priority_queue<pair<int,int>> pq;
	pq.push({0,1});
	for(int i=1;i<=n;i++){vis[i]=0;cur1[i]=inf;}
	while(pq.size()){
		int node=pq.top().se;
		int co=-pq.top().fi;
		pq.pop();
		if(vis[node])continue;
		vis[node]=1;
		cur1[node]=co;
		for(auto go:v[node]){
			if(!vis[go.fi] && yasak[go.se.se]==0 && go.se.fi+co<cur1[go.fi]){cur1[go.fi]=go.se.fi+co;par[go.fi]=node;pq.push({-co-go.se.fi,go.fi});}
		}
	}
	if(cont){value=cur1[n];return ;}
	if(vis[n]==0)return ;
	int node=n;
	while(node!=1){
		for(auto go:rv[node]){
			if(go.fi==par[node]){node=go.fi;yolda1[go.se.se]=1;break;}
		}
	}
}

inline void sp1(bool cont){
	priority_queue<pair<int,int>> pq;
	pq.push({0,n});
	for(int i=1;i<=n;i++){vis[i]=0;cur1[i]=inf;}
	while(pq.size()){
		int node=pq.top().se;
		int co=-pq.top().fi;
		pq.pop();
		if(vis[node])continue;
		vis[node]=1;
		cur1[node]=co;
		for(auto go:v[node]){
			if(!vis[go.fi] && yasak[go.se.se]==0 && go.se.fi+co<cur1[go.fi]){cur1[go.fi]=go.se.fi+co;par[go.fi]=node;pq.push({-co-go.se.fi,go.fi});}
		}
	}
	if(cont){value=cur1[1];return ;}
	if(vis[1]==0)return ;
	int node=1;
	while(node!=n){
		for(auto go:rv[node]){
			if(go.fi==par[node]){node=go.fi;yolda1[go.se.se]=1;break;}
		}
	}
}

int32_t main(void){
    n=in(),m=in();
    FOR{
		for(int j=1;j<=n;j++){dist[i][j]=inf;}
		dist[i][i]=0;
	}
    for(int i=1;i<=m;i++){
		y[i]=in(),z[i]=in(),c[i]=in(),d[i]=in();
		dist[y[i]][z[i]]=min(dist[y[i]][z[i]],c[i]);
		v[y[i]].pb({z[i],{c[i],i}});
		rv[z[i]].pb({y[i],{c[i],i}});
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			for(int jj=1;jj<=n;jj++){
				dist[j][jj]=min(dist[j][jj],dist[j][i]+dist[i][jj]);
			}
		}
	}
	sp(0);
	sp1(0);
	//~ cout<<"**\n";
	cev=dist[1][n]+dist[n][1];
	for(int i=1;i<=m;i++){
		if(yolda[i]==0 && yolda1[i]==0){
			cev=min(cev,dist[1][n]+dist[n][z[i]]+dist[y[i]][1]+d[i]+c[i]);
			cev=min(cev,dist[n][1]+dist[1][z[i]]+dist[y[i]][n]+d[i]+c[i]);
			continue;
		}
		if(yolda[i] && yolda1[i]){
			continue;
		}
		if(yolda[i]){
			yasak[i]=1;
			sp(1);
			yasak[i]=0;
			cev=min(cev,min(dist[n][1],dist[n][z[i]]+dist[y[i]][1]+c[i]+d[i])+value);
			continue;
		}
		yasak[i]=1;
		sp1(1);
		yasak[i]=0;
		cev=min(cev,min(dist[1][n],dist[1][z[i]]+dist[y[i]][n]+c[i]+d[i])+value);
	}
	if(cev>=inf)cev=-1;
	printf("%lld\n",cev);
    return 0;
}

Compilation message

ho_t4.cpp: In function 'long long int in()':
ho_t4.cpp:33:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |     scanf("%lld",&x);
      |     ~~~~~^~~~~~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 1108 KB Output is correct
2 Correct 9 ms 1164 KB Output is correct
3 Incorrect 10 ms 1108 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

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

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 1108 KB Output is correct
2 Correct 8 ms 1108 KB Output is correct
3 Correct 10 ms 1220 KB Output is correct
4 Correct 9 ms 1108 KB Output is correct
5 Correct 9 ms 1228 KB Output is correct
6 Correct 1 ms 352 KB Output is correct
7 Correct 1 ms 360 KB Output is correct
8 Incorrect 9 ms 1116 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 1108 KB Output is correct
2 Correct 9 ms 1164 KB Output is correct
3 Incorrect 10 ms 1108 KB Output isn't correct
4 Halted 0 ms 0 KB -