QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #706353 | #6699. Wandering Robot | futarian# | WA | 8ms | 3960kb | C++14 | 634b | 2024-11-03 10:47:43 | 2024-11-03 10:47:44 |
Judging History
answer
#include "bits/stdc++.h"
using namespace std;
const int Len = 2e5 + 5;
#define ll long long
int n,m,boha;
char s[Len];
inline int Iabs(int x){if(x < 0) x = -x;return x;}
signed main()
{
int T;scanf("%d",&T);
while(T --)
{
scanf("%d %d",&n,&m);
scanf("%s",s + 1);
int x = 0 , y = 0 , mx = 0 , rt = 0;
ll as = 0;
for(int i = 1 ; i <= n ; i ++)
{
if(s[i] == 'U') y ++;
else if(s[i] == 'D') y --;
else if(s[i] == 'L') x --;
else x ++;
mx = max(mx , Iabs(x) + Iabs(y));
}
rt = Iabs(x) + Iabs(y);
as += 1ll * (m - 1) * rt;
as += mx;
printf("%lld\n",as);
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3796kb
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: 8ms
memory: 3960kb
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 2821884982 463006533 1581485530 881213211 236693627 816980016 4406947601 1057578188 1455154265 4107693543 5705944723 3424946932 1154164548 4496114815 3733695266 6323077602 2262619671...
result:
wrong answer 12th numbers differ - expected: '2821884978', found: '2821884982'