vector 3682 To Be an Dream Architect

#include <algorithm>
#include <cstring>
#include <cstdio>
#include <vector>
#include <set>

using namespace std;

vector<int>V;
int n, m;

int cal( char a, int num1, char b, int num2, int index )
{
    if( a=='Y' && b=='Z' )
    return index*n*n+num1*n+num2;
    if( a=='Z' && b=='Y' )
    return index*n*n+num2*n+num1;
    if( a=='X' && b=='Z' )
    return num1*n*n+index*n+num2;
    if( a=='Z' && b=='X' )
    return num2*n*n+index*n+num1;
    if( a=='X' && b=='Y' )
    return num1*n*n+num2*n+index;
    if( a=='Y' && b=='X' )
    return num2*n*n+num1*n+index;
}

int main()
{
    int i, j, k;
    int t, x, y;
    char c1, c2;
    scanf( "%d", &t );
    while( t-- )
    {
        V.clear();
        scanf( "%d%d", &n, &m );
        for( i=0;i<m;i++ )
        {
            scanf( " %c=%d,%c=%d", &c1, &x, &c2, &y );
            for( j=1;j<=n;j++ )
            V.push_back( cal( c1, x, c2, y, j ) );
        }
        sort( V.begin(), V.end() );
        V.erase( unique( V.begin(), V.end() ), V.end() );
        printf( "%d\n", V.size() );
    }
    return 0;
}