QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#685597	#9521. Giving Directions in Harbin	yxd^#	AC ✓	8ms	3812kb	C++14	2.5kb	2024-10-28 20:22:02	2024-10-28 20:22:03

Judging History

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

[2024-10-28 20:22:03]
评测

测评结果：AC
用时：8ms
内存：3812kb

查看

[2024-10-28 20:22:02]
提交

answer

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e6+10;
int a[N];
signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);

    int t;
    cin >> t;
    while (t--) {
        int n;cin>>n;
        vector<pair<char,int>>res;
        char to;
        for(int i=1;i<=n;i++){
            char a;
            int x;cin>>a>>x;
            if(i==1) {
                to = a;
                res.push_back({a, x});
                res.push_back({'Z',x});
            }else {
                if (to == 'N') {
                    if (a == 'N') {
                        res.push_back({'Z', x});
                    } else if (a == 'E') {
                        res.push_back({'R', 0});
                        res.push_back({'Z', x});
                    } else if (a == 'W') {
                        res.push_back({'L', 0});
                        res.push_back({'Z', x});
                    }
                } else if (to == 'S') {
                    if (a == 'S')
                        res.push_back({'Z', x});
                    else if (a == 'E') {
                    res.push_back({'L', 0});
                    res.push_back({'Z', x});
                } else if (a == 'W') {
                    res.push_back({'R', 0});
                    res.push_back({'Z', x});
                }
                }else if(to=='W'){
                    if(a=='W')
                        res.push_back({'Z',x});
                    else if(a=='N'){
                        res.push_back({'R',0});
                        res.push_back({'Z', x});
                    }else if(a=='S'){
                        res.push_back({'L',0});
                        res.push_back({'Z', x});
                    }
                }else{
                    if(a=='E')
                        res.push_back({'Z',x});
                    else if(a=='N'){
                        res.push_back({'L',0});
                        res.push_back({'Z', x});
                    }else if(a=='S'){
                        res.push_back({'R',0});
                        res.push_back({'Z', x});
                    }
                }
                to=a;
            }
        }
        cout<<res.size()-1<<" "<<res[0].first<<'\n';
        for(int i=0;i<res.size();i++){
            if(i==0)continue;
            if(res[i].second==0)
                cout<<res[i].first<<'\n';
            else
                cout<<res[i].first<<" "<<res[i].second<<'\n';
        }
    }
}

源文件, 语言: C++14

这程序好像有点Bug，我给组数据试试？

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3532kb

input:

output:

3 S
Z 2
L
Z 1

result:

ok ok (1 test case)

Test #2:

score: 0

Accepted

time: 1ms

memory: 3812kb

input:

99
4
E 6
N 1
W 2
S 8
8
W 10
N 1
E 10
S 2
E 2
N 2
W 2
S 1
9
N 5
E 4
N 7
E 6
S 9
E 8
N 4
W 6
N 7
6
N 6
E 6
N 8
W 9
S 7
E 2
8
E 6
S 9
W 5
S 4
W 6
N 4
E 5
N 9
8
N 6
W 10
N 6
W 6
S 6
E 6
S 6
E 10
10
N 7
W 3
N 5
W 5
S 8
W 10
N 6
E 9
N 8
E 8
8
W 9
N 10
E 6
S 10
E 9
S 10
W 6
N 10
4
W 5
N 1
E 5
S 1
4
W 4
S 8...

output:

7 E
Z 6
L
Z 1
L
Z 2
L
Z 8
15 W
Z 10
R
Z 1
R
Z 10
R
Z 2
L
Z 2
L
Z 2
L
Z 2
L
Z 1
17 N
Z 5
R
Z 4
L
Z 7
R
Z 6
R
Z 9
L
Z 8
L
Z 4
L
Z 6
R
Z 7
11 N
Z 6
R
Z 6
L
Z 8
L
Z 9
L
Z 7
L
Z 2
15 E
Z 6
R
Z 9
R
Z 5
L
Z 4
R
Z 6
R
Z 4
R
Z 5
L
Z 9
15 N
Z 6
L
Z 10
R
Z 6
L
Z 6
L
Z 6
L
Z 6
R
Z 6
L
Z 10
19 N
Z 7
L
Z 3
R
Z 5
...

result:

ok ok (99 test cases)

Test #3:

score: 0

Accepted

time: 8ms

memory: 3616kb

input:

10000
1
W 9
1
N 3
10
W 10
N 7
W 5
S 9
W 9
S 8
E 9
S 6
E 5
S 5
2
E 8
S 10
2
N 7
W 5
5
S 4
W 3
S 7
E 4
N 7
8
N 7
E 8
N 3
E 9
S 5
W 5
S 9
W 10
9
W 9
S 6
E 6
N 8
W 5
N 6
W 3
N 8
W 7
3
S 9
W 2
N 10
5
N 6
E 4
N 6
E 10
N 1
10
S 7
W 4
N 3
E 5
S 7
W 8
N 2
E 8
N 4
W 8
8
S 9
W 1
N 4
E 6
N 1
W 8
N 6
W 6
4
W 10
...

output:

1 W
Z 9
1 N
Z 3
19 W
Z 10
R
Z 7
L
Z 5
L
Z 9
R
Z 9
L
Z 8
L
Z 9
R
Z 6
L
Z 5
R
Z 5
3 E
Z 8
R
Z 10
3 N
Z 7
L
Z 5
9 S
Z 4
R
Z 3
L
Z 7
L
Z 4
L
Z 7
15 N
Z 7
R
Z 8
L
Z 3
R
Z 9
R
Z 5
R
Z 5
L
Z 9
R
Z 10
17 W
Z 9
L
Z 6
L
Z 6
L
Z 8
L
Z 5
R
Z 6
L
Z 3
R
Z 8
L
Z 7
5 S
Z 9
R
Z 2
R
Z 10
9 N
Z 6
R
Z 4
L
Z 6
R
Z 10
L
...

result:

ok ok (10000 test cases)

Extra Test:

score: 0

Extra Test Passed