UVA - 11205 The broken pedometer （子集生成）

侵删。出处： http://blog.csdn.net/u01338239
uva 11205 The Broken Pedometer（经典的子集生成题目，在此总结了三种子集生成的方法~） by charkj_z

题目大意：给出 N 个长度为 P 由 0/1 组成的字符串，问至少几位能把这些字符串区分开。

解题思路：子集生成。

• 增量构造法：
  Memory: 0 KB
  Time: 20 MS

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
int map[110][20];
int vis[20];
int N, P, ans;
bool ok(int cur) {
    for (int i = 0; i < N; i++)
        for (int j = i+1; j < N; j++) {
            int tag = 1;
            for (int k = 0; k < cur; k++)
                if (map[i][vis[k]] != map[j][vis[k]]) {
                    tag = 0;
                    break;
                }
            if (tag) return false;
        }
    return true;
}
void subset(int cur) {
    if (ans > cur && ok(cur)) ans = cur;
    int s = cur ? vis[cur-1]+1 : 0;
    for (int i = s; i < P; i++) {
        vis[cur] = i;
        subset(cur+1);
    }
}
int main() {
    int T;
    scanf("%d", &T);
    while (T--) {
        memset(vis, false, sizeof(vis));
        scanf("%d%d", &P, &N);
        for (int i = 0; i < N; i++)
            for (int j = 0; j < P; j++)
                scanf("%d", &map[i][j]);

        ans = P;
        subset(0);
        printf("%d\n", ans);
    }
return 0;
}

• 位向量法：
  Memory: 0 KB
  Time: 170 MS

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
int map[110][20];
char s[110][20];
bool vis[20];
int N, P, ans;
void subset(int cur) {
    if (cur == P) {
        int cnt = 0;
        for (int i = 0; i < N; i++)
            for (int j = 0; j < P; j++)
                if (vis[j]) {
                    cnt++;
                    s[i][j] = map[i][j] + '0';
                }
                else s[i][j] = '0';
        for (int i = 0; i < N ; i++)
            s[i][P] = 0;
        for (int i = 0; i < N-1; i++)
            for (int j = i+1; j < N; j++)
                if (!strcmp(s[i], s[j])) return;
        if (ans > cnt/N)
            ans = cnt/N;
        return;
    }
    vis[cur] = false;
    subset(cur+1);
    vis[cur] = true;
    subset(cur+1);
    return;
}
int main() {
    int T;
    scanf("%d", &T);
    while (T--) {
        memset(vis, false, sizeof(vis)); 
        scanf("%d%d", &P, &N);
        for (int i = 0; i < N; i++)
            for (int j = 0; j < P; j++)
                scanf("%d",&map[i][j]);
        ans = P;
        subset(0);
        printf("%d\n", ans);
    }
return 0;
}

• 二进制法
  Memory: 0 KB
  Time: 0 MS

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
int N, P, ans, tag;
bool vis[500000];
int s[110];
int main() {
    int T;
    scanf("%d", &T);
    while (T--) {
        memset(vis, true, sizeof(vis));
        scanf("%d%d", &P, &N);
        for (int i = 0; i < N; i++) {
            scanf("%d", &s[i]);
            for (int j = 1; j < P; j++) {
                int t;
                scanf("%d", &t);
                s[i] = s[i] * 2 + t;
            }
        }
        ans = P;
        for (int r = 0; r < (1<<P); r++) {
            tag = 1;
            int t;
            for (int i = 0; i < N; i++) {
                t = s[i] & r;
                if (vis[t]) vis[t] = false;
                else { tag = 0; break;}
            }
            if (tag) {
                int l = 0;
                for (int i = 0; i < P; i++)
                    if (r & 1 << i) l++;
                if (l < ans) {
                    ans = l;
                }
            }
            for (int i = 0; i < N; i++) {
                t = s[i] & r;
                vis[t] = true;
            }
        }
        printf("%d\n", ans);
    }
return 0;
}