洛谷P1095 守望者的逃离

Amber0130

于 2019-02-07 07:39:27 发布

阅读量136

点赞数

本文链接：https://blog.csdn.net/weixin_43601103/article/details/86770340

版权

https://www.luogu.org/problemnew/show/P1095

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int m,s,t,x1,x2,i;
int main()
{
    scanf("%d%d%d",&m,&s,&t);
    for (i = 1; i <= t; i++)
    {
        if (m >= 10)
        {
            x1+=60;
            m-=10;
        }
        else
            m += 4;
        if (x1 > x2 + 17)
            x2 = x1;
        else
            x2 += 17;
        if (x2 >= s)
            break;
    }
    if (i > t)
        printf("No\n%d\n",x2);
    else
        printf("Yes\n%d\n",i);
}