Submission #917513

#TimeUsernameProblemLanguageResultExecution timeMemory
917513shenfe1Cyberland (APIO23_cyberland)C++17
Compilation error
0 ms0 KiB
#include <bits/stdc++.h> #include "cyberland.h" #pragma optimize("03") #pragma 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 y1 yy #define ppb pop_back #define lb lower_bound #define ub upper_bound #define gcd(a,b) __gcd(a,b) #define in insert // #define int ll const int MAX=1e5+15; const ld inf=1e18; int dx[8]={1,0,-1,0,1,-1,-1,1}; int dy[8]={0,1,0,-1,1,-1,1,-1}; int binpow(int a,int n){ if(!n)return 1; if(n%2==1)return a*binpow(a,n-1)%mod; int k=binpow(a,n/2); return k*k%mod; } vector<pii> g[MAX]; ld dp[MAX][32]; double solve(int n,int m,int k,int h,vector<int> arr,vector<int> x,vector<int> y,vector<int> c){ 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"; } h++; for(int i=1;i<=n;i++){ for(int j=0;j<=k;j++)dp[i][j]=inf; } dp[1][0]=0; priority_queue<pair<ld,pii>> q; q.push({0,{1,0}}); while(!q.empty()){ pair<ld,pii> boofer=q.top(); q.pop(); int v=boofer.S.F,c=boofer.S.S; if(dp[v][c]<boofer.F)continue; // cout<<v<<" "<<c<<" "<<dp[v][c]<<"\n"; for(auto to:g[v]){ if(arr[to.F-1]==0){ if(dp[to.F][c]>0){ dp[to.F][c]=0; q.push({dp[to.F][c],{to.F,c}}); } } else if(arr[to.F-1]==1){ 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}}); } } else{ 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(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}}); } } } } ld ans=inf; for(int i=0;i<=k;i++)ans=min(ans,dp[h][i]); return ans; } // int main(){ // 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<<solve(n,m,k,h,arr,x,y,c); // }

Compilation message (stderr)

cyberland.cpp:4: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    4 | #pragma optimize("03")
      | 
cyberland.cpp:5: warning: ignoring '#pragma target ' [-Wunknown-pragmas]
    5 | #pragma target("avx2")
      | 
cyberland.cpp: In function 'int binpow(int, int)':
cyberland.cpp:35:36: error: 'mod' was not declared in this scope; did you mean 'modf'?
   35 |   if(n%2==1)return a*binpow(a,n-1)%mod;
      |                                    ^~~
      |                                    modf
cyberland.cpp:37:14: error: 'mod' was not declared in this scope; did you mean 'modf'?
   37 |   return k*k%mod;
      |              ^~~
      |              modf