QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#727537	#9521. Giving Directions in Harbin	klhwong	AC ✓	19ms	3604kb	C++17	1.5kb	2024-11-09 13:21:11	2024-11-09 13:21:11

Judging History

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

[2024-11-09 13:21:11]
评测

测评结果：AC
用时：19ms
内存：3604kb

查看

[2024-11-09 13:21:11]
提交

answer

#include <bits/stdc++.h>
#define eb emplace_back
using namespace std;



inline void work(){
    int n;
    cin >> n;
    char d;
    int x;
    char prev;
    vector<pair<char, int>> instructions(n);
    vector<pair<char, int>> harbin;
    cin >> d >> x;
    instructions[0] = make_pair(d, x);
    harbin.eb(make_pair(d, 0));
    harbin.eb(make_pair('Z', x));
    prev = d;
    for(int i = 1; i < n; i++){
        cin >> d >> x;
        if(prev=='S' && d=='E') {harbin.eb(make_pair('L', 0)); harbin.eb(make_pair('Z', x));}
        else if(prev=='S' && d=='W') {harbin.eb(make_pair('R', 0)); harbin.eb(make_pair('Z', x));}
        else if(prev=='N' && d=='E') {harbin.eb(make_pair('R', 0)); harbin.eb(make_pair('Z', x));}
        else if(prev=='N' && d=='W') {harbin.eb(make_pair('L', 0)); harbin.eb(make_pair('Z', x));}
        else if(prev=='E' && d=='N') {harbin.eb(make_pair('L', 0)); harbin.eb(make_pair('Z', x));}
        else if(prev=='E' && d=='S') {harbin.eb(make_pair('R', 0)); harbin.eb(make_pair('Z', x));}
        else if(prev=='W' && d=='N') {harbin.eb(make_pair('R', 0)); harbin.eb(make_pair('Z', x));}
        else if(prev=='W' && d=='S') {harbin.eb(make_pair('L', 0)); harbin.eb(make_pair('Z', x));}
        prev = d;
    }
    cout << (harbin.size() - 1) << " ";
    for(auto i: harbin){
        if(i.second==0) cout << i.first << endl;
        else cout << "Z " << i.second << endl;
    }
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int t;
    cin >> t;
    while(t--) work();
}

Source code, Language: C++17

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3604kb

input:

output:

3 S
Z 2
L
Z 1

result:

ok ok (1 test case)

Test #2:

score: 0

Accepted

time: 0ms

memory: 3544kb

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: 19ms

memory: 3512kb

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