QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #152594 | #6699. Wandering Robot | qzhwlzy | WA | 5ms | 3932kb | C++14 | 620b | 2023-08-28 13:28:23 | 2023-08-28 13:28:23 |
Judging History
answer
#include<iostream>
#include<cstdio>
#define maxn 100005
#define ll long long
using namespace std;
int T,n,k,u,d,l,r; ll x=0,y=0,ans=0; char a[maxn]; ll aabs(ll x){return x<0?-x:x;}
int main(){
scanf("%d",&T); while(T--){
scanf("%d%d\n%s",&n,&k,a+1); u=d=l=r=0;
for(int i=1;i<=n;i++) if(a[i]=='U') u++; else if(a[i]=='D') d++; else if(a[i]=='L') l++; else r++;
x=1LL*(r-l)*(k-1); y=1LL*(u-d)*(k-1); ans=aabs(x)+aabs(y); for(int i=1;i<=n;i++){
if(a[i]=='U') y++; else if(a[i]=='D') y--; else if(a[i]=='L') x--; else x++;
ans=max(aabs(x)+aabs(y),ans);
} printf("%lld\n",ans);
} return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 3852kb
input:
2 3 3 RUL 1 1000000000 D
output:
4 1000000000
result:
ok 2 number(s): "4 1000000000"
Test #2:
score: -100
Wrong Answer
time: 5ms
memory: 3932kb
input:
10307 33 374631889 RUDUUDLDDUULULDRDDRRRRDDDLRURULDL 9 40711970 UUDLRDRDD 3 111498848 LRL 14 804199874 LRRLLRULRUURUU 44 936610223 ULDRUULRRDLRRLRLRLRDUDDUDDUUDDLRUUDRUURLULUD 15 669124042 RUULRLDDULUDRDR 47 500758328 LRULULLLLUDURLRRDLDDLUUDURUDDLLLLDRLULURDULRDLU 18 581526184 DLLUDUUULUDULULRLR 47...
output:
1873159447 122135910 111498848 4825199244 3746440893 669124044 5508341608 4652209473 5606278385 8301130033 3707957881 2821884978 463006533 1581485530 881213211 236693627 816980016 4406947601 1057578188 1455154265 4107693543 5705944723 3424946932 1154164548 4496114815 3733695266 6323077602 2262619671...
result:
wrong answer 10306th numbers differ - expected: '49990', found: '25018'