oj.uz

Submission #923016

# Submission time Handle Problem Language Result Execution time Memory
923016 2024-02-06T12:37:06 Z vjudge1 Olympic Bus (JOI20_ho_t4) C++17
100 / 100
 365 ms 7900 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 maksim gay
#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=1e16;
const int N=5e4+100;
const int MAX=210;
const int mod=1e9+7;


int n,m;
int a[N],b[N],c[N],dv[N];
vector<pii> g[MAX];
vector<pii> g1[MAX];
int use[MAX];
int cmp[MAX];
vector<int> top;

void dfs(int v){
  use[v]=1;
  for(auto to:g[v]){
    if(!use[to.F])dfs(to.F);
  }
  top.pb(v);
}

void dfs1(int v,int c){
  cmp[v]=c;
  for(auto to:g1[v]){
    if(!cmp[to.F]){
      dfs1(to.F,c);
    }
  }
}

int dp[MAX][MAX];

int ban[N];
int d[MAX];

int solve(int x){
  int ans=0;
  vector<pii> g[MAX];
  for(int i=1;i<=m;i++){
    if(i==x){
      g[b[i]].pb({a[i],c[i]});
    }
    else{
      g[a[i]].pb({b[i],c[i]});
    }
  }
  {
    for(int i=1;i<=n;i++)d[i]=inf;
    d[1]=0;
    mem(use,0);
    for(int i=1;i<=n;i++){
      int v=-1;
      for(int j=1;j<=n;j++){
        if(!use[j]&&(v==-1||d[j]<d[v])){
          v=j;
        }
      }
      use[v]=1;
      for(auto to:g[v]){
        if(d[to.F]>d[v]+to.S){
          d[to.F]=d[v]+to.S;
        }
      }
    }
    ans+=d[n];
  }
  {
    for(int i=1;i<=n;i++)d[i]=inf;
    d[n]=0;
    mem(use,0);
    for(int i=1;i<=n;i++){
      int v=-1;
      for(int j=1;j<=n;j++){
        if(!use[j]&&(v==-1||d[j]<d[v])){
          v=j;
        }
      }
      use[v]=1;
      for(auto to:g[v]){
        if(d[to.F]>d[v]+to.S){
          d[to.F]=d[v]+to.S;
        }
      }
    }
    ans+=d[1];
  }
  // cout<<x<<" "<<ans<<"\n";
  return ans;
}

vector<int> reb;
vector<int> fff;

void dfs2(int v,int en){
  use[v]=1;
  if(v==en){
    // cout<<sz(fff)<<"\n";
    for(int x:fff)reb.pb(x);
    return;
  }
  for(auto to:g1[v]){
    if(use[to.F]||dp[en][to.F]+c[to.S]!=dp[en][v])continue;
    fff.pb(to.S);
    dfs2(to.F,en);
    fff.ppb();
  }
}

void SUB1(){
  mem(use,0);
  dfs2(1,n);
  mem(use,0);
  dfs2(n,1);
  int ans=min(inf,dp[1][n]+dp[n][1]);
  for(int x:reb){
    ans=min(ans,solve(x)+dv[x]);
    ban[x]=1;
  }
  // cout<<sz(reb)<<"\n";
  for(int i=1;i<=m;i++){
    if(!ban[i]){
      int c1n=dp[1][n];
      {
        c1n=min(c1n,dp[1][b[i]]+c[i]+dp[a[i]][n]);
        // cout<<1<<" "<<b[i]<<" "<<a[i]<<" "<<n<<"\n";
      }
      int cn1=dp[n][1];
      {
        cn1=min(cn1,dp[n][b[i]]+c[i]+dp[a[i]][1]);
        // cout<<n<<" "<<b[i]<<" "<<a[i]<<" "<<1<<"\n";
      }
      // cout<<i<<" "<<c1n<<" "<<cn1<<"\n";
      ans=min(ans,c1n+cn1+dv[i]);
    }
  }
  if(ans!=inf)cout<<ans<<"\n";
  else cout<<-1<<"\n";
}

void solve(){
  cin>>n>>m;
  for(int i=1;i<=m;i++){
    cin>>a[i]>>b[i]>>c[i]>>dv[i];
    g[a[i]].pb({b[i],c[i]});
    g1[b[i]].pb({a[i],i});
  }
  for(int i=1;i<=n;i++){
    if(!use[i]){
      dfs(i);
    }
  }
  int cnt=0;
  reverse(all(top));
  for(int x:top){
    if(!cmp[x]){
      dfs1(x,++cnt);
    }
  }
  for(int i=1;i<=n;i++){
    for(int j=1;j<=n;j++){
      if(i!=j)dp[i][j]=inf;
    }
  }
  for(int i=1;i<=m;i++){
    dp[a[i]][b[i]]=min(dp[a[i]][b[i]],c[i]);
  }
  for(int k=1;k<=n;k++){
    for(int i=1;i<=n;i++){
      for(int j=1;j<=n;j++){
        dp[i][j]=min(dp[i][j],dp[i][k]+dp[k][j]);
      }
    }
  }
  // cout<<-1<<"\n";
  // return;
  SUB1();
}

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:207:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  207 | main(){
      | ^~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 2392 KB Output is correct
2 Correct 9 ms 2396 KB Output is correct
3 Correct 11 ms 2396 KB Output is correct
4 Correct 11 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 8 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 2 ms 2396 KB Output is correct
10 Correct 79 ms 2520 KB Output is correct
11 Correct 79 ms 2648 KB Output is correct
12 Correct 78 ms 2628 KB Output is correct
13 Correct 9 ms 2396 KB Output is correct
14 Correct 11 ms 2628 KB Output is correct
15 Correct 10 ms 2396 KB Output is correct
16 Correct 10 ms 2604 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 7284 KB Output is correct
2 Correct 29 ms 7304 KB Output is correct
3 Correct 28 ms 7448 KB Output is correct
4 Correct 10 ms 2652 KB Output is correct
5 Correct 11 ms 2396 KB Output is correct
6 Correct 8 ms 2396 KB Output is correct
7 Correct 8 ms 2396 KB Output is correct
8 Correct 0 ms 2392 KB Output is correct
9 Correct 28 ms 6236 KB Output is correct
10 Correct 21 ms 6236 KB Output is correct
11 Correct 33 ms 7508 KB Output is correct
12 Correct 28 ms 7436 KB Output is correct
13 Correct 29 ms 7436 KB Output is correct
14 Correct 30 ms 7900 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 2648 KB Output is correct
2 Correct 10 ms 2396 KB Output is correct
3 Correct 78 ms 6060 KB Output is correct
4 Correct 8 ms 2396 KB Output is correct
5 Correct 108 ms 7332 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 20 ms 5980 KB Output is correct
9 Correct 20 ms 5980 KB Output is correct
10 Correct 96 ms 7428 KB Output is correct
11 Correct 59 ms 7428 KB Output is correct
12 Correct 60 ms 7340 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 67 ms 7588 KB Output is correct
20 Correct 115 ms 7196 KB Output is correct
21 Correct 113 ms 7172 KB Output is correct
22 Correct 128 ms 7272 KB Output is correct

Subtask #4
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 2392 KB Output is correct
2 Correct 9 ms 2396 KB Output is correct
3 Correct 11 ms 2396 KB Output is correct
4 Correct 11 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 8 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 2 ms 2396 KB Output is correct
10 Correct 79 ms 2520 KB Output is correct
11 Correct 79 ms 2648 KB Output is correct
12 Correct 78 ms 2628 KB Output is correct
13 Correct 9 ms 2396 KB Output is correct
14 Correct 11 ms 2628 KB Output is correct
15 Correct 10 ms 2396 KB Output is correct
16 Correct 10 ms 2604 KB Output is correct
17 Correct 28 ms 7284 KB Output is correct
18 Correct 29 ms 7304 KB Output is correct
19 Correct 28 ms 7448 KB Output is correct
20 Correct 10 ms 2652 KB Output is correct
21 Correct 11 ms 2396 KB Output is correct
22 Correct 8 ms 2396 KB Output is correct
23 Correct 8 ms 2396 KB Output is correct
24 Correct 0 ms 2392 KB Output is correct
25 Correct 28 ms 6236 KB Output is correct
26 Correct 21 ms 6236 KB Output is correct
27 Correct 33 ms 7508 KB Output is correct
28 Correct 28 ms 7436 KB Output is correct
29 Correct 29 ms 7436 KB Output is correct
30 Correct 30 ms 7900 KB Output is correct
31 Correct 37 ms 2648 KB Output is correct
32 Correct 10 ms 2396 KB Output is correct
33 Correct 78 ms 6060 KB Output is correct
34 Correct 8 ms 2396 KB Output is correct
35 Correct 108 ms 7332 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct
38 Correct 20 ms 5980 KB Output is correct
39 Correct 20 ms 5980 KB Output is correct
40 Correct 96 ms 7428 KB Output is correct
41 Correct 59 ms 7428 KB Output is correct
42 Correct 60 ms 7340 KB Output is correct
43 Correct 1 ms 2392 KB Output is correct
44 Correct 1 ms 2392 KB Output is correct
45 Correct 1 ms 2392 KB Output is correct
46 Correct 1 ms 2396 KB Output is correct
47 Correct 1 ms 2396 KB Output is correct
48 Correct 1 ms 2396 KB Output is correct
49 Correct 67 ms 7588 KB Output is correct
50 Correct 115 ms 7196 KB Output is correct
51 Correct 113 ms 7172 KB Output is correct
52 Correct 128 ms 7272 KB Output is correct
53 Correct 26 ms 7028 KB Output is correct
54 Correct 31 ms 7168 KB Output is correct
55 Correct 34 ms 7144 KB Output is correct
56 Correct 10 ms 2392 KB Output is correct
57 Correct 10 ms 2396 KB Output is correct
58 Correct 284 ms 6144 KB Output is correct
59 Correct 296 ms 6468 KB Output is correct
60 Correct 288 ms 6176 KB Output is correct
61 Correct 285 ms 6520 KB Output is correct
62 Correct 286 ms 6148 KB Output is correct
63 Correct 281 ms 6144 KB Output is correct
64 Correct 365 ms 6632 KB Output is correct
65 Correct 353 ms 6520 KB Output is correct
66 Correct 348 ms 6692 KB Output is correct
67 Correct 11 ms 6088 KB Output is correct
68 Correct 22 ms 6236 KB Output is correct
69 Correct 22 ms 6352 KB Output is correct
70 Correct 31 ms 7392 KB Output is correct
71 Correct 28 ms 7308 KB Output is correct
72 Correct 27 ms 7368 KB Output is correct
73 Correct 28 ms 7624 KB Output is correct
74 Correct 30 ms 7452 KB Output is correct