oj.uz

답안 #807496

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
807496 2023-08-04T18:15:17 Z vjudge1 Robot (JOI21_ho_t4) C++17
34 / 100
 3000 ms 98728 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>st[N];
vector<int>vc[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++)
        for(auto to : st[i])
            vc[i].pb(to);
    for(i = 1; i <= n; i++)
        d[i] = 1e18;
    priority_queue<pair<ll,pair<int,int>>>st;
    st.push({0 , {0 , 1}});
    d[1] = 0;
    while(!st.empty()){
        auto it = st.top();
        x = -it.fi , y = it.se.se , k = -it.se.fi;
        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] , {0 , to.to }});
            }
        }else {
            if(d[y] != x)
                continue;
            for(auto  it : vc[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)
                    d[to.to] = z , st.push({-d[to.to] , {0 , to.to}});
                    if(!d1[to.to].count(it) || x < d1[to.to][it])
                        d1[to.to][it] = x;
                        st.push({-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:78:21: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   78 |                     if(!d1[to.to].count(it) || x < d1[to.to][it])
      |                     ^~
Main.cpp:80:25: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   80 |                         st.push({-d1[to.to][it] , {-it, to.to}});
      |                         ^~
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

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 21460 KB Output is correct
2 Correct 10 ms 21372 KB Output is correct
3 Correct 10 ms 21376 KB Output is correct
4 Correct 10 ms 21352 KB Output is correct
5 Correct 11 ms 21424 KB Output is correct
6 Correct 10 ms 21460 KB Output is correct
7 Correct 11 ms 21572 KB Output is correct
8 Correct 10 ms 21532 KB Output is correct
9 Correct 13 ms 22228 KB Output is correct
10 Correct 14 ms 22124 KB Output is correct
11 Correct 19 ms 21888 KB Output is correct
12 Correct 13 ms 21844 KB Output is correct
13 Correct 15 ms 21844 KB Output is correct
14 Correct 16 ms 21972 KB Output is correct
15 Correct 10 ms 21716 KB Output is correct
16 Correct 12 ms 21716 KB Output is correct
17 Correct 13 ms 21844 KB Output is correct
18 Correct 10 ms 21716 KB Output is correct
19 Correct 12 ms 21632 KB Output is correct
20 Correct 10 ms 21716 KB Output is correct

Subtask #2
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 200 ms 43404 KB Output is correct
2 Correct 71 ms 33040 KB Output is correct
3 Correct 199 ms 36252 KB Output is correct
4 Correct 110 ms 35904 KB Output is correct
5 Correct 959 ms 98728 KB Output is correct
6 Execution timed out 3078 ms 86108 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 21460 KB Output is correct
2 Correct 10 ms 21372 KB Output is correct
3 Correct 10 ms 21376 KB Output is correct
4 Correct 10 ms 21352 KB Output is correct
5 Correct 11 ms 21424 KB Output is correct
6 Correct 10 ms 21460 KB Output is correct
7 Correct 11 ms 21572 KB Output is correct
8 Correct 10 ms 21532 KB Output is correct
9 Correct 13 ms 22228 KB Output is correct
10 Correct 14 ms 22124 KB Output is correct
11 Correct 19 ms 21888 KB Output is correct
12 Correct 13 ms 21844 KB Output is correct
13 Correct 15 ms 21844 KB Output is correct
14 Correct 16 ms 21972 KB Output is correct
15 Correct 10 ms 21716 KB Output is correct
16 Correct 12 ms 21716 KB Output is correct
17 Correct 13 ms 21844 KB Output is correct
18 Correct 10 ms 21716 KB Output is correct
19 Correct 12 ms 21632 KB Output is correct
20 Correct 10 ms 21716 KB Output is correct
21 Correct 200 ms 43404 KB Output is correct
22 Correct 71 ms 33040 KB Output is correct
23 Correct 199 ms 36252 KB Output is correct
24 Correct 110 ms 35904 KB Output is correct
25 Correct 959 ms 98728 KB Output is correct
26 Execution timed out 3078 ms 86108 KB Time limit exceeded
27 Halted 0 ms 0 KB -