Red Huang

Red Huang

uva 10024

I've been grinding for a long time, originally thought BFS could be used, but it would be troublesome to roll back, so I used DFS.

//  
//        GGGGGGGGGGGGG        CCCCCCCCCCCCC               AAA  
//     GGG::::::::::::G     CCC::::::::::::C              A:::A  
//   GG:::::::::::::::G   CC:::::::::::::::C             A:::::A  
//  G:::::GGGGGGGG::::G  C:::::CCCCCCCC::::C            A:::::::A  
// G:::::G       GGGGGG C:::::C       CCCCCC           A:::::::::A  
//G:::::G              C:::::C                        A:::::A:::::A  
//G:::::G              C:::::C                       A:::::A A:::::A  
//G:::::G    GGGGGGGGGGC:::::C                      A:::::A   A:::::A  
//G:::::G    G::::::::GC:::::C                     A:::::A     A:::::A  
//G:::::G    GGGGG::::GC:::::C                    A:::::AAAAAAAAA:::::A  
//G:::::G        G::::GC:::::C                   A:::::::::::::::::::::A  
// G:::::G       G::::G C:::::C       CCCCCC    A:::::AAAAAAAAAAAAA:::::A  
//  G:::::GGGGGGGG::::G  C:::::CCCCCCCC::::C   A:::::A             A:::::A  
//   GG:::::::::::::::G   CC:::::::::::::::C  A:::::A               A:::::A  
//     GGG::::::GGG:::G     CCC::::::::::::C A:::::A                 A:::::A  
//        GGGGGG   GGGG        CCCCCCCCCCCCCAAAAAAA                   AAAAAAA  
#include <iostream>  
#include <cstdio>  
#include <cstring>  
#include <algorithm>  
#include <cmath>  
#include <climits>  
#include <vector>  
#include <set>  
#include <map>  
#include <queue>  
#include <cctype>  
#include <utility>  
#include <ctime>  
using namespace std;  
#ifdef DEBUG  
#define debug(...) printf("DEBUG: "),printf(\_\_VA\_ARGS\_\_)  
#define gettime() end\_time=clock();printf("now running time is %.7f\\n",(float)(end\_time - start\_time)/CLOCKS\_PER\_SEC);  
#else  
#define debug(...)  
#define gettime()  
#endif  
typedef unsigned int uint;  
typedef long long int Int;  
#define Set(a,s) memset(a,s,sizeof(a))  
#define Write(w) freopen(w,"w",stdout)  
#define Read(r) freopen(r,"r",stdin)  
#define Pln() printf("\\n")  
#define I\_de(x,n)for(int i=0;i<n;i++)printf("%d ",x\[i\]);Pln()  
#define De(x)printf(#x"%d\\n",x)  
#define For(i,x)for(int i=0;i<x;i++)  
#define CON(x,y) x##y  
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\  
    printf("%d ",dp\[htx\]\[hty\]);}Pln();}  
#define M 10  
#define PII pair<int,int\>  
#define PB push\_back  
#define oo INT\_MAX  
#define Set\_oo 0x3f  
#define FOR(it,c) for(vector<PII>::iterator it=(c).begin();it!=(c).end();it++)  
#define eps 1e-6  
clock\_t start\_time=clock(), end\_time;  
bool xdy(double x,double y){return x>y+eps;}  
bool xddy(double x,double y){return x>y-eps;}  
bool xcy(double x,double y){return x<y-eps;}  
bool xcdy(double x,double y){return x<y+eps;}  
int min3(int x,int y,int z){  
    int tmp=min(x,y);  
    return min(tmp,z);  
}  
int max3(int x,int y,int z){  
    int tmp=max(x,y);  
    return max(tmp,z);  
}  
int mz\[M\]\[M\];  
int dix\[M\],diy\[M\];  
int dx\[\]={0,0,1,-1};  
int dy\[\]={1,-1,0,0};  
int side\[6\],tside\[6\];  
void roll(int dir){  
    if(dir==0){  
        side\[3\]=side\[1\];  
        side\[1\]=side\[0\];  
        side\[0\]=side\[4\];  
        side\[4\]=1;  
    }else if(dir==1){  
        side\[0\]=side\[1\];  
        side\[1\]=side\[3\];  
        side\[3\]=side\[4\];  
        side\[4\]=1;  
    }else if(dir==2){  
        side\[2\]=side\[1\];  
        side\[1\]=side\[5\];  
        side\[5\]=side\[4\];  
        side\[4\]=1;  
    }else if(dir==3){  
        side\[5\]=side\[1\];  
        side\[1\]=side\[2\];  
        side\[2\]=side\[4\];  
        side\[4\]=1;  
    }else return;  
}  
void dfs(int dir,int x,int y){  
    mz\[y\]\[x\]=-1;  
//    for(int i=0;i<6;i++){  
//        printf("%d ",side\[i\]);  
//    }printf(">> %d %d\\n",x,y);  
    for(int i=0;i<4;i++){  
        int nex=x+dx\[i\],ney=y+dy\[i\];  
        if(nex<0||nex>=6||ney<0||ney>=6)continue;  
        if(mz\[ney\]\[nex\]!=1)continue;  
        roll(i);  
        if(i==0||i==1)dfs(1-i,nex,ney);  
        if(i==2||i==3)dfs(5-i,nex,ney);  
    }  
    roll(dir);  
}  
void solve(){  
    Set(side,0);  
    side\[4\]=1;  
    dfs(-1,dix\[0\],diy\[0\]);  
    int all=0;  
    for(int i=0;i<6;i++){  
//        printf("%d ",side\[i\]);  
        all+=side\[i\];  
    }  
    printf("%s\\n",(all==6)?"correct":"incorrect");  
}  
int main() {  
    ios\_base::sync\_with\_stdio(0);  
    int test;  
    scanf("%d",&test);  
    while(test--){  
        int n=0;  
        for(int i=0;i<6;i++){  
            for(int j=0;j<6;j++){  
                scanf("%d",&mz\[i\]\[j\]);  
                if(mz\[i\]\[j\]){  
                    dix\[n\]=j;diy\[n\]=i;  
                    n++;  
                }  
            }  
        }  
        solve();  
        if(test)Pln();  
    }  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
}  

Loading...
Ownership of this post data is guaranteed by blockchain and smart contracts to the creator alone.