oj.uz

Submission #811999

# Submission time Handle Problem Language Result Execution time Memory
811999 2023-08-07T06:45:00 Z vjudge1 Olympic Bus (JOI20_ho_t4) C++17
37 / 100
 1000 ms 10768 KB 

#include <bits/stdc++.h>



using namespace std;

#define TL ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define rall(s) s.rbegin(),s.rend()
#define all(s) s.begin(),s.end()
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ld long double
#define YES cout<<"YES\n"
#define Yes cout<<"Yes\n"
#define yes cout<<"yes\n"
#define NO cout<<"NO\n"
#define No cout<<"No\n"
#define no cout<<"no\n"


const int N = 5e4 + 9 , mod = 1e9 + 7;
ll  d[209][209] ,us[N][209] ,  a[N] = {}, dp[N] ,  b[N] , c[N] , p[N];

vector<int>v[N][2];

void dijkstra(int x , int k,int p , int o , int n){
    ll i , j , m , s , f ,l , r , y;
    for(i = 1; i <= n; i++){
        d[i][p] = 1e15;
        ::p[i] = 0;
    }
    priority_queue<pair<ll,int>>pq;
    d[x][p] = 0;
    pq.push({0 , x});
    while(!pq.empty()){
        x = pq.top().se  , f = -pq.top().fi;
        pq.pop();
        if(d[x][p] != f){
            continue;
         }
         for(auto to : v[x][k]){
            if(to == o){
                continue;
            }
            if(k == 0)
                y = b[to];
            else
                y = a[to];
            if(d[x][p] + c[to] < d[y][p]){
                ::p[y]=  to;
                d[y][p] = d[x][p] + c[to];
                pq.push({-d[y][p] , y});
            }
         }
    }
    for(i = 1; i <= n; i++)
        us[::p[i]][p] = 1;
}

ll check[4] = {};
void get(int i , int x, int n){
    check[x] = us[i][x];
    if(us[i][x]){
        if(x == 0)
            dijkstra(1 , 0 , 0 , i,  n);
        if(x == 1)
            dijkstra(1 , 1 , 1 , i,  n);
        if(x == 2)
            dijkstra(n , 0 , 2 , i ,  n);
        if(x == 3)
            dijkstra(n , 1 , 3 , i ,  n);
    }
}


void solve(){
    ll q , i , j , m ,n, z ,s = 0 , f , l , r , k , x , y , mn  = 1e18 , mx = 0;
    cin>>n>>m;
    for(i = 1; i <= m; i++){
        cin>>a[i]>>b[i]>>c[i]>>dp[i];
        v[a[i]][0].pb(i);
        v[b[i]][1].pb(i);
    }
    dijkstra(1 , 0 , 0 , -1,  n);
    dijkstra(1 , 1 , 1 , -1,  n);
    dijkstra(n , 0 , 2 , -1 ,  n);
    dijkstra(n , 1 , 3 , -1 ,  n);
    //cout<<d[1][2]<<"\n";
    mn = d[n][0] + d[1][2];
    //cout<<mn<<"\n";
    for(i = 1; i <= m; i++){
        for(j = 0; j < 4; j++)
            check[j] = 0;
        get(i , 0 , n);
        get(i , 1 , n);
        get(i , 2 , n);
        get(i , 3 , n);
        //if(i == 3){
        //    cout<<a[i]<<" "<<b[i]<<" "<<"\n";
        //    cout<<b[i]<<" "<<d[b[i]][0]<<" "<<"\n";
        //    cout<<a[i]<<" "<<d[a[i]][3]<<" "<<"\n";
        //}
        x = min(d[n][0] , d[b[i]][0] + d[a[i]][3] + c[i]);
        y= min(d[1][2] , d[b[i]][2] + d[a[i]][1] + c[i]);
        //cout<<x<<" "<<y<<"\n";
        mn = min(mn , x + y + dp[i]);
        if(check[0])
            dijkstra(1 , 0 , 0 , -1,  n);
        if(check[1])
            dijkstra(1 , 1 , 1 , -1,  n);
        if(check[2])
            dijkstra(n , 0 , 2 , -1 ,  n);
        if(check[3])
            dijkstra(n , 1 , 3 , -1 ,  n);
    }
    if(mn >= 1e15)
        mn = -1;
    cout<<mn<<"\n";
}

int main(){

     TL;
    /* #ifndef ONLINE_JUDGE
     freopen("input.txt", "r", stdin);
     freopen("output.txt", "w", stdout);
     #endif
     */
int t = 1;
//cin>>t;

while(t--)
     {
     solve();
     }

}
// Author : حسن

Compilation message

ho_t4.cpp: In function 'void dijkstra(int, int, int, int, int)':
ho_t4.cpp:31:12: warning: unused variable 'j' [-Wunused-variable]
   31 |     ll i , j , m , s , f ,l , r , y;
      |            ^
ho_t4.cpp:31:16: warning: unused variable 'm' [-Wunused-variable]
   31 |     ll i , j , m , s , f ,l , r , y;
      |                ^
ho_t4.cpp:31:20: warning: unused variable 's' [-Wunused-variable]
   31 |     ll i , j , m , s , f ,l , r , y;
      |                    ^
ho_t4.cpp:31:27: warning: unused variable 'l' [-Wunused-variable]
   31 |     ll i , j , m , s , f ,l , r , y;
      |                           ^
ho_t4.cpp:31:31: warning: unused variable 'r' [-Wunused-variable]
   31 |     ll i , j , m , s , f ,l , r , y;
      |                               ^
ho_t4.cpp: In function 'void solve()':
ho_t4.cpp:81:8: warning: unused variable 'q' [-Wunused-variable]
   81 |     ll q , i , j , m ,n, z ,s = 0 , f , l , r , k , x , y , mn  = 1e18 , mx = 0;
      |        ^
ho_t4.cpp:81:26: warning: unused variable 'z' [-Wunused-variable]
   81 |     ll q , i , j , m ,n, z ,s = 0 , f , l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                          ^
ho_t4.cpp:81:29: warning: unused variable 's' [-Wunused-variable]
   81 |     ll q , i , j , m ,n, z ,s = 0 , f , l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                             ^
ho_t4.cpp:81:37: warning: unused variable 'f' [-Wunused-variable]
   81 |     ll q , i , j , m ,n, z ,s = 0 , f , l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                     ^
ho_t4.cpp:81:41: warning: unused variable 'l' [-Wunused-variable]
   81 |     ll q , i , j , m ,n, z ,s = 0 , f , l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                         ^
ho_t4.cpp:81:45: warning: unused variable 'r' [-Wunused-variable]
   81 |     ll q , i , j , m ,n, z ,s = 0 , f , l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                             ^
ho_t4.cpp:81:49: warning: unused variable 'k' [-Wunused-variable]
   81 |     ll q , i , j , m ,n, z ,s = 0 , f , l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                                 ^
ho_t4.cpp:81:74: warning: unused variable 'mx' [-Wunused-variable]
   81 |     ll q , i , j , m ,n, z ,s = 0 , f , l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                                                          ^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 4632 KB Output is correct
2 Correct 2 ms 3284 KB Output is correct
3 Correct 64 ms 4580 KB Output is correct
4 Correct 76 ms 4556 KB Output is correct
5 Correct 4 ms 3284 KB Output is correct
6 Correct 4 ms 3284 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 3 ms 2772 KB Output is correct
10 Correct 101 ms 4552 KB Output is correct
11 Correct 96 ms 4516 KB Output is correct
12 Correct 100 ms 4628 KB Output is correct
13 Correct 12 ms 4408 KB Output is correct
14 Correct 37 ms 4536 KB Output is correct
15 Correct 37 ms 4596 KB Output is correct
16 Correct 35 ms 4524 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 745 ms 8148 KB Output is correct
2 Correct 748 ms 8096 KB Output is correct
3 Correct 789 ms 8004 KB Output is correct
4 Correct 82 ms 5112 KB Output is correct
5 Correct 31 ms 4508 KB Output is correct
6 Correct 7 ms 3796 KB Output is correct
7 Correct 2 ms 3156 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 191 ms 7100 KB Output is correct
10 Correct 134 ms 7076 KB Output is correct
11 Correct 431 ms 7712 KB Output is correct
12 Correct 442 ms 7784 KB Output is correct
13 Correct 465 ms 7668 KB Output is correct
14 Correct 631 ms 7752 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 4580 KB Output is correct
2 Correct 4 ms 3412 KB Output is correct
3 Correct 519 ms 10588 KB Output is correct
4 Correct 4 ms 3412 KB Output is correct
5 Correct 588 ms 10768 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 113 ms 8316 KB Output is correct
9 Correct 122 ms 8224 KB Output is correct
10 Correct 357 ms 9812 KB Output is correct
11 Correct 353 ms 9904 KB Output is correct
12 Correct 387 ms 9944 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 1 ms 2644 KB Output is correct
16 Correct 1 ms 2644 KB Output is correct
17 Correct 1 ms 2688 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 390 ms 10684 KB Output is correct
20 Correct 328 ms 10468 KB Output is correct
21 Correct 343 ms 10520 KB Output is correct
22 Correct 347 ms 10584 KB Output is correct

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 4632 KB Output is correct
2 Correct 2 ms 3284 KB Output is correct
3 Correct 64 ms 4580 KB Output is correct
4 Correct 76 ms 4556 KB Output is correct
5 Correct 4 ms 3284 KB Output is correct
6 Correct 4 ms 3284 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 3 ms 2772 KB Output is correct
10 Correct 101 ms 4552 KB Output is correct
11 Correct 96 ms 4516 KB Output is correct
12 Correct 100 ms 4628 KB Output is correct
13 Correct 12 ms 4408 KB Output is correct
14 Correct 37 ms 4536 KB Output is correct
15 Correct 37 ms 4596 KB Output is correct
16 Correct 35 ms 4524 KB Output is correct
17 Correct 745 ms 8148 KB Output is correct
18 Correct 748 ms 8096 KB Output is correct
19 Correct 789 ms 8004 KB Output is correct
20 Correct 82 ms 5112 KB Output is correct
21 Correct 31 ms 4508 KB Output is correct
22 Correct 7 ms 3796 KB Output is correct
23 Correct 2 ms 3156 KB Output is correct
24 Correct 1 ms 2644 KB Output is correct
25 Correct 191 ms 7100 KB Output is correct
26 Correct 134 ms 7076 KB Output is correct
27 Correct 431 ms 7712 KB Output is correct
28 Correct 442 ms 7784 KB Output is correct
29 Correct 465 ms 7668 KB Output is correct
30 Correct 631 ms 7752 KB Output is correct
31 Correct 39 ms 4580 KB Output is correct
32 Correct 4 ms 3412 KB Output is correct
33 Correct 519 ms 10588 KB Output is correct
34 Correct 4 ms 3412 KB Output is correct
35 Correct 588 ms 10768 KB Output is correct
36 Correct 2 ms 2644 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 113 ms 8316 KB Output is correct
39 Correct 122 ms 8224 KB Output is correct
40 Correct 357 ms 9812 KB Output is correct
41 Correct 353 ms 9904 KB Output is correct
42 Correct 387 ms 9944 KB Output is correct
43 Correct 2 ms 2644 KB Output is correct
44 Correct 1 ms 2644 KB Output is correct
45 Correct 1 ms 2644 KB Output is correct
46 Correct 1 ms 2644 KB Output is correct
47 Correct 1 ms 2688 KB Output is correct
48 Correct 2 ms 2644 KB Output is correct
49 Correct 390 ms 10684 KB Output is correct
50 Correct 328 ms 10468 KB Output is correct
51 Correct 343 ms 10520 KB Output is correct
52 Correct 347 ms 10584 KB Output is correct
53 Correct 753 ms 8380 KB Output is correct
54 Correct 821 ms 8664 KB Output is correct
55 Correct 863 ms 8424 KB Output is correct
56 Correct 65 ms 4636 KB Output is correct
57 Correct 67 ms 4608 KB Output is correct
58 Correct 813 ms 8400 KB Output is correct
59 Correct 636 ms 8296 KB Output is correct
60 Correct 651 ms 8360 KB Output is correct
61 Correct 589 ms 8428 KB Output is correct
62 Correct 663 ms 8444 KB Output is correct
63 Correct 679 ms 8508 KB Output is correct
64 Execution timed out 1063 ms 6728 KB Time limit exceeded
65 Halted 0 ms 0 KB -