poj 2993 Emag eht htiw Em Pleh（模拟）

题目：http://poj.org/problem?id=2993

题意：和2996反着

#include <iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
using namespace std;

struct node
{
    int x,y;
    char ch;
}q[1000];
bool cmp(node a,node b)
{
    if(a.x!=b.x) return a.x>b.x;
    return a.y<b.y;
}

int main()
{
    int sum=0,i,j,t=0;
    char c,a,b,d;

    scanf("White:");
    while(scanf("%c",&c)&&c!='\n')
    {
        cin>>a>>b;
        if(b>='a'&&b<='z')
        {
            cin>>d;
            q[sum].ch=a; q[sum].x=d-48; q[sum++].y=b-97;
        }
        else
        {
            q[sum].ch='P'; q[sum].x=b-48; q[sum++].y=a-97;
        }
    }
    scanf("Black:");
    while(scanf("%c",&c)&&c!='\n')
    {
        cin>>a>>b;
        if(b>='a'&&b<='z')
        {
            cin>>d;
            q[sum].ch=a+32; q[sum].x=d-48; q[sum++].y=b-97;
        }
        else
        {
            q[sum].ch='p'; q[sum].x=b-48; q[sum++].y=a-97;
        }
    }
    sort(q,q+sum,cmp);
    for(i=8; i>=1; i--)
    {
        printf("+---+---+---+---+---+---+---+---+\n");
        for(j=0; j<8; j++)
        {
           if((i+j)%2==0) a='.';
           else a=':';
           if(q[t].x==i&&q[t].y==j&&t<sum)
           {printf("|%c%c%c",a,q[t].ch,a); t++;}
           else
           printf("|%c%c%c",a,a,a);
        }
        cout<<"|"<<endl;
    }
    printf("+---+---+---+---+---+---+---+---+\n");
    return 0;
}