oj.uz

Submission #807512

# Submission time Handle Problem Language Result Execution time Memory
807512 2023-08-04T18:31:26 Z vjudge1 Robot (JOI21_ho_t4) C++17
58 / 100
 3000 ms 109048 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{
int to , cost;
};
set<int>vc[N];
vector<int>st1[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;
        vc[x].insert(l);
        vc[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;
    set<pair<ll,pair<int,int>>>st;
    st.insert({0 , {0 , 1}});
    d[1] = 0;
    for(i = 1; i <= n; i++)
        for(auto to : vc[i])
            st1[i].pb(to);
    while(!st.empty()){
        x = st.begin()->fi , y = st.begin()->se.se , k = st.begin()->se.fi;
        st.erase(st.begin());
        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){

                    if(st.find({d[to.to] , {0 , to.to}}) != st.end())
                        st.erase({d[to.to] , {0 , to.to}});
                    d[to.to] = z , st.insert({d[to.to] , {0 , to.to }});
                }
            }
        }else {
            if(d[y] != x)
                continue;
            for(auto  it : st1[y]){
                for(auto to : v[y][it]){
                    z = to.cost;
                    if(z >  sum[y][it] - to.cost)
                        z = sum[y][it] - to.cost;
                    z += x;
                    if(d[to.to] > z){
                    if(st.find({d[to.to] , {0 , to.to}}) != st.end())
                        st.erase({d[to.to] , {0 , to.to}});
                    d[to.to] = z , st.insert({d[to.to] , {0 , to.to}});
                    }
                    if(!d1[to.to].count(it) || x < d1[to.to][it])
                    if(st.find({d1[to.to][it] , {it , to.to}}) != st.end())
                        st.erase({d1[to.to][it] , {it , to.to}});
                        d1[to.to][it] = x;
                        st.insert({d1[to.to][it] , {it, to.to}});
                }
            }
        }
    }
    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:42:21: warning: narrowing conversion of 'y' from 'long long int' to 'int' [-Wnarrowing]
   42 |         v[x][l].pb({y , r});
      |                     ^
Main.cpp:42:25: warning: narrowing conversion of 'r' from 'long long int' to 'int' [-Wnarrowing]
   42 |         v[x][l].pb({y , r});
      |                         ^
Main.cpp:43:21: warning: narrowing conversion of 'x' from 'long long int' to 'int' [-Wnarrowing]
   43 |         v[y][l].pb({x , r});
      |                     ^
Main.cpp:43:25: warning: narrowing conversion of 'r' from 'long long int' to 'int' [-Wnarrowing]
   43 |         v[y][l].pb({x , r});
      |                         ^
Main.cpp:85:21: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   85 |                     if(st.find({d1[to.to][it] , {it , to.to}}) != st.end())
      |                     ^~
Main.cpp:87:25: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   87 |                         d1[to.to][it] = x;
      |                         ^~
Main.cpp:36:8: warning: unused variable 'q' [-Wunused-variable]
   36 |     ll q , i , j , m ,n, z ,s = 0 , f , l , r , k , x , y , mn  = 1e18 , mx = 0;
      |        ^
Main.cpp:36:16: warning: unused variable 'j' [-Wunused-variable]
   36 |     ll q , i , j , m ,n, z ,s = 0 , f , l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                ^
Main.cpp:36:29: warning: unused variable 's' [-Wunused-variable]
   36 |     ll q , i , j , m ,n, z ,s = 0 , f , l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                             ^
Main.cpp:36:37: warning: unused variable 'f' [-Wunused-variable]
   36 |     ll q , i , j , m ,n, z ,s = 0 , f , l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                     ^
Main.cpp:36:61: warning: unused variable 'mn' [-Wunused-variable]
   36 |     ll q , i , j , m ,n, z ,s = 0 , f , l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                                             ^~
Main.cpp:36:74: warning: unused variable 'mx' [-Wunused-variable]
   36 |     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 9 ms 21460 KB Output is correct
2 Correct 11 ms 21468 KB Output is correct
3 Correct 10 ms 21460 KB Output is correct
4 Correct 11 ms 21472 KB Output is correct
5 Correct 11 ms 21460 KB Output is correct
6 Correct 10 ms 21464 KB Output is correct
7 Correct 13 ms 21588 KB Output is correct
8 Correct 10 ms 21460 KB Output is correct
9 Correct 14 ms 22380 KB Output is correct
10 Correct 13 ms 22228 KB Output is correct
11 Correct 12 ms 21972 KB Output is correct
12 Correct 11 ms 21900 KB Output is correct
13 Correct 12 ms 21868 KB Output is correct
14 Correct 12 ms 21916 KB Output is correct
15 Correct 10 ms 21736 KB Output is correct
16 Correct 11 ms 21864 KB Output is correct
17 Correct 11 ms 21844 KB Output is correct
18 Correct 11 ms 21716 KB Output is correct
19 Correct 12 ms 21716 KB Output is correct
20 Correct 11 ms 21844 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 238 ms 45868 KB Output is correct
2 Correct 84 ms 34456 KB Output is correct
3 Correct 218 ms 36732 KB Output is correct
4 Correct 125 ms 37256 KB Output is correct
5 Correct 1073 ms 109048 KB Output is correct
6 Correct 965 ms 95196 KB Output is correct
7 Correct 415 ms 67608 KB Output is correct
8 Correct 421 ms 55952 KB Output is correct
9 Correct 402 ms 55992 KB Output is correct
10 Correct 425 ms 62212 KB Output is correct
11 Correct 149 ms 41820 KB Output is correct

Subtask #3
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 21460 KB Output is correct
2 Correct 11 ms 21468 KB Output is correct
3 Correct 10 ms 21460 KB Output is correct
4 Correct 11 ms 21472 KB Output is correct
5 Correct 11 ms 21460 KB Output is correct
6 Correct 10 ms 21464 KB Output is correct
7 Correct 13 ms 21588 KB Output is correct
8 Correct 10 ms 21460 KB Output is correct
9 Correct 14 ms 22380 KB Output is correct
10 Correct 13 ms 22228 KB Output is correct
11 Correct 12 ms 21972 KB Output is correct
12 Correct 11 ms 21900 KB Output is correct
13 Correct 12 ms 21868 KB Output is correct
14 Correct 12 ms 21916 KB Output is correct
15 Correct 10 ms 21736 KB Output is correct
16 Correct 11 ms 21864 KB Output is correct
17 Correct 11 ms 21844 KB Output is correct
18 Correct 11 ms 21716 KB Output is correct
19 Correct 12 ms 21716 KB Output is correct
20 Correct 11 ms 21844 KB Output is correct
21 Correct 238 ms 45868 KB Output is correct
22 Correct 84 ms 34456 KB Output is correct
23 Correct 218 ms 36732 KB Output is correct
24 Correct 125 ms 37256 KB Output is correct
25 Correct 1073 ms 109048 KB Output is correct
26 Correct 965 ms 95196 KB Output is correct
27 Correct 415 ms 67608 KB Output is correct
28 Correct 421 ms 55952 KB Output is correct
29 Correct 402 ms 55992 KB Output is correct
30 Correct 425 ms 62212 KB Output is correct
31 Correct 149 ms 41820 KB Output is correct
32 Correct 202 ms 27692 KB Output is correct
33 Correct 185 ms 31332 KB Output is correct
34 Correct 541 ms 56164 KB Output is correct
35 Correct 364 ms 47032 KB Output is correct
36 Correct 379 ms 58656 KB Output is correct
37 Correct 462 ms 60860 KB Output is correct
38 Correct 491 ms 67636 KB Output is correct
39 Correct 185 ms 28876 KB Output is correct
40 Correct 403 ms 55976 KB Output is correct
41 Correct 443 ms 55916 KB Output is correct
42 Correct 588 ms 69116 KB Output is correct
43 Correct 237 ms 43676 KB Output is correct
44 Correct 516 ms 43160 KB Output is correct
45 Correct 375 ms 54904 KB Output is correct
46 Correct 284 ms 54608 KB Output is correct
47 Execution timed out 3063 ms 57496 KB Time limit exceeded
48 Halted 0 ms 0 KB -