QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#787785	#9521. Giving Directions in Harbin	CSQ^#	AC ✓	9ms	3624kb	C++17	1.1kb	2024-11-27 14:37:05	2024-11-27 14:37:08

Judging History

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

[2024-11-27 14:37:08]
评测

测评结果：AC
用时：9ms
内存：3624kb

查看

[2024-11-27 14:37:05]
提交

answer

#include <bits/stdc++.h>
using namespace std;
char dir[4] = {'N','E','S','W'};
int main()
{
    int t;
    cin>>t;
    while(t--){
        int n;
        cin>>n;
        char c;
        int d;
        int x = 0;
        int y = 0;
        for ( int i=0; i<n; i++ ) {
            cin >> c >> d;
            if ( c == 'N' ) y += d;
            if ( c == 'S' ) y -= d;
            if ( c == 'E' ) x += d;
            if ( c == 'W' ) x -= d;
        }
        if ( x == 0 && y == 0 ) {
            cout << "7 S\nZ 1\nR\nZ 1\nR\nZ 1\nR\nZ 1\n";
            continue;
        }
        if ( x == 0 ) {
            cout << "1 " << (y>0 ? "N":"S") << '\n';
            cout << "Z " << abs(y) << '\n';
        } else if ( y == 0 ) {
            cout << "1 " << (x>0 ? "E":"W") << '\n';
            cout << "Z " << abs(x) << '\n';
        } else {
            cout << "3" << ' ' << (y>0 ? "N":"S") << '\n';
            cout << "Z" << ' ' << abs(y) << '\n';
            cout << ((x>0)==(y>0) ? "R" : "L") << '\n';
            cout << "Z" << ' ' << abs(x) << '\n';
        }
    }



}

源文件, 语言: C++17

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

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3624kb

input:

output:

3 S
Z 2
L
Z 1

result:

ok ok (1 test case)

Test #2:

score: 0

Accepted

time: 0ms

memory: 3604kb

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 S
Z 7
L
Z 4
7 S
Z 1
R
Z 1
R
Z 1
R
Z 1
3 N
Z 14
R
Z 12
3 N
Z 7
L
Z 1
7 S
Z 1
R
Z 1
R
Z 1
R
Z 1
7 S
Z 1
R
Z 1
R
Z 1
R
Z 1
3 N
Z 18
L
Z 1
7 S
Z 1
R
Z 1
R
Z 1
R
Z 1
7 S
Z 1
R
Z 1
R
Z 1
R
Z 1
7 S
Z 1
R
Z 1
R
Z 1
R
Z 1
7 S
Z 1
R
Z 1
R
Z 1
R
Z 1
3 S
Z 3
L
Z 9
1 W
Z 10
7 S
Z 1
R
Z 1
R
Z 1
R
Z 1
3 S
Z 16
R...

result:

ok ok (99 test cases)

Test #3:

score: 0

Accepted

time: 9ms

memory: 3612kb

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
3 S
Z 21
R
Z 10
3 S
Z 10
L
Z 8
3 N
Z 7
L
Z 5
3 S
Z 4
L
Z 1
3 S
Z 4
L
Z 2
3 N
Z 16
L
Z 18
3 N
Z 1
L
Z 2
3 N
Z 13
R
Z 14
3 S
Z 5
R
Z 7
3 N
Z 2
L
Z 9
3 N
Z 13
L
Z 4
3 S
Z 29
R
Z 12
3 N
Z 2
R
Z 11
3 N
Z 1
R
Z 21
3 N
Z 7
R
Z 5
3 S
Z 9
R
Z 16
1 S
Z 7
3 S
Z 9
L
Z 5
1 N
Z 10
3 N
Z 9
R
Z 5
3 ...

result:

ok ok (10000 test cases)

Extra Test:

score: 0

Extra Test Passed