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 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:
- Start line - A single line: START
- 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.
- 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.
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
1 #include<iostream>
2 #include<cstdio>
3 #include<cstring>
4 #include<algorithm>
5 #include<vector>
6 #include<string>
7 #include<set>
8 #include<map>
9 #include<stack>
10 #include<queue>
11 using namespace std;
12 const int ms=4;
13 int screen[ms][ms];
14 string cover[ms][ms];
15 bool exist[10];
16 int id[10];
17 bool link[10][10];
18 int t;
19 string s;
20
21 void calc()
22 {
23 int k,i,j;
24 for(i=0;i<ms;i++)
25 for(j=0;j<ms;j++)
26 cover[i][j].erase();
27 for(k=1;k<=9;k++)
28 {
29 i=(k-1)/3;
30 j=(k-1)%3;
31 cover[i][j]+=char(k+‘0‘);
32 cover[i][j+1]+=char(k+‘0‘);
33 cover[i+1][j]+=char(k+‘0‘);
34 cover[i+1][j+1]+=char(k+‘0‘);
35 }
36 return ;
37 }
38
39 void init()
40 {
41 int i,j,k;
42 memset(exist,0,sizeof(exist));
43 memset(link,0,sizeof(link));
44 memset(id,0,sizeof(id));
45 t=0;
46 for(i=0;i<ms;i++)
47 for(j=0;j<ms;j++)
48 {
49 cin>>k;
50 screen[i][j]=k;
51 if(!exist[k])
52 t++;
53 exist[k]=true;
54 }
55 return;
56 }
57
58 void build()
59 {
60 int i,j,k;
61 for(i=0;i<ms;i++)
62 {
63 for(j=0;j<ms;j++)
64 {
65 for(k=0;k<cover[i][j].length();k++)
66 {
67 if(!link[screen[i][j]][cover[i][j][k]-‘0‘]&&screen[i][j]!=cover[i][j][k]-‘0‘)
68 {
69 id[cover[i][j][k]-‘0‘]++;
70 link[screen[i][j]][cover[i][j][k]-‘0‘]=true;
71 }
72 }
73 }
74 }
75 return ;
76 }
77 bool check()
78 {
79 int i,j,k;
80 for(k=0;k<t;k++)
81 {
82 i=1;
83 while(!exist[i]||(i<=9&&id[i]>0))
84 i++;
85 if(i>9)
86 return false;
87 exist[i]=false;
88 for(j=1;j<=9;j++)
89 if(exist[j]&&link[i][j])
90 id[j]--;
91 }
92 return true;
93 }
94 int main()
95 {
96 calc();
97 while(cin>>s)
98 {
99 if(s=="ENDOFINPUT")
100 break;
101 init();
102 build();
103 if(check())
104 cout<<"THESE WINDOWS ARE CLEAN"<<endl;
105 else
106 cout<<"THESE WINDOWS ARE BROKEN"<<endl;
107 cin>>s;
108 }
109 return 0;
110 }