Problem Solving►UVa

UVa 200 - Rare Order

Contents

  1. 1. Problem
  2. 2. Solution
  3. 3. Code

Problem

題目網址
中文網址
根據給的字串關係，排定字母順序。

Solution

邊做拓撲排序邊印出。

Code

UVa 200200 - Rare Order
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
//topological，記得要換行....
#include<cstdio>
#include<queue>
#define N 26
using namespace std;

int main()
{
    int i, j;
    bool adjM[N][N] = {}, one = true;
    char *str1 = new char[21], *str2 = new char[21];

    gets(str1);
    while (gets(str2) && str2[0] != '#')
    {
        one = false;
        for (i = 0; str1[i] == str2[i] && str1[i]; i++);

        if (str1[i] && str2[i])
            adjM[str1[i] - 'A'][str2[i] - 'A'] = true;

        //第二個換成前面的
        char *p = str1;
        str1 = str2;
        str2 = p;
    }

    if (!one)
    {
        bool used[N] = {};
        int ref[N] = {};//指向此點的邊
        queue < int > Q;
        for (i = 0; i < N; i++)
            for (j = 0; j < N; j++)
                if (adjM[i][j])
                {
            used[i] = used[j] = true;//記錄這兩點有被用到
            ref[j]++;//指向 j 的點增加
                }

        for (i = 0; i < N; i++)
            if (used[i] && !ref[i])
            {
            Q.push(i);
            break;
            }

        while (!Q.empty())
        {
            int next = Q.front();
            Q.pop();
            putchar('A' + next);
            for (i = 0; i < N; i++)
                if (used[i] && adjM[next][i])
                {
                ref[i]--;
                if (!ref[i])
                    Q.push(i);
                }
        }
    }
    else
        putchar(str1[0]);

    putchar('\n');

    return 0;
}