Untitled

#ifndef _CRT_SECURE_NO_WARNINGS
#define _CRT_SECURE_NO_WARNINGS
#endif

#include <stdio.h>

#define MAX_N 20

extern void init(int N, int mMap[MAX_N][MAX_N]);
extern int numberOfCandidate(int M, int mStructure[]);
extern int maxBlockedRobots(int M, int mStructure[], int mDir);

#define CMD_INIT 100
#define CMD_CANDI 200
#define CMD_BLOCKED 300

static bool run()
{
    int query_num;
    scanf("%d", &query_num);

    int ans;
    bool ok = false;

    for (int q = 0; q < query_num; q++)
    {
        int query;
        scanf("%d", &query);
        if (query == CMD_INIT)
        {
            int N;
            int mMap[MAX_N][MAX_N];
            scanf("%d", &N);
            for (int i = 0; i < N; i++){
                for (int j = 0; j < N; j++){
                    scanf("%d", &mMap[i][j]);
                }
            }
            init(N, mMap);
            ok = true;
        }
        else if (query == CMD_CANDI)
        {
            int M;
            int mStructure[5];
            scanf("%d", &M);
            for (int i = 0; i < M; i++){
                    scanf("%d", &mStructure[i]);
            }
            int ret = numberOfCandidate(M, mStructure);
            scanf("%d", &ans);
            if (ans != ret)
            {
                ok = false;
            }
        }
        else if (query == CMD_BLOCKED)
        {
            int M;
            int mStructure[5];
            int mDir;            
            scanf("%d", &M);
            for (int i = 0; i < M; i++){
                    scanf("%d", &mStructure[i]);
            }
            scanf("%d", &mDir);
            int ret = maxBlockedRobots(M, mStructure, mDir);
            scanf("%d", &ans);
            if (ans != ret)
            {
                ok = false;
            }
        }
    }
    return ok;
}

int main()
{
    setbuf(stdout, NULL);
    // freopen("sample_input.txt", "r", stdin);
    int T, MARK;
    scanf("%d %d", &T, &MARK);

    for (int tc = 1; tc <= T; tc++)
    {
        int score = run() ? MARK : 0;
        printf("#%d %d\n", tc, score);
    }
    return 0;
}


#define MAX_N 20

void init(int N, int mMap[MAX_N][MAX_N])
{

}

int numberOfCandidate(int M, int mStructure[])
{
    return 0;
}

int maxBlockedRobots(int M, int mStructure[], int mDir)
{
    return 0;
}



25 100
10
100 6
1 2 1 5 5 5
3 1 3 1 1 5
1 4 5 5 5 5
2 1 1 1 4 5
1 4 5 5 5 5
3 2 3 4 1 2
200 3 4 3 4 2
300 5 1 5 1 3 5 0 17
200 3 1 1 1 9
300 3 5 2 3 1 19
300 2 1 4 2 25
200 2 5 2 8
200 5 2 5 5 5 4 1
200 5 1 2 1 2 1 0
300 2 1 4 3 14