oj.uz

답안 #747126

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
747126 2023-05-23T16:21:36 Z 1075508020060209tc Olympic Bus (JOI20_ho_t4) C++14
37 / 100
 1000 ms 4784 KB 
#include <bits/stdc++.h>
using namespace std;

int n;int m;
int uar[50010];int var[50010];long long war[50010];long long dar[50010];
long long dis[210];
long long rdis[210];
int vis[210];
long long odis[210];
long long ordis[210];
vector<pair<int,long long>>e[210];
long long dijkstera(){
for(int i=1;i<=n;i++){
    dis[i]=1e18;
    vis[i]=0;
    rdis[i]=1e18;
    e[i].clear();
}
for(int i=1;i<=m;i++){
    e[uar[i]].push_back({var[i],war[i]});
}
 
priority_queue<pair<long long,int>,vector<pair<long long,int>>,greater<pair<long long,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;
        long long 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;
        long long 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];
 
long long dis1[210];int frm[210];
long long rdis1[210];int frmn[210];
 
long long disn[210];
long long rdisn[210];
 
long long 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]=1e18;
        }
        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]=1e18;
        rdis1[i]=1e18;
        disn[i]=1e18;
        rdisn[i]=1e18;
    }
 
    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]<1e18){
    int nw=n;
    while(nw!=1){
        int id=frm[nw];
        isin[id]=1;
        nw=uar[id];
    }
    }
    if(disn[1]<1e18){
    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>=1e18){ans=-1;}
cout<<ans<<endl;
 
 
 
}

Compilation message

ho_t4.cpp: In function 'long long int dijkstera()':
ho_t4.cpp:31:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |     for(int i=0;i<e[nw].size();i++){
      |                 ~^~~~~~~~~~~~~
ho_t4.cpp:49:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |     for(int i=0;i<e[nw].size();i++){
      |                 ~^~~~~~~~~~~~~
ho_t4.cpp: In function 'int main()':
ho_t4.cpp:106:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  106 |         for(int i=0;i<ee[nw].size();i++){
      |                     ~^~~~~~~~~~~~~~
ho_t4.cpp:126:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  126 |         for(int i=0;i<ee[nw].size();i++){
      |                     ~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 724 KB Output is correct
2 Correct 11 ms 724 KB Output is correct
3 Correct 9 ms 780 KB Output is correct
4 Correct 10 ms 724 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 9 ms 724 KB Output is correct
7 Correct 1 ms 352 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 35 ms 724 KB Output is correct
11 Correct 40 ms 764 KB Output is correct
12 Correct 35 ms 852 KB Output is correct
13 Correct 9 ms 724 KB Output is correct
14 Correct 10 ms 772 KB Output is correct
15 Correct 9 ms 748 KB Output is correct
16 Correct 9 ms 724 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 4464 KB Output is correct
2 Correct 36 ms 4484 KB Output is correct
3 Correct 35 ms 4536 KB Output is correct
4 Correct 10 ms 880 KB Output is correct
5 Correct 9 ms 724 KB Output is correct
6 Correct 9 ms 852 KB Output is correct
7 Correct 10 ms 736 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 28 ms 4428 KB Output is correct
10 Correct 30 ms 4488 KB Output is correct
11 Correct 37 ms 4580 KB Output is correct
12 Correct 36 ms 4624 KB Output is correct
13 Correct 39 ms 4592 KB Output is correct
14 Correct 38 ms 4784 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 760 KB Output is correct
2 Correct 8 ms 732 KB Output is correct
3 Correct 25 ms 3552 KB Output is correct
4 Correct 9 ms 724 KB Output is correct
5 Correct 37 ms 4332 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 26 ms 4324 KB Output is correct
9 Correct 40 ms 4536 KB Output is correct
10 Correct 29 ms 4552 KB Output is correct
11 Correct 33 ms 4488 KB Output is correct
12 Correct 30 ms 4556 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 27 ms 4244 KB Output is correct
20 Correct 28 ms 4172 KB Output is correct
21 Correct 28 ms 4072 KB Output is correct
22 Correct 36 ms 3992 KB Output is correct

Subtask #4
0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 724 KB Output is correct
2 Correct 11 ms 724 KB Output is correct
3 Correct 9 ms 780 KB Output is correct
4 Correct 10 ms 724 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 9 ms 724 KB Output is correct
7 Correct 1 ms 352 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 35 ms 724 KB Output is correct
11 Correct 40 ms 764 KB Output is correct
12 Correct 35 ms 852 KB Output is correct
13 Correct 9 ms 724 KB Output is correct
14 Correct 10 ms 772 KB Output is correct
15 Correct 9 ms 748 KB Output is correct
16 Correct 9 ms 724 KB Output is correct
17 Correct 33 ms 4464 KB Output is correct
18 Correct 36 ms 4484 KB Output is correct
19 Correct 35 ms 4536 KB Output is correct
20 Correct 10 ms 880 KB Output is correct
21 Correct 9 ms 724 KB Output is correct
22 Correct 9 ms 852 KB Output is correct
23 Correct 10 ms 736 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 28 ms 4428 KB Output is correct
26 Correct 30 ms 4488 KB Output is correct
27 Correct 37 ms 4580 KB Output is correct
28 Correct 36 ms 4624 KB Output is correct
29 Correct 39 ms 4592 KB Output is correct
30 Correct 38 ms 4784 KB Output is correct
31 Correct 10 ms 760 KB Output is correct
32 Correct 8 ms 732 KB Output is correct
33 Correct 25 ms 3552 KB Output is correct
34 Correct 9 ms 724 KB Output is correct
35 Correct 37 ms 4332 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 26 ms 4324 KB Output is correct
39 Correct 40 ms 4536 KB Output is correct
40 Correct 29 ms 4552 KB Output is correct
41 Correct 33 ms 4488 KB Output is correct
42 Correct 30 ms 4556 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 27 ms 4244 KB Output is correct
50 Correct 28 ms 4172 KB Output is correct
51 Correct 28 ms 4072 KB Output is correct
52 Correct 36 ms 3992 KB Output is correct
53 Correct 32 ms 3948 KB Output is correct
54 Correct 39 ms 4076 KB Output is correct
55 Correct 37 ms 3884 KB Output is correct
56 Correct 10 ms 752 KB Output is correct
57 Correct 10 ms 776 KB Output is correct
58 Correct 176 ms 3324 KB Output is correct
59 Correct 197 ms 3300 KB Output is correct
60 Correct 254 ms 3304 KB Output is correct
61 Correct 150 ms 3276 KB Output is correct
62 Correct 190 ms 3408 KB Output is correct
63 Correct 256 ms 3156 KB Output is correct
64 Correct 750 ms 3936 KB Output is correct
65 Correct 830 ms 4052 KB Output is correct
66 Execution timed out 1067 ms 3864 KB Time limit exceeded
67 Halted 0 ms 0 KB -