Submission #917640

#	Time	Username	Problem	Language	Result	Execution time	Memory
917640		shenfe1	Cyberland (APIO23_cyberland)	C++17	97 / 100	3006 ms	159308 KiB

cyberland

#include <bits/stdc++.h>
#include "cyberland.h"

#pragma GCC optimize("Ofast")
#pragma comment(linker, "/stack:200000000")
#pragma GCC target( "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native" )
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
#pragma GCC optimize("vpt")
#pragma GCC optimize("rename-registers")
#pragma GCC optimize("move-loop-invariants")
#pragma GCC optimize("unswitch-loops")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#pragma GCC tartget("avx2")

using namespace std;

#define F first
#define S second
#define pb push_back
#define pii pair<int,int>

const int MAX=1e5+15;
const double inf=1e18;

int use[MAX];
vector<pii> g[MAX];

double solve(int n,int m,int k,int h,vector<int> x,vector<int> y,vector<int> c,vector<int> arr){
  double dp[n+1][67];
  for(int i=1;i<=n;i++){
    use[i]=0;
    g[i].clear();
  }
  for(int i=0;i<m;i++){
    x[i]++;
    y[i]++;
    g[x[i]].pb({y[i],c[i]});
    g[y[i]].pb({x[i],c[i]});
    // cout<<x[i]<<" "<<y[i]<<" "<<c[i]<<"\n";
  }
  {
    queue<int> q;
    q.push(1);
    use[1]=1;
    while(!q.empty()){
      int v=q.front();
      q.pop();
      if(v==h+1)continue;
      for(auto to:g[v]){
        if(!use[to.F]){
          q.push(to.F);
          use[to.F]=1;
        }
      }
    }
    if(!use[h+1]){
      return -1.0;
    }
  }
  k=min(k,66);
  h++;
  for(int i=1;i<=n;i++){
    for(int j=0;j<=k;j++)dp[i][j]=inf;
  }
  priority_queue<pair<double,pii>> q;
  for(int i=1;i<=n;i++){
    if((i==1||arr[i-1]==0)&&use[i]){
      dp[i][0]=0;
      q.push({0,{i,0}});
    }
  }
  while(!q.empty()){
    int v=q.top().S.F,c=q.top().S.S;
    if(dp[v][c]<-q.top().F||v==h){
      q.pop();
      continue;
    }
    q.pop();
    // cout<<v<<" "<<c<<" "<<dp[v][c]<<"\n";
    for(auto to:g[v]){
      if(dp[v][c]+to.S<dp[to.F][c]){
        dp[to.F][c]=dp[v][c]+to.S;
        q.push({-dp[to.F][c],{to.F,c}});
      }
      if(arr[to.F-1]==2){
        if(c+1<=k&&(dp[v][c]+to.S)/2<dp[to.F][c+1]){
          dp[to.F][c+1]=(dp[v][c]+to.S)/2;
          q.push({-dp[to.F][c+1],{to.F,c+1}});
        }
      }
    }
  }
  double ans=inf;
  for(int i=0;i<=k;i++)ans=min(ans,dp[h][i]);
  return ans;
}

// int main(){
//   ios_base::sync_with_stdio(0);
//   cin.tie(0);
//   cout.tie(0);
//   int t;
//   cin>>t;
//   cout.precision(10);
//   while(t--){
//     int n,m,k,h;
//     cin>>n>>m>>k>>h;
//     vector<int> arr(n);
//     for(int i=0;i<n;i++)cin>>arr[i];
//     vector<int> x(m),y(m),c(m);
//     for(int i=0;i<m;i++)cin>>x[i]>>y[i]>>c[i];
//     cout<<fixed<<solve(n,m,k,h,x,y,c,arr)<<"\n";
//   }
// }

Compilation message (stderr)

cyberland.cpp:5: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    5 | #pragma comment(linker, "/stack:200000000")
      | 
cyberland.cpp:26: warning: ignoring '#pragma GCC tartget' [-Wunknown-pragmas]
   26 | #pragma GCC tartget("avx2")
      | 
cyberland.cpp:8:71: warning: bad option '-fprofile-values' to pragma 'optimize' [-Wpragmas]
    8 | #pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
      |                                                                       ^
cyberland.cpp:41:95: warning: bad option '-fprofile-values' to attribute 'optimize' [-Wattributes]
   41 | double solve(int n,int m,int k,int h,vector<int> x,vector<int> y,vector<int> c,vector<int> arr){
      |                                                                                               ^

• Subtask 1: 5 / 5
• Subtask 2: 8 / 8
• Subtask 3: 13 / 13
• Subtask 4: 19 / 19
• Subtask 5: 7 / 7
• Subtask 6: 16 / 16
• Subtask 7: 29 / 29
• Subtask 8: 0 / 3