模拟赛DAY1 T1大美江湖

这就是一个模拟题，注意1234分别对应左右上下横坐标和纵坐标的判断就好了

题解：

需要注意的是，向上取整ceil函数是对于一个double值返回一个double值，也就是说在ceil里面的类型一定要是double，否则会炸

代码：

#include<cstdio>
#include<iostream>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<string>
#include<algorithm>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pr;
const double pi=acos(-);
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,n,a) for(int i=n;i>=a;i--)
#define Rep(i,u) for(int i=head[u];i;i=Next[i])
#define clr(a) memset(a,0,sizeof a)
#define pb push_back
#define mp make_pair
#define fi first
#define sc second
ld eps=1e-;
ll pp=;
ll mo(ll a,ll pp){if(a>= && a<pp)return a;a%=pp;if(a<)a+=pp;return a;}
ll powmod(ll a,ll b,ll pp){ll ans=;for(;b;b>>=,a=mo(a*a,pp))if(b&)ans=mo(ans*a,pp);return ans;}
int read(){
    int ans=;
    char last=' ',ch=getchar();
    while(ch<'' || ch>'')last=ch,ch=getchar();
    while(ch>='' && ch<='')ans=ans*+ch-'',ch=getchar();
    if(last=='-')ans=-ans;
    return ans;
}
int n,m;
char atlas[][];
int x,y;
int q;
struct part
{
    int hp,st,de;
}p,e;
inline void work(int x,int y)
{
    if(atlas[x][y]=='R')
    {
        p.hp-=;
        if(p.hp<) p.hp=;
    }
    if(atlas[x][y]=='Q')
    {
        p.st+=;
    }
    if(atlas[x][y]=='Y')
    {
        p.de+=;
    }
    if(atlas[x][y]=='M')
    {
        double m=double(e.hp)/double(max(,p.st-e.de));
        int k=ceil(m);
        p.hp+=max(,k*max(,e.st-p.de));
    }
}

int main()
{
    freopen("mzq.in","r",stdin);
    freopen("mzq.out","w",stdout);
    n=read(),m=read();
    rep(i,,n)
    {
        rep(j,,m+)
        {
            scanf("%c",&atlas[i][j]);
        }
    }
    e.hp=read(),e.st=read(),e.de=read();
    x=read(),y=read();
    p.st=read(),p.de=read();
    q=read();
    int c=,a=;
    rep(i,,q)
    {
        c=read();
        if(c==)
        {
            a=read();
            if(a==)
            {
                y-=;
                work(x,y);
            }
            if(a==)
            {
                y+=;
                work(x,y);
            }
            if(a==)
            {
                x-=;
                work(x,y);
            }
            if(a==)
            {
                x+=;
                work(x,y);
            }
        }
        if(c==)
        {
            printf("%d %d %d\n",p.hp,p.st,p.de);
        }
    }
    return ;
}