打了一半

#include <bits/stdc++.h>
using namespace std;
int n, m, k;

inline string read_string() {
    char ch = getchar();
    string s = "";
    while (ch >= 'A' && ch <= 'Z')
        s += ch, ch = getchar();
    return s;
}

inline int read_int() {
    int ret = 0;
    char ch = getchar();
    while (ch < '0' || ch > '9')
        ch = getchar();
    while (ch >= '0' && ch <= '9')
        ret = (ret << 3) + (ret << 1) + ch - '0', ch = getchar();
    return ret;
}

inline void print_string(const string &s) {
    int string_length = s.length();
    for (int i = 0; i < string_length; i++)
        putchar(s[i]);
}

void print_int(int x) {
    if (x > 9)
        print_int(x / 10);
    putchar(x % 10 + '0');
}

struct MOV {
    int h, z; 
};

struct SWA {
    int h, x, y;
};

struct MIR {
    int h, x;
};

struct REP {
    struct COMMEND *com;
    int h, x;
};

struct ACT {
    int h;
};

struct TRI {
    struct COM *com;
    string nam;
};

union CON {
    MOV mov;
    SWA swa;
    MIR mir;
    REP rep;
    ACT act;
    TRI tri;
};

struct COM {
   char typ;
   CON con;
};

COM a[100][10];

bool is_equal (const COM &a, const COM &b) {
    if (a.typ == b.typ)
        switch (a.type) {
            case 'n':
                return true;
            case 'm':
                return a.mov.h == b.mov.h && a.mov.z == b.mov.z;
            case 's':
                return a.swa.h == b.swa.h && a.swa.x == b.swa.x && a.swa.y == b.swa.y;
            case 'i':
                return a.mir.h == b.mir.h && a.mir.x == b.mir.x;
            case 'r':
                return a.rep.h == b.rep.h && a.rep.x == b.rep.x && is_equal(*(a.rep.com), *(b.rep.com));
            case 'a':
                return a.act.h == b.act.h;
            case 't':
                return a.tri.nam == b.tri.nam && is_equal(*(a.tri.com), *(b.tri.com));
        }
    return false;
}

int main() {
    n = read_int(), m = read_int(), k = read_int();
    /*for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            get_commend(i, j);
    */
    return 0;
}