ZOJ 3954 思维题

题意:已知七段灯abc...可以拼成1..9的所有的数字,(0代表灯亮,就是那种计算器的显示法) 然后给你任意n个数字和他们的01排列每一列都是不同的灯管 问这些排列是否合法

思路:对于任意n个数,他们的abcdef的编码(按列由上到下)是确定的,把这些编码变成一个数 然后塞入map 再把标准的编码塞入map2 看最后map map2是否相等
代码:

#include <iostream>
#include <cstdio>
#include <map>
#include <algorithm>
#include <cstring>
using namespace std;
const int maxn = 10;
int v[maxn][maxn];
int n;
void init()
{
    memset(v, 0, sizeof v);
    v[1][1] = v[1][3] = v[1][4] = v[1][6] = v[1][7] = 1;
    v[2][5] = v[2][6] = 1;
    v[3][3] = v[3][6] = 1;
    v[4][3] = v[4][4] = v[4][7] = 1;
    v[5][2] = v[5][3] = 1;
    v[6][2] = 1;
    v[7][1] = v[7][3] = v[7][4] = v[7][6] = 1;
    v[9][3] = 1;
}

int main()
{
    init();
    int Test;
    int num[maxn];
    char c[maxn][maxn];
    scanf("%d", &Test);
    while (Test--) {
        scanf("%d", &n);
        for (int i = 1; i <= n; ++i)
            scanf("%d%s", &num[i], c[i]);
        map<int, int> mp1, mp2;
        mp1.clear(); mp2.clear();
        for (int i = 1; i <= 7; ++i) {
            int temp1 = 0, temp2 = 0;
            for (int j = 1; j <= n; ++j) {
                temp1 = temp1 * 10 + c[j][i - 1] - '0';
                temp2 = temp2 * 10 + v[num[j]][i];
            }
            mp1[temp1]++;
            mp2[temp2]++;
        }
        if(mp1 == mp2) printf("YES\n");
        else printf("NO\n");
    }
    return 0;
}