Submission #45655600

---

Source Code Expand

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<cassert>
#include<queue>
using namespace std;
#define Ed for(int i=h[x];~i;i=ne[i])
#define Ls(i,l,r) for(int i=l;i<r;++i)
#define Rs(i,l,r) for(int i=l;i>r;--i)
#define Le(i,l,r) for(int i=l;i<=r;++i)
#define Re(i,l,r) for(int i=l;i>=r;--i)
#define L(i,l) for(int i=0;i<l;++i)
#define E(i,l) for(int i=1;i<=l;++i)
#define W(t) while(t--)
#define Wh while
typedef long long ll;

const int N=310,M=2*N;
const ll INF=1e16;
int n,h,x[M],p[N],f[N],cnt,tmpa,tmpb;
ll dp[N][N][N][3];
#define Min(x) ((tmpa=x)<h?tmpa:h)
//i:点对（从中心到两边）j:进去时的油量 k:出去时的... 0:没有选择 1: 选择了左边 2: 选择了右边
int main(){
    #ifndef ONLINE_JUDGE
    freopen("1.in","r",stdin);
    // freopen("1.out","w",stdout);
    #endif
    scanf("%d%d",&n,&h);
    E(i, n)scanf("%d",x+i);
    E(i, n)scanf("%d%d",p+i,f+i);
    cnt=n;
    Re(i, n-1, 1)x[++cnt]=x[n]*2-x[i];
    x[++cnt]=x[n]*2;
    // L(i, cnt+1)printf("%d ",x[i]);
    L(ii, n+1)
        L(i, h+1)
            L(j, h+1)
                L(k, 3)dp[ii][i][j][k]=INF;
    L(i, h+1)dp[n][i][i][0]=0;
    Re(i, n-1, 0){
        int dis=x[i+1]-x[i];
        Le(iny, 0, h+1){//dp[n][iny][outy(not real,take some changes)]
            L(outy, h+1){
                L(lc, 3){
                    L(rc, 3){
                        // if(iny==12){
                        //     puts("start");
                        // }
                        int rr_out=outy-dis+(lc&2?f[i]:0);
                        int real_out=Min(rr_out);
                        int iiny=Min(f[i]+iny);
                        iiny-=dis;
                        bool can_left=lc&1?(iiny>=0):(iny-dis>=0);
                        bool can_right=outy>=dis;
                        int in_out=Min(lc&1?(iiny):iny-dis);
                        if(!can_left||!can_right)continue;
                        ll &v=dp[i][iny][real_out][lc];
                        v=min(dp[i+1][in_out][outy][rc]+(lc?p[i]:0),v);
                        // if(v!=INF){
                        //     // assert(real_out<=10);
                        //     // assert(h==10);
                        //     printf("(%d,%d,%d,%d) from (%d,%d,%d,%d),now is %lld\n",
                        //     i,iny,real_out,lc,i+1,in_out,outy,rc,v
                        //     );
                        // }
                    }
                }
            }
        }
    }
    ll ans=INF;
    L(i, h+1)
        L(k, 3)ans=min(ans,dp[0][h][i][k]);//,printf("dp[%d][%d]=%lld\n",i,k,dp[0][h][i][k]);
    printf("%lld",ans==INF?-1:ans);
    return 0;
}

Submission Info

Compile Error

Main.cpp: In function ‘int main()’:
Main.cpp:30:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   30 |     scanf("%d%d",&n,&h);
      |     ~~~~~^~~~~~~~~~~~~~
Main.cpp:31:17: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   31 |     E(i, n)scanf("%d",x+i);
      |            ~~~~~^~~~~~~~~~
Main.cpp:32:17: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   32 |     E(i, n)scanf("%d%d",p+i,f+i);
      |            ~~~~~^~~~~~~~~~~~~~~~

Judge Result