QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#612059#6699. Wandering Robotkevinyang#AC ✓11ms3596kbC++141.0kb2024-10-05 03:28:352024-10-05 03:28:37

Judging History

你现在查看的是最新测评结果

  • [2024-10-05 03:28:37]
  • 评测
  • 测评结果:AC
  • 用时:11ms
  • 内存:3596kb
  • [2024-10-05 03:28:35]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
#define int long long

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    int t;
    cin >> t;
    while(t--){
        int n,k;
        cin >> n >> k;
        string s;
        cin >> s;
        int ans = 0;
        int x = 0;
        int y = 0;
        for(int i = 0; i<n; i++){
            if(s[i] == 'R')x++;
            if(s[i] == 'L')x--;
            if(s[i] == 'U')y++;
            if(s[i] == 'D')y--;
            ans = max(ans,abs(x)+abs(y));
        }
        x*=k-1;
        y*=k-1;
        ans = max(ans,abs(x)+abs(y));
        for(int i = 0; i<n; i++){
            if(s[i] == 'R')x++;
            if(s[i] == 'L')x--;
            if(s[i] == 'U')y++;
            if(s[i] == 'D')y--;
            ans = max(ans,abs(x)+abs(y));
        }
        cout << ans << '\n';
    }
    return 0;
}

这程序好像有点Bug,我给组数据试试?

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 3532kb

input:

2
3 3
RUL
1 1000000000
D

output:

4
1000000000

result:

ok 2 number(s): "4 1000000000"

Test #2:

score: 0
Accepted
time: 11ms
memory: 3596kb

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:

ok 10307 numbers