Codeforces 631B Print Check (思维)

题目链接　Print Check

注意到行数加列数最大值只有几千，那么有效的操作数只有几千，那么把这些有效的操作求出来依次模拟就可以了。

 #include <bits/stdc++.h>

 using namespace std;

 #define rep(i,a,b)              for(int i(a); i <= (b); ++i)
 const int N     =          +       ;
 const int Q     =            +       ;

 struct node{
     int op, x, y;
 } a[N];

 int col[Q][Q];
 int v[N];    //v[i] = 1 则第i个操作需要被执行
 int c[][Q];
 int n, m, k, op, x, y;

 int main(){

     scanf("%d%d%d", &n, &m, &k);
     rep(i, , k){
         scanf("%d%d%d", &op, &x, &y);
         c[op][x] = i;
         a[i].op = op, a[i].x = x, a[i].y = y;
     }

     rep(i, , n) if (c[][i]) v[c[][i]] = ;
     rep(i, , m) if (c[][i]) v[c[][i]] = ;

     rep(i, , k) if (v[i]){
         if (a[i].op == ){
             rep(j, , m) col[a[i].x][j] = a[i].y;
         }
         else{
             rep(j, , n) col[j][a[i].x] = a[i].y;
         }
     }

     rep(i, , n){
         rep(j, , m) printf("%d ", col[i][j]);
         putchar();
     }

     return ;

 }