对于 Testcase #2 在本地和 lg 在线 IDE 测试均通过。 提交记录
Testcase #2

          a           asdfghjkl    a     qwertyuiop  zxcvbnm yesterday once more yesterday once more yesterday once more yesterday once more yesterday once more yesterday once more yesterday once more

Answer

384

Code

#include<bits/stdc++.h>
using namespace std;
char s[20001];
long long ans=0,x;
int main(){
	cin.getline(s,1000001);
	int n=strlen(s);
	// cout << s[n - 1] << endl;
	// cout << (int)'\n' << endl;
	// cout << (int)'\r' << endl;
	for(int i=0;i<n;++i){
		//cout<<ans<<' ';
		if(s[i]==' '||s[i]=='#'||s[i]=='&'){
			ans++;
			continue;
		}
		x=s[i];
		x-=96;
		if(x==26){
			ans+=4;
			continue;
		}
		if(x<=18){
			x%=3;
			if(x==0) ans+=3;
			else ans+=x;
			continue;
		}
		else{
			if(x==19){
				ans+=4;
				continue;
			}
			x--;
			x%=3;
			if(x==0) ans+=3;
			else ans+=x;
		}
	}
	cout<<ans << endl;
}