>

#include <stdio.h>
#include <stdlib.h>

#define T1 1000
#define T2 100
#define NVEC 8

#define INF 66666
int Lasttime[10010];
int Clients;
int Empty[10010], Canmove[10010];
#define time(i, j) (Time - Lasttime[Cl[i][j]])

int vi[8] = {0, 0, -1, 1, 1, -1, 1, -1};
int vj[8] = {1, -1, 0 ,0, -1, 1, 1, -1};
#define ni (i + vi[v])
#define nj (j + vj[v])

int Cl[210][210], N, M;
int Time;

void read_and_solve()
{
    int i, j, x, v, fnd, Res = 0;
    char a;
    scanf("%d %d", &N, &M);
    Lasttime[0] = -INF;
    while (scanf("%d %c", &Time, &a) == 2)
    {
        if (a == 'v')
        {
            scanf("%d", &x);
            if (!Empty[x]) Lasttime[x] = Time;
            continue;
        }
        for (i = 1; i <= N; i++)
         for (j = 1; j <= M; j++)
         if (Cl[i][j] && (!Empty[Cl[i][j]] || !Canmove[Cl[i][j]]))
         {
             if (time(i, j) > T1) Empty[Cl[i][j]] = 1;
             for (v = 0; v < NVEC; v++)
                 if (ni > 0 && nj > 0 && ni <= N && nj <= M &&
                     Cl[ni][nj] && time(ni, nj) <= T2)
                     break;
             if (v == NVEC) Canmove[Cl[i][j]] = 1;
         }
        Lasttime[++Clients] = Time;
        for (fnd = 0, i = 1; !fnd && i <= N; i++)
         for (j = 1; !fnd && j <= M; j++)
          if (Cl[i][j] == 0 || (Empty[Cl[i][j]] && Canmove[Cl[i]
[j]]))
                 Cl[i][j] = Clients, fnd = 1;

        if (!fnd) Res++;
    }
    printf("%d\n", Res);
}

int main()
{
    read_and_solve();
    return 0;
}

> >