Cod sursa(job #1322605)

Utilizator horiainfoTurcuman Horia horiainfo Data 20 ianuarie 2015 10:32:53
Problema Perle Scor 10
Compilator cpp Status done
Runda Arhiva de probleme Marime 3.25 kb
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("perle.in");
ofstream fout("perle.out");
#define LG 10004
char a[LG];
int n;
bool look(char a[],int n,int inc)
{

    if(inc<0) inc=0;
    char aux;
    int i;
    char k[LG];

    if(n==1) return 1;

    for(i=inc;i<=3 && i<n;i++)
    {
        if(a[i]=='1' || a[i]=='2' || a[i]=='3')
        {
            aux=a[i];
            a[i]='A';
            if(look(a,n,0)==1) return 1;
            a[i]=aux;
        }
        if(a[i]=='2')
        {
            aux=a[i];
            a[i]='C';
            if(look(a,n,0)==1) return 1;
            a[i]=aux;
        }
        if(i>=1)
            if(a[i]=='B' && a[i-1]=='2')
            {
                a[i-1]='\0';
                strcpy(k,a);
                strcat(k,a+i);
                if(look(k,n-1,0)==1) return 1;
                a[i-1]='2';
            }
        if(i>=2)
            if(a[i]=='C' && a[i-1]=='B' && a[i-2]=='3')
            {
                a[i-2]='\0';
                strcpy(k,a);
                strcat(k,a+i);
                if(look(k,n-2,0)==1) return 1;
                a[i-2]='3';
            }
            else
            if(a[i]=='A' && a[i-1]=='2' && a[i-2]=='1')
            {
                a[i-2]='\0';
                strcpy(k,a);
                k[i-2]='C'; k[i-1]='\0';
                strcat(k,a+i+1);
                if(look(k,n-2,0)==1) return 1;
                a[i-2]='1';
            }
    }

    for(;i<n;i++)
    {
        if(a[i]=='1' || a[i]=='2' || a[i]=='3')
        {
            aux=a[i];
            a[i]='A';
            if(look(a,n,i-4)==1) return 1;
            a[i]=aux;
        }
        if(a[i]=='2')
        {
            aux=a[i];
            a[i]='C';
            if(look(a,n,i-4)==1) return 1;
            a[i]=aux;
        }
        else
        if(a[i]=='B' && a[i-1]=='2')
        {
            a[i-1]='\0';
            strcpy(k,a);
            strcat(k,a+i);
            if(look(k,n-1,i-1-4)==1) return 1;
            a[i-1]='2';
        }
        else
        if(a[i]=='C' && a[i-1]=='B' && a[i-2]=='3')
            {
                a[i-2]='\0';
                strcpy(k,a);
                strcat(k,a+i);
                if(look(k,n-2,i-2-4)==1) return 1;
                a[i-2]='3';
            }
        else
            if(a[i]=='A' && a[i-1]=='2' && a[i-2]=='1')
            {
                a[i-2]='\0';
                strcpy(k,a);
                k[i-2]='C'; k[i-1]='\0';
                strcat(k,a+i+1);
                if(look(k,n-2,i-2-4)==1) return 1;
                a[i-2]='1';
            }
            else
            if(a[i]=='C' && a[i-1]=='A' && a[i-2]=='3' && a[i-3]=='A' && a[i-4]=='1')
            {
                a[i-4]='\0';
                strcpy(k,a);
                k[i-4]='B'; k[i-3]='\0';
                strcat(k,a+i+1);
                if(look(k,n-4,i-4-4)==1) return 1;
                a[i-4]='1';
            }
    }

    return 0;
}
int main()
{
    int nrs; char sp;
    fin>>nrs;
    for(int i=1;i<=nrs;i++)
    {
        fin>>n;
        for(int i=0;i<n;i++)
            fin>>a[i];
        a[n]='\0';
        fout<<look(a,n,0)<<'\n';
    }
    return 0;
}