How Much Memory Your Code Is Using? Gym - 101955J

https://cn.vjudge.net/problem/Gym-101955J 

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
//#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
//#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------
const int maxn=2050+9;
const int mod=1e9+7;

char s[maxn];
bool ch(char c)
{
    return c>='0'&&c<='9';
}
int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);


    int cas=0;
    int T;
    sfi(T);

    while(T--)
    {
        int n;
        sfi(n);
        getchar();
        ll ans=0;
        for(int i=0;i<n;i++)
        {
            gets(s);
            bool f=0;
            //printf("%s\n",s);
            int len=strlen(s);
            for(int j=0;j<len;j++)
            {
                if(s[j]=='[')
                {
                    f=1;
                    break;
                }
             }
            if(s[0]=='b')
            {
                if(f)
                {
                    int num=0;
                    int cnt=1;
                    for(int j=len-1;j>=0;j--)
                    {
                        if(s[j]==' ')break;
                        if(ch(s[j]))
                        {
                            num=num+(s[j]-'0')*cnt;
                            cnt*=10;
                        }
                    }
                    ans+=num;
                }
                else
                {
                    ans++;
                }
            }
            else if(s[0]=='c')
            {
                if(f)
                {
                    int num=0;
                    int cnt=1;
                    for(int j=len-1;j>=0;j--)
                    {
                        if(s[j]==' ')break;
                        if(ch(s[j]))
                        {
                            num=num+(s[j]-'0')*cnt;
                            cnt*=10;
                        }
                    }
                    ans+=num;
                }
                else ans++;
            }
            else if(s[0]=='i')
            {
                if(f)
                {
                    int num=0;
                    int cnt=1;
                    for(int j=len-1;j>=0;j--)
                    {
                        if(s[j]==' ')break;
                        if(ch(s[j]))
                        {
                            num=num+(s[j]-'0')*cnt;
                            cnt*=10;
                        }
                    }
                    ans+=num*4;
                }
                else
                {
                    ans+=4;
                }
            }
            else if(s[0]=='l'&&s[5]=='l')
            {
                if(f)
                {
                    int num=0;
                    int cnt=1;
                    for(int j=len-1;j>=0;j--)
                    {
                        if(s[j]==' ')break;
                        if(ch(s[j]))
                        {
                            num=num+(s[j]-'0')*cnt;
                            cnt*=10;
                        }
                    }
                    ans+=num*8;
                }
                else
                {
                    ans+=8;
                }
            }
            else if(s[0]=='_')
            {
                if(f)
                {
                    int num=0;
                    int cnt=1;
                    for(int j=len-1;j>=0;j--)
                    {
                        if(s[j]==' ')break;
                        if(ch(s[j]))
                        {
                            num=num+(s[j]-'0')*cnt;
                            cnt*=10;
                        }
                    }
                    ans+=num*16;
                }
                else
                {
                    ans+=16;
                }
            }
            else if(s[0]=='f')
            {
                if(f)
                {
                    int num=0;
                    int cnt=1;
                    for(int j=len-1;j>=0;j--)
                    {
                        if(s[j]==' ')break;
                        if(ch(s[j]))
                        {
                            num=num+(s[j]-'0')*cnt;
                            cnt*=10;
                        }
                    }
                    ans+=num*4;
                }
                else
                {
                    ans+=4;
                }
            }
            else if(s[0]=='d')
            {
                if(f)
                {
                    int num=0;
                    int cnt=1;
                    for(int j=len-1;j>=0;j--)
                    {
                        if(s[j]==' ')break;
                        if(ch(s[j]))
                        {
                            num=num+(s[j]-'0')*cnt;
                            cnt*=10;
                        }
                    }
                    ans+=num*8;
                }
                else
                {
                    ans+=8;
                }
            }
            else if(s[0]=='l'&&s[5]=='d')
            {
                if(f)
                {
                    int num=0;
                    int cnt=1;
                    for(int j=len-1;j>=0;j--)
                    {
                        if(s[j]==' ')break;
                        if(ch(s[j]))
                        {
                            num=num+(s[j]-'0')*cnt;
                            cnt*=10;
                        }
                    }
                    ans+=num*16;
                }
                else
                {
                    ans+=16;
                }
            }
        }
        //printf("%lf\n",(double)ans/(double)1024.0);
        printf("Case #%d: %I64d\n",++cas,ans/1024+((ans%1024)?1:0));
    }

    return 0;
}