QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#692582	#9521. Giving Directions in Harbin	0123456789_1^#	AC ✓	6ms	3832kb	C++14	1.5kb	2024-10-31 14:44:18	2024-10-31 14:44:23

Judging History

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

[2024-10-31 14:44:23]
评测

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

查看

[2024-10-31 14:44:18]
提交

answer

#include<bits/stdc++.h>
using namespace std;
int main(){
    long T,n,i,x,y,d;
    char z;
    scanf("%ld\n",&T);
    while(T--){
        scanf("%ld\n",&n);
        x=y=0;
        for(i=1;i<=n;i++){
            scanf("%c %ld\n",&z,&d);
            if(z=='N'){
                y+=d;
            }else if(z=='E'){
                x+=d;
            }else if(z=='S'){
                y-=d;
            }else{
                x-=d;
            }
        }
        if(x==0){
            if(y==0){
                printf("7 N\nZ 1\nL\nZ 1\nL\nZ 1\nL\nZ 1\n");
            }else{
                if(y>0){
                    printf("1 N\nZ %ld\n",y);
                }else{
                    printf("1 S\nZ %ld\n",-y);
                }
            }
        }else{
            if(y==0){
                if(x>0){
                    printf("1 E\nZ %ld\n",x);
                }else{
                    printf("1 W\nZ %ld\n",-x);
                }
            }else{
                if(x>0){
                    if(y>0){
                        printf("3 E\nZ %ld\nL\nZ %ld\n",x,y);
                    }else{
                        printf("3 E\nZ %ld\nR\nZ %ld\n",x,-y);
                    }
                }else{
                    if(y>0){
                        printf("3 W\nZ %ld\nR\nZ %ld\n",-x,y);
                    }else{
                        printf("3 W\nZ %ld\nL\nZ %ld\n",-x,-y);
                    }
                }
            }
        }
    }
    return 0;
}

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: 3832kb

input:

output:

3 E
Z 1
R
Z 2

result:

ok ok (1 test case)

Test #2:

score: 0

Accepted

time: 0ms

memory: 3816kb

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 W
Z 9
L
...

result:

ok ok (99 test cases)

Test #3:

score: 0

Accepted

time: 6ms

memory: 3800kb

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