oj.uz

Submission #224130

# Submission time Handle Problem Language Result Execution time Memory
224130 2020-04-17T08:37:17 Z tqbfjotld Olympic Bus (JOI20_ho_t4) C++14
5 / 100
 107 ms 1656 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF 500000000000LL

int n,m;
int dist[205];
vector<pair<int,int> > adjl[205];
vector<pair<int,int> > rev[205];
int c[50005];
int d[50005];
int adjm[405][405];

main(){
    scanf("%lld%lld",&n,&m);
    
    if (m<=1000){
        for (int x = 0; x<m; x++){
            int a,b;
            scanf("%lld%lld%lld%lld",&a,&b,&c[x],&d[x]);
            adjl[a].push_back({b,x});
            rev[b].push_back({a,x});
        }
        int fans = INF;
        for (int cov = -1; cov<m; cov++){
            priority_queue<pair<int,int>, vector<pair<int,int> >, greater<pair<int,int> > > pq;

            for (int x = 0; x<=n; x++){
                dist[x] = INF;
            }
            dist[1] = 0;
            pq.push({0,1});
            while (!pq.empty()){
                int d = pq.top().first;
                int node = pq.top().second;
                pq.pop();
                if (d>dist[node]) continue;
                for (auto x : adjl[node]){
                    if (x.second==cov) continue;
                    if (dist[node]+c[x.second]<dist[x.first]){
                        dist[x.first] = dist[node]+c[x.second];
                        pq.push({dist[x.first],x.first});
                    }
                }
                for (auto x : rev[node]){
                    if (x.second!=cov) continue;
                    if (dist[node]+c[x.second]<dist[x.first]){
                        dist[x.first] = dist[node]+c[x.second];
                        pq.push({dist[x.first],x.first});
                    }
                }
            }
            int ans = dist[n];
            if (ans==INF) continue;
            for (int x = 0; x<=n; x++){
                dist[x] = INF;
            }
            dist[n] = 0;
            pq.push({0,n});
            while (!pq.empty()){
                int d = pq.top().first;
                int node = pq.top().second;
                pq.pop();
                if (d>dist[node]) continue;
                for (auto x : adjl[node]){
                    if (x.second==cov) continue;
                    if (dist[node]+c[x.second]<dist[x.first]){
                        dist[x.first] = dist[node]+c[x.second];
                        pq.push({dist[x.first],x.first});
                    }
                }
                for (auto x : rev[node]){
                    if (x.second!=cov) continue;
                    if (dist[node]+c[x.second]<dist[x.first]){
                        dist[x.first] = dist[node]+c[x.second];
                        pq.push({dist[x.first],x.first});
                    }
                }
            }
            if (dist[1]==INF) continue;
            fans = min(fans,ans+dist[1]+d[cov]);
        }
        printf("%lld",fans==INF?-1:fans);
        return 0;
    }
    
    for (int x = 0; x<=2*n; x++){
        for (int y = 0; y<=2*n; y++){
            adjm[x][y] = INF;
            if (x==y) adjm[x][y] = 0;
        }
    }
    for (int x = 0; x<m; x++){
        int a,b,c,d;
        scanf("%lld%lld%lld%lld",&a,&b,&c,&d);
        adjm[a][b] = min(adjm[a][b],c);
        adjm[a+n][b+n] = min(adjm[a+n][b+n],c);
        adjm[b][a+n] = min(adjm[b][a+n],c+d);
    }
    for (int k = 1; k<=2*n; k++){
        for (int i = 1; i<=2*n; i++){
            for (int j = 1; j<=2*n; j++){
                adjm[i][j] = min(adjm[i][j],adjm[i][k]+adjm[k][j]);
            }
        }
    }

    int ans1 = min(adjm[1][n]+adjm[n][1],adjm[1][2*n]+adjm[2*n][n+1]);
    ans1 = min(ans1,adjm[1][n]+adjm[n][n+1]);
    printf("%lld",ans1>=INF?-1:ans1);
    return 0;
}

Compilation message

ho_t4.cpp:14:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^
ho_t4.cpp: In function 'int main()':
ho_t4.cpp:15:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld%lld",&n,&m);
     ~~~~~^~~~~~~~~~~~~~~~~~
ho_t4.cpp:20:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%lld%lld%lld%lld",&a,&b,&c[x],&d[x]);
             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ho_t4.cpp:95:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld%lld%lld%lld",&a,&b,&c,&d);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 65 ms 384 KB Output is correct
4 Correct 67 ms 384 KB Output is correct
5 Correct 24 ms 384 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 Correct 9 ms 384 KB Output is correct
10 Correct 88 ms 384 KB Output is correct
11 Correct 88 ms 384 KB Output is correct
12 Correct 93 ms 384 KB Output is correct
13 Correct 26 ms 384 KB Output is correct
14 Correct 43 ms 384 KB Output is correct
15 Correct 15 ms 384 KB Output is correct
16 Correct 42 ms 460 KB Output is correct

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 1536 KB Output is correct
2 Correct 100 ms 1536 KB Output is correct
3 Correct 102 ms 1536 KB Output is correct
4 Correct 82 ms 1536 KB Output is correct
5 Correct 39 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Incorrect 107 ms 1656 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 99 ms 1656 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 94 ms 1536 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Incorrect 95 ms 1656 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 65 ms 384 KB Output is correct
4 Correct 67 ms 384 KB Output is correct
5 Correct 24 ms 384 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 Correct 9 ms 384 KB Output is correct
10 Correct 88 ms 384 KB Output is correct
11 Correct 88 ms 384 KB Output is correct
12 Correct 93 ms 384 KB Output is correct
13 Correct 26 ms 384 KB Output is correct
14 Correct 43 ms 384 KB Output is correct
15 Correct 15 ms 384 KB Output is correct
16 Correct 42 ms 460 KB Output is correct
17 Correct 103 ms 1536 KB Output is correct
18 Correct 100 ms 1536 KB Output is correct
19 Correct 102 ms 1536 KB Output is correct
20 Correct 82 ms 1536 KB Output is correct
21 Correct 39 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 6 ms 384 KB Output is correct
24 Correct 4 ms 384 KB Output is correct
25 Incorrect 107 ms 1656 KB Output isn't correct
26 Halted 0 ms 0 KB -