CodeForces 631B Print Check

对于每一个格子，看是行最后画还是列最后画。预处理一下就可以了。

#include<stdio.h>
#include<string.h>

int n,m,k;
int op[+];
int id[+];
int info[+];
int high[+];

int main()
{
    scanf("%d%d%d",&n,&m,&k);
    memset(high,-,sizeof high);

    for(int i=;i<=k;i++)
        scanf("%d%d%d",&op[i],&id[i],&info[i]);

    for(int i=k;i>=;i--)
    {
        int y;
        if(op[i]==) y=id[i];
        else y=id[i]+n;

        if(high[y]==-) high[y]=i;
    }

    for(int i=;i<=n;i++)
    {
        for(int j=;j<=m;j++)
        {
            if(high[i]==-&&high[j+n]==-) printf("0 ");
            else if(high[i]==-&&high[j+n]!=-) printf("%d ",info[high[j+n]]);
            else if(high[i]!=-&&high[j+n]==-) printf("%d ",info[high[i]]);
            else
            {
                if(high[i]>high[j+n]) printf("%d ",info[high[i]]);
                else printf("%d ",info[high[j+n]]);
            }
        }
        printf("\n");
    }
    return ;
}