题解 | 小红的回文串

#include <stdio.h>
#include <string.h>

int main(void) {
    int t;
    scanf("%d", &t);

    while (t--) {
        char ch[100005];
        scanf("%s", ch);
        int len = strlen(ch);
        int l = 0, r = len - 1;
        int v = 1;

        while (l <= r && v)
            if (ch[l] == ch[r])
                l++, r--;
            else if (r > 0 && ((ch[l] == 'w' && ch[r] == 'v' && ch[r - 1] == 'v') || (ch[l] == 'm' && ch[r] == 'n' && ch[r - 1] == 'n') || (ch[l] == 'm' && ch[r] == 'n' && ch[r - 1] == 'u') || (ch[l] == 'm' && ch[r] == 'u' && ch[r - 1] == 'n') || (ch[l] == 'm' && ch[r] == 'u' && ch[r - 1] == 'u')))
                l++, r -= 2;
            else if (l < len-1 && ((ch[l] == 'v' && ch[l + 1] == 'v' && ch[r] == 'w') || (ch[l] == 'n' && ch[l + 1] == 'n' && ch[r] == 'm') || (ch[l] == 'n' && ch[l + 1] == 'u' && ch[r] == 'm') || (ch[l] == 'u' && ch[l + 1] == 'n' && ch[r] == 'm') || ch[l] == 'u' && (ch[l + 1] == 'u' && ch[r] == 'm')))
                l += 2, r--;
            else if (((ch[l] == 'd' || ch[l] == 'q' || ch[l] == 'p' || ch[l] == 'b')) && ((ch[r] == 'd' || ch[r] == 'q' || ch[r] == 'p' || ch[r] == 'b')))
                l++, r--;
            else if ((ch[l] == 'n' && ch[r] == 'u') || (ch[r] == 'n' && ch[l] == 'u'))
                l++, r--;
            else{
                printf("NO\n");
                v = 0;
            }
        if(v)
            printf("YES\n");
    }
    return 0;
}