oj.uz

Submission #807481

# Submission time Handle Problem Language Result Execution time Memory
807481 2023-08-04T17:57:34 Z vjudge1 Robot (JOI21_ho_t4) C++17
34 / 100
 3000 ms 96952 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 = 1e5 + 9 , mod = 1e9 + 7;
ll  d[N] = {} , dp[N] = {} , a[N] = {},  b[N] , c[N];


struct edge{
ll to , cost;
};
set<int>st[N];
map<int,vector<edge>>v[N];
map<int,ll>sum[N] , d1[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>>x>>y>>l>>r;
        st[x].insert(l);
        st[y].insert(l);
        v[x][l].pb({y , r});
        v[y][l].pb({x , r});
        sum[x][l] += r;
        sum[y][l] += r;
    }
    for(i = 1; i <= n; i++)
        d[i] = 1e18;
    priority_queue<pair<ll,pair<int,int>>>st;
    st.push({0 , {1 , 0}});
    d[1] = 0;
    while(!st.empty()){
        auto it = st.top();
        x = -it.fi , y = it.se.fi , k = it.se.se;
        st.pop();
        if(k){
            if(d1[y][k] != x)
            continue;
            for(auto to : v[y][k]){
                z = x + sum[y][k] - to.cost;
                if(d[to.to] > z)
                    d[to.to] = z , st.push({-d[to.to] , {to.to  , 0}});
            }
        }else {
            if(d[y] != x)
                continue;
            for(auto  it : ::st[y]){
                for(auto to : v[y][it]){
                    z = min(to.cost , sum[y][it] - to.cost);
                    z += x;
                    if(d[to.to] > z)
                    d[to.to] = z , st.push({-d[to.to] , {to.to , 0}});
                    if(!d1[to.to].count(it) || x < d1[to.to][it])
                        d1[to.to][it] = x;
                        st.push({-d1[to.to][it] , {to.to, it}});
                }
            }
        }
    }
    cout<<(d[n] >= 1e18 ? -1 : d[n])<<"\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

Main.cpp: In function 'void solve()':
Main.cpp:74:21: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   74 |                     if(!d1[to.to].count(it) || x < d1[to.to][it])
      |                     ^~
Main.cpp:76:25: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   76 |                         st.push({-d1[to.to][it] , {to.to, it}});
      |                         ^~
Main.cpp:37:8: warning: unused variable 'q' [-Wunused-variable]
   37 |     ll q , i , j , m ,n, z ,s = 0 , f , l , r , k , x , y , mn  = 1e18 , mx = 0;
      |        ^
Main.cpp:37:16: warning: unused variable 'j' [-Wunused-variable]
   37 |     ll q , i , j , m ,n, z ,s = 0 , f , l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                ^
Main.cpp:37:29: warning: unused variable 's' [-Wunused-variable]
   37 |     ll q , i , j , m ,n, z ,s = 0 , f , l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                             ^
Main.cpp:37:37: warning: unused variable 'f' [-Wunused-variable]
   37 |     ll q , i , j , m ,n, z ,s = 0 , f , l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                     ^
Main.cpp:37:61: warning: unused variable 'mn' [-Wunused-variable]
   37 |     ll q , i , j , m ,n, z ,s = 0 , f , l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                                             ^~
Main.cpp:37:74: warning: unused variable 'mx' [-Wunused-variable]
   37 |     ll q , i , j , m ,n, z ,s = 0 , f , l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                                                          ^~

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 19028 KB Output is correct
2 Correct 9 ms 19128 KB Output is correct
3 Correct 9 ms 19020 KB Output is correct
4 Correct 8 ms 19028 KB Output is correct
5 Correct 12 ms 19156 KB Output is correct
6 Correct 9 ms 19124 KB Output is correct
7 Correct 12 ms 19304 KB Output is correct
8 Correct 9 ms 19124 KB Output is correct
9 Correct 15 ms 19924 KB Output is correct
10 Correct 14 ms 19796 KB Output is correct
11 Correct 15 ms 19516 KB Output is correct
12 Correct 11 ms 19540 KB Output is correct
13 Correct 15 ms 19540 KB Output is correct
14 Correct 15 ms 19540 KB Output is correct
15 Correct 11 ms 19388 KB Output is correct
16 Correct 11 ms 19540 KB Output is correct
17 Correct 11 ms 19540 KB Output is correct
18 Correct 10 ms 19284 KB Output is correct
19 Correct 14 ms 19440 KB Output is correct
20 Correct 12 ms 19500 KB Output is correct

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 214 ms 41148 KB Output is correct
2 Correct 80 ms 30776 KB Output is correct
3 Correct 254 ms 36196 KB Output is correct
4 Correct 115 ms 33832 KB Output is correct
5 Correct 993 ms 96952 KB Output is correct
6 Execution timed out 3083 ms 82596 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 19028 KB Output is correct
2 Correct 9 ms 19128 KB Output is correct
3 Correct 9 ms 19020 KB Output is correct
4 Correct 8 ms 19028 KB Output is correct
5 Correct 12 ms 19156 KB Output is correct
6 Correct 9 ms 19124 KB Output is correct
7 Correct 12 ms 19304 KB Output is correct
8 Correct 9 ms 19124 KB Output is correct
9 Correct 15 ms 19924 KB Output is correct
10 Correct 14 ms 19796 KB Output is correct
11 Correct 15 ms 19516 KB Output is correct
12 Correct 11 ms 19540 KB Output is correct
13 Correct 15 ms 19540 KB Output is correct
14 Correct 15 ms 19540 KB Output is correct
15 Correct 11 ms 19388 KB Output is correct
16 Correct 11 ms 19540 KB Output is correct
17 Correct 11 ms 19540 KB Output is correct
18 Correct 10 ms 19284 KB Output is correct
19 Correct 14 ms 19440 KB Output is correct
20 Correct 12 ms 19500 KB Output is correct
21 Correct 214 ms 41148 KB Output is correct
22 Correct 80 ms 30776 KB Output is correct
23 Correct 254 ms 36196 KB Output is correct
24 Correct 115 ms 33832 KB Output is correct
25 Correct 993 ms 96952 KB Output is correct
26 Execution timed out 3083 ms 82596 KB Time limit exceeded
27 Halted 0 ms 0 KB -