1 solutions

  • 0
    @ 2025-11-5 15:15:00

    C++ :

    #include <iostream>
    #include <cstdio>
    #include <cstdlib>
    #include <algorithm>
    #include <cstring>
    #include <malloc.h>
    using namespace std;
    int main()
    {
        char a[30]={0};
        while(gets(a))
        {
            int i=0,tmp=0,flag=0,s=0,rtmp=0,f=0;
            while(a[i]!=0)
            {
                if(tmp=='Q' && f==1) s+=200,f=0;
                if(rtmp=='Q') s+=160,rtmp=0;
                if(a[i]=='Q') s+=200,tmp='Q',f=1;
                if(a[i]=='W') s+=400,tmp='W';
                if(a[i]=='E')
                {
                    if(flag==0) s+=300,flag=1,tmp='E';
                    else s+=300,flag=0;
                }
                if(a[i]=='R')
                {
                    if(rtmp=='E') {s+=240,rtmp=0,i++;continue;}
                    if(tmp=='Q') s+=160,rtmp='Q',tmp='R';
                    if(tmp=='W') s+=320,rtmp='W',tmp='R';
                    if(tmp=='E') s+=240,rtmp='E',tmp='R';
                }
                i++;
            }
            printf("%d\n",s);
            memset(a,0,30);
        }
    }
    
    
    • 1

    Information

    ID
    16568
    Time
    1000ms
    Memory
    128MiB
    Difficulty
    (None)
    Tags
    # Submissions
    0
    Accepted
    0
    Uploaded By