<JZOJ5907>轻功

dp大水题

由于未知错误wa了一个点

乱改了一下就A了

瘫

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#define rint register int
#define INF 9999999999
using std::min;
template <class T>inline void read(T &X)
{
    X=;int W=;char ch=;
    while(!isdigit(ch))W|=ch=='-',ch=getchar();
    while(isdigit(ch))X=(X<<)+(X<<)+(ch^),ch=getchar();
    X=W?-X:X;return;
}
int n,K,W,Q,a[],v[],mark[][]={},mk[]={};
long long dp[][],ans(INF);
bool boo=false;
void init()
{
    read(n),read(K),read(W);
    a[]=,v[]=;
    for(rint i=;i<=K;++i)
    {
        read(a[i]),read(v[i]);
        if(v[i]==)boo=true;
    }
    read(Q);
    int x,k;
    for(rint i=;i<=Q;++i)
        read(x),read(k),mark[x][k]=,mk[k]=;
    if(boo){printf("0\n");return;}

    for(rint i=;i<=n;++i)
        for(rint j=;j<=K;++j)
            dp[i][j]=INF;
    for(rint j=;j<=K;++j)dp[][j]=;
}
int main()
{
//    freopen("qinggong.in","r",stdin);
//    freopen("qinggong.out","w",stdout);
    init();
    if(boo)return ;
    for(rint i=;i<=n;++i)
    {
        for(rint j=;j<=K;++j)
        {
            if(a[j]>i)continue;
            bool boo(false);
            for(rint k=i-a[j];k<=i;++k)
            {
                if(!Q||!mk[j])break;
                if(mark[k][j]){boo=true;break;}
            }
            if(boo)continue;

            for(rint lastj=;lastj<=K;++lastj)
            {
                if(i<a[j]+a[lastj])continue;
                bool boo1(false);
                for(rint k=i-a[j]-a[lastj];k<=i-a[j];++k)
                {
                    if(k==)continue;
                    if(!Q||!mk[lastj])break;
                    if(mark[k][lastj]){boo1=true;break;}
                }
                if(boo1)continue;

                dp[i][j]=min(dp[i][j],dp[i-a[j]][j]+v[j]);
                dp[i][j]=min(dp[i][j],dp[i-a[j]][lastj]+v[j]+W);
            }
        }
    }

    for(rint j=;j<=K;++j)
        ans=min(ans,dp[n][j]);
    if(ans==INF)ans=-;
    printf("%lld\n",ans);
return ;
}