【jzoj5341】【NOIP2017模拟9.2A组】【密州盛宴】

description

solution

可以发现如果把1看做1，把0看做-1，做后缀和如果小于-1表示东坡不能吃够n天，否则就一定合法。可以发现如果要移动就一定将后面的0移到最前面，移动x个就是前面的数往后移x位，往后移一位相当于把后缀和+1，可以发现最小后缀和是-x，那至少要往前移x-1个0。

code

#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#define LF double
#define LL long long
#define ULL unsigned LL
#define fo(i,j,k) for(LL i=j;i<=k;i++)
#define fd(i,j,k) for(LL i=j;i>=k;i--)
#define fr(i,j) for(LL i=begin[j];i;i=next[i])
using namespace std;
LL const mn=1e5+9,ml=1e6+9,inf=1e9+7;
LL n,m,a[mn],f[mn],g[mn];
char s[ml];
int main(){
    //freopen("meal.in","r",stdin);
    //freopen("meal.out","w",stdout);
    freopen("d.in","r",stdin);
    freopen("d.out","w",stdout);
    while(scanf("%lld%lld\n",&n,&m)!=EOF){
        if((!n)&&(!m))break;
        LL tm2=0;
        fo(i,1,m){
            scanf("%s",s+1);
            LL len=strlen(s+1),tmp=0,mi=inf,tm3=0;
            scanf("%lld\n",&a[i]);
            fd(j,len,1)tmp+=(s[j]=='0')?-1:1,mi=min(mi,tmp),tm3+=s[j]=='1';
            f[i]=tmp;g[i]=mi;tm2+=tm3*a[i];
        }
        LL tmp=0,mi=inf;
        fd(i,m,1){
            if(f[i]<0)mi=min(mi,tmp+f[i]*(a[i]-1)+g[i]);
            else mi=min(mi,tmp+g[i]);
            tmp+=f[i]*a[i];
        }
        if(tm2<n)printf("-1\n");
        else printf("%lld\n",max(1ll*0,-mi-1));
        scanf("\n");
    }
    return 0;
}