QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#780478	#9521. Giving Directions in Harbin	ucup-team093^#	WA	0ms	3820kb	C++20	1.5kb	2024-11-25 11:11:38	2024-11-25 11:11:39

Judging History

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

[2024-11-25 11:11:39]
评测

测评结果：WA
用时：0ms
内存：3820kb

查看

[2024-11-25 11:11:38]
提交

answer

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

using pci = pair<char, int>;

void solve() {
    int n, x = 0, y = 0;
    cin >> n;
    for(int i = 1; i <= n; i ++) {
        char c;
        int d;
        cin >> c >> d;
        if(c == 'N') y += d;
        else if(c == 'S') y -= d;
        else if(c == 'W') x -= d;
        else if(c == 'E') x += d;
    }
    if(x == 0 && y == 0) {
        cout << "1 E\nR\n";
        return;
    }
    if(x <= 0) {
        vector<pci> v;
        if(y < 0) {
            v.emplace_back('L', 0);
            v.emplace_back('Z', -y);
        }
        if(y > 0) {
            v.emplace_back('R', 0);
            v.emplace_back('Z', y);
        }
        cout << v.size() << " W\n";
        for(auto &[a, b] : v) {
            cout << a;
            if(a == 'Z') cout << " " << b;
            cout << "\n";
        }
    }else{
        vector<pci> v;
        v.emplace_back('Z', x);
        if(y < 0) {
            v.emplace_back('R', 0);
            v.emplace_back('Z', -y);
        }
        if(y > 0) {
            v.emplace_back('L', 0);
            v.emplace_back('Z', y);
        }
        cout << v.size() << " E\n";
        for(auto &[a, b] : v) {
            cout << a;
            if(a == 'Z') cout << " " << b;
            cout << "\n";
        }
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int T;
    cin >> T;
    while(T --) {
        solve();
    }
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3512kb

input:

output:

3 E
Z 1
R
Z 2

result:

ok ok (1 test case)

Test #2:

score: -100

Wrong Answer

time: 0ms

memory: 3820kb

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:

3 E
Z 4
R
Z 7
1 E
R
3 E
Z 12
L
Z 14
2 W
R
Z 7
1 E
R
1 E
R
2 W
R
Z 18
1 E
R
1 E
R
1 E
R
1 E
R
3 E
Z 9
R
Z 3
0 W
1 E
R
2 W
L
Z 16
2 W
R
Z 4
3 E
Z 5
R
Z 7
1 E
R
1 E
R
3 E
Z 3
R
Z 12
1 E
R
2 W
L
Z 9
1 E
R
3 E
Z 8
R
Z 8
2 W
L
Z 8
1 E
R
1 E
R
1 E
R
3 E
Z 9
L
Z 5
1 E
R
2 W
R
Z 10
1 E
R
1 E
R
2 W
L
Z 5
3 E
...

result:

wrong answer Should start with `Z` (test case 2)