Exam 1 Character Recognition - Works Application 16

Character Recognition

Description

Character recognition is the conversion of images into text. For now we consider each character in the picture is a N*M matrix with only zeros and ones, and we need to recognize K characters. You are to write a program to find minimal number of pixels so that we can recognize each character .For example, we have only two characters ‘T’ and ‘L’, and the matrix size is 3*3, we can think ‘T’ and ‘L’ are 111 100 010 100 010 111 so we can recognize the character with only bottom-left pixel, the answer is 1.

Limits

-Memory limit per test: 256 megabytes
-Time limit per test: The faster the better

Compile & Environment

C++

g++ Main.cc –o Main –fno-asm –Wall –lm –static –std=c++0x –DONLINE_JUDGE

Java

J2SE8
Maximum stack size is 50m

Input

The first line of input is three integers N, M, K(1<=N,M<=10,2<=K<=6). Which represents the size of matrix and number of characters . Then is following K blocks, which represents the matrix. Notice that each block starts with a black line.

Output

You should output the minimum number of pixels, which is the answer.

Sample Test

Input

2 3 2
111
010
100
100

Output

1

Code

#include <stdio.h>
#include <iostream>
#include <vector>
#include <string>
#define MAX 101
//MAX 取决于 M*N

using namespace std;
vector<vector<int>> arr_num; //用来存放所有的组合可能
vector<string> vec;
int a[MAX] = {0};

//生成组合情况的函数,组合情况保存在arr中
void comb_number(int n, int r){
    if (r == 1){
        a[r - 1] = n;
        int j = 0;
        while (a[j] != 0){
            j++;
        }
        vector<int> tmp;
        for (int  i = j - 1; i >= 0; i--){
            tmp.push_back(a[i]);
        }
        arr_num.push_back(tmp);
    }
    else{
        a[r - 1] = n;
        for (int j = n - 1; j >= r - 1; j--){
            comb_number(j, r - 1);
        }
    }
}

void comb_str(vector<vector<string>> &str,int K){
    for(int i = 0; i < arr_num.size(); i++){
        vector<string> str_tmp;
        for (int j = 0; j < K; j++){
            string tmp;
            for (int m = 0; m < arr_num[0].size(); m++){
                tmp += vec[j][arr_num[i][m]-1];
            }
            str_tmp.push_back(tmp);
        }
        str.push_back(str_tmp);
    }
}

bool judge(vector<vector<string>> &str){
    for (int i = 0; i < str.size();i++){
        int flag = -1;
        vector<string> tmp(str[i]);
        for (int j = 0; j<str[0].size();j++){
            for (int k = 0;k < str[0].size(); k++){
                if (k==j){
                    continue;
                }
                else
                {
                    flag = (tmp[j]).compare(tmp[k]);
                }               
                if (flag == 0)
                    break;
            }
        }
        if (flag == -1)
            return true;
    }
    return false;
}

int main(){
    int N, M, K;
    cin >> N >> M >> K;

    //Input
    while (K--){
        string str;
        for (int i = 0; i<N; i++){
            string tmp;
            cin >> tmp;
            str += tmp;
        }
        vec.push_back(str);  //vec中存有所有字符的表达
    }
    //尝试所有可能 1 到 N*M的长度
    int len = 1;
    for (; len <= N*M; len++){
        arr_num.clear();
        for (int i = N*M; i >= len;i--){
            comb_number(i, len);
        }

        vector<vector<string>> str;
        comb_str(str,vec.size());
        if (judge(str))
            break;  
    }
    cout << len << endl;
    return 0;
}

0152bc39-710d-47f8-8995-bf99b2c21bde

f16aa9ba-64bb-4cf2-879e-a5df7f622134