oj.uz

Submission #922801

# Submission time Handle Problem Language Result Execution time Memory
922801 2024-02-06T06:48:20 Z vjudge1 Olympic Bus (JOI20_ho_t4) C++17
0 / 100
 1000 ms 262144 KB 
#include <bits/stdc++.h>

#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")

using namespace std;

#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define mem(a,i) memset(a,i,sizeof(a))
#define sz(s) (int)s.size()
#define int ll
#define y1 yy
#define ppb pop_back
#define gcd(a,b) __gcd(a,b)
#define in insert

const int dx[4]={-1,0,1,0};
const int dy[4]={0,-1,0,1};

const int inf=1e18;
const int N=5e4+100;
const int MAX=210;
const int mod=1e9+7;


int n,m;
vector<pair<int,pii>> g[MAX];
int d[MAX][N];
int d1[MAX][N];

void solve(){
  cin>>n>>m;
  for(int i=1;i<=m;i++){
    int u,v,c,d;
    cin>>u>>v>>c>>d;
    g[u].pb({v,{c,i+m}});
    g[v].pb({u,{c+d,i}});
  }
  {
    for(int i=1;i<=n;i++){
      for(int j=0;j<=m;j++){
        d[i][j]=inf;
      }
    }
    priority_queue<pair<int,pii>> st;
    for(int j=0;j<=m;j++){
      d[1][j]=0;
      st.push({d[1][j],{1,j}});
    }
    while(!st.empty()){
      int v=st.top().S.F;
      int r=st.top().S.S;
      int w=st.top().F;
      st.pop();
      if(d[v][r]!=-w)continue;
      for(auto to:g[v]){
        if(to.S.S>m){
          if(to.S.S-m==r)continue;
          if(d[to.F][r]>d[v][r]+to.S.F){
            d[to.F][r]=d[v][r]+to.S.F;
            st.push({-d[to.F][r],{to.F,r}});
          }
        }
        else{
          if(to.S.S!=r)continue;
          if(d[to.F][r]>d[v][r]+to.S.F){
            d[to.F][r]=d[v][r]+to.S.F;
            st.push({-d[to.F][r],{to.F,r}});
          }
        }
      }
    }
  }
  {
    for(int i=1;i<=n;i++){
      for(int j=0;j<=m;j++){
        d1[i][j]=inf;
      }
    }
    priority_queue<pair<int,pii>> st;
    for(int j=0;j<=m;j++){
      d1[n][j]=0;
      st.push({d1[n][j],{n,j}});
    }
    while(!st.empty()){
      int v=st.top().S.F;
      int r=st.top().S.S;
      int w=-st.top().F;
      st.pop();
      if(w!=d1[v][r])continue;
      for(auto to:g[v]){
        if(to.S.S>m){
          if(to.S.S-m==r)continue;
          if(d1[to.F][r]>d1[v][r]+to.S.F){
            d1[to.F][r]=d1[v][r]+to.S.F;
            st.push({-d1[to.F][r],{to.F,r}});
          }
        }
        else{
          if(to.S.S!=r)continue;
          if(d1[to.F][r]>d1[v][r]+to.S.F){
            d1[to.F][r]=d1[v][r]+to.S.F;
            st.push({-d1[to.F][r],{to.F,r}});
          }
        }
      }
    }
  }
  int ans=d[n][0]+d1[1][0];
  for(int i=1;i<=m;i++){
    ans=min(ans,d[n][i]+d1[1][i]);
  }
  if(ans<inf)cout<<ans<<"\n";
  else cout<<-1<<"\n";
}

main(){
  // freopen("prizes.in", "r", stdin);
  // freopen("prizes.out", "w", stdout);
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t=1;
  // cin>>t;
  while(t--){
    solve();
  }
}

Compilation message

ho_t4.cpp:124:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  124 | main(){
      | ^~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 164284 KB Output is correct
2 Correct 19 ms 160344 KB Output is correct
3 Correct 106 ms 171572 KB Output is correct
4 Correct 124 ms 172860 KB Output is correct
5 Correct 36 ms 34880 KB Output is correct
6 Correct 20 ms 160344 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 6 ms 4648 KB Output is correct
10 Correct 138 ms 171084 KB Output is correct
11 Correct 135 ms 172812 KB Output is correct
12 Correct 136 ms 172976 KB Output is correct
13 Incorrect 70 ms 163388 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Runtime error 260 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 164804 KB Output is correct
2 Correct 24 ms 160600 KB Output is correct
3 Execution timed out 1054 ms 85476 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 164284 KB Output is correct
2 Correct 19 ms 160344 KB Output is correct
3 Correct 106 ms 171572 KB Output is correct
4 Correct 124 ms 172860 KB Output is correct
5 Correct 36 ms 34880 KB Output is correct
6 Correct 20 ms 160344 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 6 ms 4648 KB Output is correct
10 Correct 138 ms 171084 KB Output is correct
11 Correct 135 ms 172812 KB Output is correct
12 Correct 136 ms 172976 KB Output is correct
13 Incorrect 70 ms 163388 KB Output isn't correct
14 Halted 0 ms 0 KB -