[HDOJ5427]Cover

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5386

逆向思维，(初始状态没什么用。。)

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <queue>
#include <map>
#include <stack>
#include <list>
#include <vector>

using namespace std;

const int maxn = 111;
const int maxm = 505;

typedef struct Ord{
    int c, x, y;
};

int n, m;
int color[maxn][maxn];
int final[maxn][maxn];
int vis[1000010];
int ans[1000010];
Ord ord[1000010];

int main() {
    // freopen("in", "r", stdin);
    int T;
    char cmd[1];
    int x, y;
    scanf("%d", &T);
    while(T--) {
        memset(color, 0, sizeof(color));
        memset(final, 0, sizeof(final));
        memset(vis, 0, sizeof(vis));
        memset(ans, 0, sizeof(ans));
        scanf("%d %d", &n, &m);
        for(int i = 1; i <= n; i++) {
            for(int j = 1; j <= n; j++) {
                scanf("%d", &color[i][j]);
            }
        }
        for(int i = 1; i <= n; i++) {
            for(int j = 1; j <= n; j++) {
                scanf("%d", &final[i][j]);
            }
        }
        for(int i = 1; i <= m; i++) {
            scanf("%s %d %d", cmd, &x, &y);
            if(cmd[0] == 'H') {
                ord[i].c = 0;
                ord[i].x = x;
                ord[i].y = y;
            }
            else if(cmd[0] == 'L') {
                ord[i].c = 1;
                ord[i].x = x;
                ord[i].y = y;
            }
        }
        int cnt = 0;
        while(1) {
            for(int i = 1; i <= m; i++) {
                if(vis[i]) {
                    continue;
                }
                if(ord[i].c == 0) {  //H 
                    int k = ord[i].x;
                    int j;
                    for(j = 1; j <= n; j++) {
                        if(final[k][j] != 0 && final[k][j] != ord[i].y) {
                            break;
                        }
                    }
                    if(j == n + 1) {
                        for(j = 1; j <= n; j++) {
                            final[k][j] = 0;
                        }
                        ans[++cnt] = i;
                        vis[i] = 1;
                    }
                    if(cnt == m) {
                       break;
                    }
                }
                else if(ord[i].c == 1) {  //L
                    int k = ord[i].x;
                    int j;
                    for(j = 1; j <= n; j++) {
                        if(final[j][k] != 0 && final[j][k] != ord[i].y) {
                            break;
                        }
                    }
                    if(j == n + 1) {
                        for(j = 1; j <= n; j++) {
                            final[j][k] = 0;
                        }
                        ans[++cnt] = i;
                        vis[i] = 1;
                    }
                }
                if(cnt == m) {
                    break;
                }
            }
            if(cnt == m) {
                break;
            }
        }
        for(int i = cnt; i > 0; i--) {
            printf("%d ",ans[i]);
        }
        printf("
");
    }
    return 0;
}