poj1094 Sorting It All Out

poj1094
本题数据有bug，只需要输出第一个产生的答案不需要管后面的会不会产生矛盾。只需要用poj1270的思路即可。

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int n, m;
int g[30][30], in[30], tp[30], tot;
bool flag, flag1;
void dfs(int now){
    if(flag || flag1) return;
    if(now == n+1){
        tot++;
        if(tot>1) flag1 = 1;
        return;
    }
    int ok = 0;
    for(int i = 1; i <= n; i++){
        if(in[i] == 0){
            ok = 1;
            in[i] = -1;
            tp[now] = i;
            for(int j = 1; j <= n; j++)
                if(g[i][j]) in[j]--;
            dfs(now+1);
            in[i] = 0;
            for(int j = 1; j <= n; j++)
                if(g[i][j]) in[j]++;
        }
    }
    if(!ok){
        flag = 1;
        return;
    }
}
void work(){
    char c[10];
    while(scanf("%d%d", &n, &m)){
        if(n == 0 && m == 0) break;
        flag = 0;
        memset(in, 0, sizeof(in));
        memset(g, 0, sizeof(g));
        memset(tp, 0, sizeof(tp));
        for(int i = 1; i <= m; i++){
            scanf("%s", c);
            if(flag) continue;
            g[c[0]-'A'+1][c[2]-'A'+1] = 1;
            in[c[2]-'A'+1]++;
            //printf("%d %d\n", c[0]-'A'+1, c[2]-'A'+1);
            tot = 0;
            flag1 = 0;
            dfs(1);
            if(flag){
                printf("Inconsistency found after %d relations.\n", i);
                continue;
            }
            if(tot == 1){
                printf("Sorted sequence determined after %d relations: ", i);
                for(int i = 1; i <= n; i++)
                    printf("%c", 'A'-1+tp[i]);
                puts(".");
                flag = 1;
            }
        }
        if(!flag) puts("Sorted sequence cannot be determined.");
    }
}
int main(){
    work();
    return 0;
}