제출 #1034269

#제출 시각아이디문제언어결과실행 시간메모리
1034269BABY_GANGSTERSemiexpress (JOI17_semiexpress)C++14
0 / 100
1 ms600 KiB
//https://www.instagram.com/_modwwe/ #pragma GCC optimize("Ofast,unroll-loops") //#pragma GCC target("avx2,bmi,bmi2") #include<bits/stdc++.h> #define int long long //#define ll long long #define down cout<<'\n'; #define debug cout<<" cucuucucuuu",down #define NHP ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0); #define modwwe int t;cin>>t; while(t--) #define bit(i,j) (i>>j&1) #define sobit(a) __builtin_popcountll(a) #define task "test" #define fin(x) freopen(x".inp","r",stdin) #define fou(x) freopen(x".out","w",stdout) #define pb push_back #define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms"; using namespace std; void phongbeo(); const int inf=1e18; const int mod2=1e9+7; const int mod1=998244353; struct icd { int a,b; }; struct ib { int a; int b; }; struct ic { int a,b,c; }; struct id { int a,b,c,d; }; struct ie { int a,b,c,d,e,f; }; int n,m,s1,s2,s4,s3,sf,k,r,mid,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,dem=0,l,s33; int i,s10,s12; int kk; int el=29; main() { #ifndef ONLINE_JUDGE ///fin(task),fou(task); #endif NHP /// cin>>s1; // modwwe phongbeo(); } int a[3001]; int dp[3001]; void phongbeo() { cin>>n>>m>>k; cin>>s33>>s1>>s2; cin>>mx; for(int i=1; i<=m; i++) cin>>a[i]; k=k-m; a[m+1]=n+1; for(int i=1; i<=m; i++) { s3=(a[i]-a[1])*s1; s7=-1e9; s6=-1e9; s5=0; s4=-1; if(s3<=mx) { s4=0; for(int j=1; j<=k; j++) { s4+=(mx-s3)/s33+1; s6=min(s4+a[i],a[i+1]); dem=max(dem,dp[k-s5]+min(a[i+1]-a[i],s4)); if(s4+a[i]>=a[i+1])break; s3=(a[i]-a[1])*s1+s4*s2; if(s3>=mx) break; s7=s4; s5=j; } if(s3>=mx) { for(int j=k; j>=s5; --j) dp[j]=max(dp[j],dp[j-s5]+s4); } else if(s5==k) { s4+=(mx-s3)/s33+1; s4=min(s4,a[i+1]-a[i]); for(int j=k; j>=s5-1; --j) { dp[j]=max(dp[j],dp[j-s5+1]+s7); if(j-s5>=0)dp[j]=max(dp[j-s5]+a[i+1]-a[i],dp[j]); } } else { s7=min(s7,a[i+1]-a[i]); for(int j=k; j>=s5-1; --j) { dp[j]=max(dp[j],dp[j-s5+1]+s7); if(j-s5>=0)dp[j]=max(dp[j-s5]+a[i+1]-a[i],dp[j]); } } for(int j=1; j<=k; j++) dp[j]=max(dp[j],dp[j-1]); } else break; } cout<<max(dp[k],dem)-1; }

컴파일 시 표준 에러 (stderr) 메시지

semiexpress.cpp:49:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   49 | main()
      | ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...