NOJ [1455] Malphite

点击打开链接

没玩过lol 的我表示蛋疼   

#include<stdio.h>
#include<string.h>
struct node
{
    int time,damage;
}attack[10005];
int main()
{
    int m,n;
    while(~scanf("%d%d",&m,&n))
    {
        int i;
        for(i=1;i<=n;i++)
            scanf("%d%d",&attack[i].time,&attack[i].damage);
        int t=m/10;
        int reduce;
        bool flag=false;
        for(i=1;i<=n;i++)
        {
             if(i==1 || attack[i].time - attack[i-1].time>=10)
              {
              	reduce=t;
                if(reduce<=attack[i].damage)
                {
                	m-=(attack[i].damage-reduce);
					reduce=0;
                }
                else
                	reduce-=attack[i].damage;     	
              }
              else
              {
               if(reduce<attack[i].damage)
               {
               	m-=(attack[i].damage-reduce);
					reduce=0;
               } 	
               else
               	reduce-=attack[i].damage;
              }
            if(m<=0)
            {
                flag=true;
                break;
            }
        }
        if(flag)
            printf("I'm dead!\n");
        else
            printf("%d\n",m );
    }
    return 0;
}


你可能感兴趣的:(NOJ [1455] Malphite)