提交时间:2024-10-04 15:11:14
运行 ID: 33134
#include<bits/stdc++.h> using namespace std; #define int long long string s; int k,ans; map<pair<int,int>,int> pot; signed main(){ //freopen("code.in","r",stdin); cin>>s;cin>>k; int nowx=0,nowy=0,nowans=0;ans=1;pot[make_pair(nowx,nowy)]=1; for(int i=1;i<=min((long long)50,k);i++){ nowans=0; for(int i=1;i<=s.size();i++){ if(s[i-1]=='U'){ nowy++; }if(s[i-1]=='D'){ nowy--; }if(s[i-1]=='L'){ nowx++; }if(s[i-1]=='R'){ nowx--; }if(!pot[make_pair(nowx,nowy)]){ nowans++; }pot[make_pair(nowx,nowy)]=1; }ans+=nowans; }for(int i=1;i<=k-50;i++){ ans+=nowans; } cout<<ans<<'\n'; }