UVA-401 Palindromes

#include <iostream>
#include <stdlib.h>
#include <string>
#include <vector>
#include <algorithm>
#include <string.h>
#include <stack>
#include <unordered_map>
#include <math.h>
using namespace std;

string msgList[4] {"not a palindrome.","a regular palindrome.","a mirrored string.","a mirrored palindrome."};
string reverseList = {"A   3  HIL JM O   2TUVWXY51SE Z  8 "};
int main()
{
    string input;
    while(cin >> input)
    {
        int isPalindrome = 1,isMirrored = 1;
        int lo,hi;
        for(lo = 0,hi = input.size()-1; lo < hi; lo ++,hi --)
        {
            if(input[lo]!=input[hi])
            {
                isPalindrome = 0;
                break;
            }
        }
        
        for(lo = 0,hi = input.size()-1; lo <= hi; lo ++,hi --)
        {
            if(isalpha(input[lo]))
            { 
                if(reverseList[input[lo]-'A'] != input[hi])
                {
                    isMirrored = 0;
                    break;
                }
            } 
            else
            { 
                if(reverseList[input[lo]-'0'+25] != input[hi])
                {
                    isMirrored = 0;
                    break;
                }
            } 
        }
        cout << input << " -- is " << msgList[isMirrored*2+isPalindrome] << endl << endl;
    }
    return 0;
}