QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#714023	#9521. Giving Directions in Harbin	SMTTY	AC ✓	6ms	3900kb	C++14	1.8kb	2024-11-05 21:16:33	2024-11-05 21:16:34

Judging History

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

[2024-11-05 21:16:34]
评测

测评结果：AC
用时：6ms
内存：3900kb

查看

[2024-11-05 21:16:33]
提交

answer

// #include<iostream>
// #include<algorithm>
// #include<cstring>
// #include<map>

// using namespace std;

// typedef pair<char, char> PCC;

// map<PCC, char> turn;

// void solve(){
//     int n, t, len;
//     scanf("%d", &n);
//     char last[2], now[2];
//     printf("%d ", 2 * n - 1);
//     n--;
//     scanf("%s%d", last, &t);
//     printf("%c\nZ %d\n", *last, t);
//     while (n -- ){
//         scanf("%s%d", now, &t);
//         printf("%c\nZ %d\n", turn[{*last, *now}], t);
//     }
// }

// int main(){
//     turn[{'N', 'W'}] = 'L';
//     turn[{'W', 'S'}] = 'L';
//     turn[{'S', 'E'}] = 'L';
//     turn[{'E', 'N'}] = 'L';
//     turn[{'N', 'E'}] = 'R';
//     turn[{'E', 'S'}] = 'R';
//     turn[{'S', 'W'}] = 'R';
//     turn[{'W', 'N'}] = 'R';
//     int _;
//     scanf("%d", &_);
//     while (_ -- ) solve();
// }
#include<iostream>
#include<algorithm>
#include<cstring>
#include<map>

using namespace std;

typedef pair<char, char> PCC;

map<PCC, char> turn;

void solve(){
    int n, t, len;
    scanf("%d", &n);
    int x = 0, y = 0, ans;
    while (n -- ){
        char s[2];
        int t;
        scanf("%s%d", s, &t);
        if (*s == 'N') y += t;
        else if (*s == 'S') y -= t;
        else if (*s == 'E') x += t;
        else x -= t;
    }
    if (x && y){
        printf("3 %c\nZ %d\n", x > 0 ? 'E' : 'W', abs(x));
        printf("%c\n", x * y > 0 ? 'L' : 'R');
        printf("Z %d\n", abs(y));
        return;
    }
    if (x != 0 || y != 0){
        if (x == 0) printf("1 %c\nZ %d\n", y > 0 ? 'N' : 'S', abs(y));
        else printf("1 %c\nZ %d\n", x > 0 ? 'E' : 'W', abs(x));
        return;
    }
    puts("7 N\nZ 1\nL\nZ 1\nL\nZ 1\nL\nZ 1\n");
    return;
}

int main(){
    int _;
    scanf("%d", &_);
    while (_ -- ) solve();
}

Source code, Language: C++14

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3900kb

input:

output:

3 E
Z 1
R
Z 2

result:

ok ok (1 test case)

Test #2:

score: 0

Accepted

time: 0ms

memory: 3760kb

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
7 N
Z 1
L
Z 1
L
Z 1
L
Z 1

3 E
Z 12
L
Z 14
3 W
Z 1
R
Z 7
7 N
Z 1
L
Z 1
L
Z 1
L
Z 1

7 N
Z 1
L
Z 1
L
Z 1
L
Z 1

3 W
Z 1
R
Z 18
7 N
Z 1
L
Z 1
L
Z 1
L
Z 1

7 N
Z 1
L
Z 1
L
Z 1
L
Z 1

7 N
Z 1
L
Z 1
L
Z 1
L
Z 1

7 N
Z 1
L
Z 1
L
Z 1
L
Z 1

3 E
Z 9
R
Z 3
1 W
Z 10
7 N
Z 1
L
Z 1
L
Z 1
L
Z 1

3 ...

result:

ok ok (99 test cases)

Test #3:

score: 0

Accepted

time: 6ms

memory: 3764kb

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

result:

ok ok (10000 test cases)

Extra Test:

score: 0

Extra Test Passed