| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 747123 | 1075508020060209tc | Olympic Bus (JOI20_ho_t4) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
//#define int long long
int n;int m;
int uar[50010];int var[50010];int war[50010];int dar[50010];
int dis[210];
int rdis[210];
int vis[210];
int odis[210];
int ordis[210];
vector<pair<int,int>>e[210];
int dijkstera(){
for(int i=1;i<=n;i++){
dis[i]=1e9;
vis[i]=0;
rdis[i]=1e9;
e[i].clear();
}
for(int i=1;i<=m;i++){
e[uar[i]].push_back({var[i],war[i]});
}
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>pq;
dis[1]=0;
pq.push({0,1});
while(pq.size()){
int nw=pq.top().second;
pq.pop();
if(vis[nw]){continue;}
vis[nw]=1;
for(int i=0;i<e[nw].size();i++){
int v=e[nw][i].first;
int w=e[nw][i].second;
if(dis[v]>dis[nw]+w){
dis[v]=dis[nw]+w;
pq.push({dis[v],v});
}
}
}
rdis[n]=0;
pq.push({0,n});
while(pq.size()){
int nw=pq.top().second;
pq.pop();
if(vis[nw]==2){continue;}
vis[nw]=2;
for(int i=0;i<e[nw].size();i++){
int v=e[nw][i].first;
int w=e[nw][i].second;
if(rdis[v]>rdis[nw]+w){
rdis[v]=rdis[nw]+w;
pq.push({rdis[v],v});
}
}
}
return dis[n]+rdis[1];
}
vector<int>ee[210];
vector<int>er[210];
int dis1[210];int frm[210];
int rdis1[210];int frmn[210];
int disn[210];
int rdisn[210];
int fdis[210][210];
int isin[50010];
signed main()
{
cin.tie(0);
ios_base::sync_with_stdio(0);
cin>>n>>m;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
fdis[i][j]=2e9;
}
fdis[i][i]=0;
}
for(int i=1;i<=m;i++){
cin>>uar[i]>>var[i]>>war[i]>>dar[i];
ee[uar[i]].push_back(i);
er[var[i]].push_back(i);
fdis[uar[i]][var[i]]=min(fdis[uar[i]][var[i]],war[i]);
}
for(int i=1;i<=n;i++){
dis1[i]=2e9;
rdis1[i]=2e9;
disn[i]=2e9;
rdisn[i]=2e9;
}
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>pq;
dis1[1]=0;
pq.push({0,1});
while(pq.size()){
int nw=pq.top().second;
pq.pop();
if(vis[nw]){continue;}
vis[nw]=1;
for(int i=0;i<ee[nw].size();i++){
int id=ee[nw][i];
int v=var[id];int w=war[id];
if(dis1[v]>dis1[nw]+w){
dis1[v]=dis1[nw]+w;
frm[v]=id;
pq.push({dis1[v],v});
}
}
}
for(int i=1;i<=n;i++){
vis[i]=0;
}
disn[n]=0;
pq.push({0,n});
while(pq.size()){
int nw=pq.top().second;
pq.pop();
if(vis[nw]){continue;}
vis[nw]=1;
for(int i=0;i<ee[nw].size();i++){
int id=ee[nw][i];
int v=var[id];int w=war[id];
if(disn[v]>disn[nw]+w){
disn[v]=disn[nw]+w;
frmn[v]=id;
pq.push({disn[v],v});
}
}
}
for(int i=1;i<=n;i++){
for(int a=1;a<=n;a++){
for(int b=1;b<=n;b++){
fdis[a][b]=min(fdis[a][b],fdis[a][i]+fdis[i][b]);
}
}
}
if(dis1[n]<2e9){
int nw=n;
while(nw!=1){
int id=frm[nw];
isin[id]=1;
nw=uar[id];
}
}
if(disn[1]<2e9){
int nw=1;
while(nw!=n){
int id=frmn[nw];
isin[id]=1;
nw=uar[id];
}
}
long long ans=dijkstera();
//cout<<"hihi\n";
for(int i=1;i<=m;i++){
// cout<<i<<" ";
if(isin[i]){
swap(uar[i],var[i]);
ans=min(ans,dijkstera()+dar[i]);
swap(uar[i],var[i]);
}else{
// continue;
int a=uar[i];int b=var[i];
long long cal=min(dis1[n],fdis[1][b]+war[i]+fdis[a][n] )+fdis[n][b]+fdis[a][1]+war[i];
cal=min(cal,min(disn[1],fdis[n][b]+war[i]+fdis[a][1])+fdis[1][b]+fdis[a][n]+war[i] );
ans=min(ans,cal+dar[i]);
}
//}
// cout<<ans<<endl;
}
if(ans>=3e9){ans=-1;}
cout<<ans<<endl;
}