Frame Up
Consider the following five picture framesshown on an 9 x 8 array:
........ ........ ........ ........ .CCC....
EEEEEE.. ........ ........ ..BBBB.. .C.C....
E....E.. DDDDDD.. ........ ..B..B.. .C.C....
E....E.. D....D.. ........ ..B..B.. .CCC....
E....E.. D....D.. ....AAAA ..B..B.. ........
E....E.. D....D.. ....A..A ..BBBB.. ........
E....E.. DDDDDD.. ....A..A ........ ........
E....E.. ........ ....AAAA ........ ........
EEEEEE.. ........ ........ ........ ........
1 2 3 4 5
Now place all five picture frames on top ofone another starting with 1 at the bottom and ending up with 5 on top. If anypart of a frame covers another frame, it hides that part of the frame below.Viewing the stack of five frames we see the following.
.CCC...
ECBCBB..
DCBCDB..
DCCC.B..
D.B.ABAA
D.BBBB.A
DDDDAD.A
E...AAAA
EEEEEE..
Given a picture like this, determine theorder of the frames stacked from bottom to top.
Here are the rules for this challenge:
The width of the frame is always exactly 1character and the sides are never shorter than 3 characters.
It is possible to see at least one part ofeach of the four sides of a frame. A corner is part of two sides.
The frames will be lettered with capital letters,and no two frames will be assigned the same letter.
PROGRAM NAME: frameup
INPUT FORMAT
Line 1: Two space-separated integers: the height H (3 <= H <=30) and thewidth W (3 <= W <= 30).
Line 2..H+1: H lines, each with a string W characterswide.
SAMPLE INPUT (file frameup.in)
9 8
.CCC....
ECBCBB..
DCBCDB..
DCCC.B..
D.B.ABAA
D.BBBB.A
DDDDAD.A
E...AAAA
EEEEEE..
OUTPUT FORMAT
Print the letters of the frames in theorder they were stacked from bottom to top. If there are multiple possibilitiesfor an ordering, list all such possibilities -- in alphabetical order -- onsuccessive lines. There will always be at least one legal ordering.
SAMPLE OUTPUT (file frameup.out)
EDABC
心得:终于搞清楚top排序啦~~哇咔咔~~O(∩_∩)O~
WA :存答案的数组申请小了。。各种RE啊。。。下次一定要申请大点
/*
ID:
PROG: frameup
LANG: C++
*/
#include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
#define MAXN 35
string stand[26]={"A","B","C","D","E","F","G","H","I","J","K","L","M","N","O","P","Q","R","S","T","U","V","W","X","Y","Z"};
struct node0
{
int num;
int key[26];
}relate[26];
int father[26];
struct node1
{
int xmin,ymin,xmax,ymax;
bool used;
}cube[26];
char map[MAXN][MAXN];
int h,w,lans=0;
string str,ans[6000];
int n=0;
int cross[26][26];
bool had[26];
void clearit()
{
for(int i=0;i<26;i++)
{
cube[i].xmax=-1;
cube[i].ymax=-1;
cube[i].xmin=MAXN;
cube[i].ymin=MAXN;
relate[i].num=0;
memset(relate[i].key,0,sizeof(relate[i].key));
father[i]=0;
cube[i].used=false;
had[i]=false;
}
memset(cross,0,sizeof(cross));
}
void init()
{
clearit();
freopen("frameup.in","r",stdin);
freopen("frameup.out","w",stdout);
scanf("%d %d",&h,&w);
getchar();
for(int i=1;i<=h;i++)
{
for(int j=1;j<=w;j++)
{
scanf("%c",&map[i][j]);
if ((map[i][j]>='A') && (map[i][j]<='Z'))
{
int temp=map[i][j]-'A';
if (i>cube[temp].xmax)
cube[temp].xmax=i;
if (i<cube[temp].xmin)
cube[temp].xmin=i;
if (j>cube[temp].ymax)
cube[temp].ymax=j;
if (j<cube[temp].ymin)
cube[temp].ymin=j;
cube[temp].used=true;
}
}
getchar();
}
// for(int i=0;i<6;i++)
// printf("%d %d %d %d\n",cube[i].xmin,cube[i].ymin,cube[i].xmax,cube[i].ymax);
}
void doit()
{
for(int i=0;i<26;i++)
if (cube[i].used)
{
n++;
had[i]=true;
for(int j=cube[i].xmin+1;j<=cube[i].xmax-1;j++)
{
int temp1=map[j][cube[i].ymin]-'A';
int temp2=map[j][cube[i].ymax]-'A';
if (temp1!=i)
{
bool flag=true;
for(int k=1;k<=relate[temp1].num;k++)
if (relate[temp1].key[k]==i)
{
flag=false;
break;
}
if (flag)
{
relate[temp1].num++;
relate[temp1].key[relate[temp1].num]=i;
if (cross[i][temp1]==0)
{
father[i]++;
cross[i][temp1]=1;
cross[temp1][i]==1;
}
}
}
if (temp2!=i)
{
bool flag=true;
for(int k=1;k<=relate[temp2].num;k++)
if (relate[temp2].key[k]==i)
{
flag=false;
break;
}
if (flag)
{
relate[temp2].num++;
relate[temp2].key[relate[temp2].num]=i;
if (cross[temp2][i]==0)
{
father[i]++;
cross[temp2][i]=1;
cross[i][temp2]=1;
}
}
}
}
for(int j=cube[i].ymin;j<=cube[i].ymax;j++)
{
int temp1=map[cube[i].xmin][j]-'A';
int temp2=map[cube[i].xmax][j]-'A';
if (temp1!=i)
{
bool flag=true;
for(int k=1;k<=relate[temp1].num;k++)
if (relate[temp1].key[k]==i)
{
flag=false;
break;
}
if (flag)
{
relate[temp1].num++;
relate[temp1].key[relate[temp1].num]=i;
if (cross[temp1][i]==0)
{
father[i]++;
cross[temp1][i]=1;
cross[i][temp1]=1;
}
}
}
if (temp2!=i)
{
bool flag=true;
for(int k=1;k<=relate[temp2].num;k++)
if (relate[temp2].key[k]==i)
{
flag=false;
break;
}
if (flag)
{
relate[temp2].num++;
relate[temp2].key[relate[temp2].num]=i;
if (cross[i][temp2]==0)
{
father[i]++;
cross[i][temp2]=1;
cross[temp2][i]=1;
}
}
}
}
}
// for(int i=0;i<26;i++)
// if (had[i])
// printf("%d\n",father[i]);
}
void tail(int k,int s)
{
if (k>s)
{
lans++;
// ans[lans]=str;
}
else
for(int i=0;i<26;i++)
if (had[i])
{
had[i]=false;
string temp=str;
str=stand[i]+str;
tail(k+1,s);
str=temp;
}
}
void find(int p,int s)
{
string words=str;
had[p]=false;
str=stand[p]+str;
if (s==n)
{
lans++;
ans[lans]=str;
}
else
{
for(int i=1;i<=relate[p].num;i++)
father[relate[p].key[i]]--;
for(int i=0;i<26;i++)
if ((father[i]==0)&&(had[i]))
find(i,s+1);
for(int i=1;i<=relate[p].num;i++)
father[relate[p].key[i]]++;
}
str=words;
had[p]=true;
}
void makeit()
{
str.clear();
for(int i=0;i<26;i++)
if ((father[i]==0)&&(had[i]))
find(i,1);
}
void outit()
{
for(int i=1;i<=lans;i++)
cout<<ans[i]<<endl;
}
int min(int x,int y)
{
if (x<y)
return x;
else
return y;
}
bool cmp(string x,string y)
{
for(int i=0;i<min(x.size(),y.size());i++)
{
if (x[i]==y[i])continue;
else
return(x[i]<y[i]);
}
}
int main()
{
init();
doit();
makeit();
//printf("%d\n",lans);
sort(ans+1,ans+1+lans,cmp);
outit();
return 0;
}
Compiling...
Compile: OK
Executing...
Test 1: TEST OK [0.000 secs, 3060 KB]
Test 2: TEST OK [0.000 secs, 3060 KB]
Test 3: TEST OK [0.011 secs, 3060 KB]
Test 4: TEST OK [0.011 secs, 3060 KB]
Test 5: TEST OK [0.011 secs, 3060 KB]
Test 6: TEST OK [0.000 secs, 3060 KB]
Test 7: TEST OK [0.000 secs, 3060 KB]
Test 8: TEST OK [0.086 secs, 3060 KB]
Test 9: TEST OK [0.281 secs, 3192 KB]
All tests OK.
Your program ('frameup') produced allcorrect answers! This is your
submission #7 for this problem. Congratulations!
Here are the test data inputs:
------- test 1 -------
9 8
.CCC....
ECBCBB..
DCBCDB..
DCCC.B..
D.B.ABAA
D.BBBB.A
DDDDAD.A
E...AAAA
EEEEEE..
------- test 2 -------
3 3
AAA
A.A
AAA
------- test 3 -------
5 7
AAA.CCC
A.A.C.C
AABBBCC
..B.B..
..BBB..
------- test 4 -------
11 8
UUUUU...
U...U...
U...EEEE
U...E..E
UMMMM..E
UMUUMEEE
.MJJJJJJ
.MJ.M..J
.MJ.M..J
.MJMM..J
..JJJJJJ
------- test 5 -------
6 9
AAABBBCCC
AQAQQQCQC
AAABBBCCC
XQXYYYZQZ
XQQYQYQQZ
XXXYYYZZZ
------- test 6 -------
20 20
AAABCDEFGHIJKLMNOPQR
A.ABCDEFGHIJKLMNOPQR
AAABCDEFGHIJKLMNOPQR
BBBBCDEFGHIJKLMNOPQR
CCCCCDEFGHIJKLMNOPQR
DDDDDDEFGHIJKLMNOPQR
EEEEEEEFGHIJKLMNOPQR
FFFFFFFFGHIJKLMNOPQR
GGGGGGGGGHIJKLMNOPQR
HHHHHHHHHHIJKLMNOPQR
IIIIIIIIIIIJKLMNOPQR
JJJJJJJJJJJJKLMNOPQR
KKKKKKKKKKKKKLMNOPQR
LLLLLLLLLLLLLLMNOPQR
MMMMMMMMMMMMMMMNOPQR
NNNNNNNNNNNNNNNNOPQR
OOOOOOOOOOOOOOOOOPQR
PPPPPPPPPPPPPPPPPPQR
QQQQQQQQQQQQQQQQQQQR
RRRRRRRRRRRRRRRRRRRR
------- test 7 -------
30 30
...............OOOOO..........
...............O...O..........
...............O...O..........
...............O...O..........
...............O...O..........
...............O...O..........
...............O...O..........
EEEEEEEEEEEEEEEOEEEOEEEEEEEEEE
E..............OOOOO.........E
E............................E
EEIIUUUUUUUUUUUUUUUUUUUUUUUUEE
..I.U...I..............AAAAUA.
..I.U...I..............A...UA.
..I.U...I..............A...UA.
..I.UUUUUUUUUUUUUUUUUUUUUUUUA.
..I.....I..............A....A.
..I.....I..............A....A.
..I.....I..............AAAAAA.
..I.....I.....................
..I.....I.....................
..I.....I.....................
..IIIIIII.....................
..............................
..............................
..............................
..............................
..............................
..............................
..............................
..............................
------- test 8 -------
30 30
..............................
.OOOOOOOOOYYYYYOO.............
.O....PPPPYPPPYPOPP...........
.O....P...Y...Y.O.P...........
.O....P...Y...Y.O.P...........
.O....P...Y...Y.O.P...........
.O....P...Y...Y.O.P...........
.O....P...Y...Y.O.P...........
.O....P...Y...Y.O.P...........
.O....P...Y...Y.O.P...........
.OOOOOOOOOYOOOYOEEEEEEEEE.....
......PPPPYPPPYPEPP.....E.....
..........Y...Y.E.......E.....
..WWWWWWWWWWWWWWWWWTT...E.....
..W...T...Y...Y.E.W.T...E.....
..W...T...Y...Y.E.W.T...E.....
..W...T...Y...Y.E.W.T...E.....
..W...T...YYYYY.EEWEEEEEE.....
UUWWWWWWWWWWWWWWWWW.T.........
U.....TTTTTTTTTTTTQQQQQQQQQQQ.
U....RRRRRRRRRRRRRQRRRRR....Q.
U....R............Q....R....Q.
UIIIIRRRRRRRRRRRRRQRRRRRIIIIQ.
UI................QQQQQQQQQQQ.
UUUUUUUUUUUUUUUUUUU........I..
.IIIIIIIIIIIIIIIIIIIIIIIIIII..
..............................
..............................
..............................
..............................
------- test 9 -------
30 30
.DDDDRRRRQGGGGGGGGGGGGGQQQQQQ.
.DSSDRSSSQGSRSSSSS....G.....Q.
.D..DR...QG.R....SEEEEEEEEE.Q.
.D..DRTTOOGOOOOOOOEOOOGOOOEOOO
.D..DRT.OQG.R....SE...G...ETQO
.D..DRT.OIGFFFFFFFEFFFGIIIEIQO
.D..DRT.CCCCCCCCCSE..FG...EIQO
.D..DRT.CIGFR...CSE..FG...EIQO
.D..DRT.CIGFR...CMEMMFGMMMEIMO
.DBBBBBBBBBBBBBBBBBBBBBBBBEIMO
.DB.DRT.CIGFR...CSE..FG..BEIMO
.DBLDLLHCHGFHHLLCLELLFGLOBEIMO
.DBLDRTHCIGAAAA.CSE..FGL.BEIM.
.DBDDRTHCIGARHA.CSE..FGL.BEIM.
.SBL.RTHCIGARHA.CSE..FGL.BEIM.
.SBLLLLHCIGALHALCLEKKFGKKBEIM.
.SB..RTHCIGARHANCNENNFG.KBEIM.
.SB..RTHCIGARHANCSE..FG.KBEIM.
.SBBBBBBBBBABBABBBBBBBBBBBEIM.
.S...RTHCIGAFFAFCFEFFFG.K.EIM.
.S...RTHCIGAGGAGCGEGGGG.K.EIM.
.S...RTHCIJAJHANCQEEEEEEEEEIM.
.S...RTHCI.AJHANCSK..N..K..IM.
.PPPPPPHCIIAIHAICIIIIIIIIIIIM.
.P...RTHCHHAHHANCSKKKKKKKTTTM.
.P...R.JCCCAAAACCS...N......M.
.P...R.JJJJJJ..NMS...N......M.
.PSSSRSSSSSSRSSNMMMMMMMMMMMMM.
.P...RRRRRRRR..N.....N......P.
.PPPPPPPPPPPPPPNNNNNNNPPPPPPP.
Keep up the good work!
Thanks for your submission!