pojWindow Pains（拓撲排序）

標籤：des   style   http   color   os   io   strong   for   

題目連結：啊哈哈，點我點我
題意：
一快螢幕分很多地區，地區之間可以相互覆蓋，要覆蓋就把屬於自己的地方全部覆蓋。給出這塊螢幕最終的位置，看這塊螢幕是對的還是錯的。。
思路：
拓撲排序，這個簡化點說，就是說跟楚河漢界一樣，，分的清清楚楚，要麼這塊地方是我的，要麼這塊地方是你的，不純在一人一辦的情況，所以如果排序的時候出現了環，那麼就說這快螢幕是壞的。。。還有一點細節要注意的是第i個數字到底屬於第幾行第幾列，所以這個要發現規律，然後一一枚舉就可以了。。
題目：Window Pains

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 1588		Accepted: 792

Description

Boudreaux likes to multitask, especially when it comes to using his computer. Never satisfied with just running one application at a time, he usually runs nine applications, each in its own window. Due to limited screen real estate, he overlaps these windows and brings whatever window he currently needs to work with to the foreground. If his screen were a 4 x 4 grid of squares, each of Boudreaux‘s windows would be represented by the following 2 x 2 windows: 

1 1 . . 1 1 . . . . . . . . . .	. 2 2 . . 2 2 . . . . . . . . .	. . 3 3 . . 3 3 . . . . . . . .
. . . . 4 4 . . 4 4 . . . . . .	. . . . . 5 5 . . 5 5 . . . . .	. . . . . . 6 6 . . 6 6 . . . .
. . . . . . . . 7 7 . . 7 7 . .	. . . . . . . . . 8 8 . . 8 8 .	. . . . . . . . . . 9 9 . . 9 9

When Boudreaux brings a window to the foreground, all of its squares come to the top, overlapping any squares it shares with other windows. For example, if window 1and then window 2 were brought to the foreground, the resulting representation would be:

1 2 2 ? 1 2 2 ? ? ? ? ? ? ? ? ?

If window 4 were then brought to the foreground:

1 2 2 ? 4 4 2 ? 4 4 ? ? ? ? ? ?

. . . and so on . . . 
Unfortunately, Boudreaux‘s computer is very unreliable and crashes often. He could easily tell if a crash occurred by looking at the windows and seeing a graphical representation that should not occur if windows were being brought to the foreground correctly. And this is where you come in . . .

Input

Input to this problem will consist of a (non-empty) series of up to 100 data sets. Each data set will be formatted according to the following description, and there will be no blank lines separating data sets. 

A single data set has 3 components: 

1. Start line - A single line: 
   START 
   
   
2. Screen Shot - Four lines that represent the current graphical representation of the windows on Boudreaux‘s screen. Each position in this 4 x 4 matrix will represent the current piece of window showing in each square. To make input easier, the list of numbers on each line will be delimited by a single space. 
   
3. End line - A single line: 
   END 
   

After the last data set, there will be a single line: 
ENDOFINPUT 

Note that each piece of visible window will appear only in screen areas where the window could appear when brought to the front. For instance, a 1 can only appear in the top left quadrant.

Output

For each data set, there will be exactly one line of output. If there exists a sequence of bringing windows to the foreground that would result in the graphical representation of the windows on Boudreaux‘s screen, the output will be a single line with the statement: 

THESE WINDOWS ARE CLEAN 

Otherwise, the output will be a single line with the statement: 
THESE WINDOWS ARE BROKEN 

Sample Input

START1 2 3 34 5 6 67 8 9 97 8 9 9ENDSTART1 1 3 34 1 3 37 7 9 97 7 9 9ENDENDOFINPUT

Sample Output

THESE WINDOWS ARE CLEANTHESE WINDOWS ARE BROKEN

Source

South Central USA 2003
代碼為：

#include<cstdio>#include<iostream>#include<vector>#include<cstring>#include<queue>#include<algorithm>using namespace std;const int maxn=5+10;int map[maxn][maxn],in[maxn];queue<int>Q;vector<int>vec[maxn];int dx[]={0,0,1,1};int dy[]={0,1,0,1};int topo(){    int sum=9;    while(!Q.empty())  Q.pop();    for(int i=1;i<=9;i++)    {        if(in[i]==0)            Q.push(i);    }    while(!Q.empty())    {        int temp=Q.front();        Q.pop();        sum--;        for(int i=0;i<vec[temp].size();i++)        {            if(--in[vec[temp][i]]==0)                Q.push(vec[temp][i]);        }    }    if(sum>0)  return 0;    else    return 1;}void init(){    char str[10];    for(int i=1;i<=9;i++)    {        vec[i].clear();        in[i]=0;    }    for(int i=1;i<=9;i++)    {        int x=(i-1)/3+1;        int y=i%3==0?3:i%3;        for(int j=0;j<=3;j++)        {             int tx=x+dx[j];             int ty=y+dy[j];             if(map[tx][ty]!=i)             {                 vec[i].push_back(map[tx][ty]);                 in[map[tx][ty]]++;             }        }    }    scanf("%s",str);}void solve(){    int  ans=topo();    if(ans)        cout<<"THESE WINDOWS ARE CLEAN"<<endl;    else        cout<<"THESE WINDOWS ARE BROKEN"<<endl;}int main(){    char str[10];    while(~scanf("%s",str))    {        if(strcmp(str,"ENDOFINPUT")==0)  return 0;        for(int i=1;i<=4;i++)            for(int j=1;j<=4;j++)              scanf("%d",&map[i][j]);        init();        solve();    }    return 0;}