QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#700278	#9521. Giving Directions in Harbin	Forever_Young^#	WA	0ms	3932kb	C++23	849b	2024-11-02 12:36:42	2024-11-02 12:36:44

Judging History

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

[2024-11-02 12:36:44]
评测

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

查看

[2024-11-02 12:36:42]
提交

answer

#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define data dataa
using LL=long long;
using ULL=unsigned long long;
using LD=long double;
int get(char c)
{
    if(c=='N')return 0;
    else if(c=='E')return 1;
    else if(c=='S')return 2;
    else return 3;
}
int main()
{
    int T;
    for(scanf("%d",&T);T--;)
    {
        int n;
        scanf("%d",&n);
        int last;
        rep(i,n)
        {
            char s[2];int x;
            scanf("%s%d",s,&x);
            if(i==1)printf("%d %c\n",2*n-1,s[0]),last=get(s[0]);
            else
            {
                int tmp=get(s[0]);
                if(tmp==(last+1)%4)puts("R");else puts("L");
            }
            printf("Z %d\n",x);
        }
    }
    return 0;
}

Source code, Language: C++23

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3932kb

input:

output:

3 S
Z 2
L
Z 1

result:

ok ok (1 test case)

Test #2:

score: -100

Wrong Answer

time: 0ms

memory: 3928kb

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
R
Z 8
15 W
Z 10
R
Z 1
L
Z 10
L
Z 2
L
Z 2
R
Z 2
L
Z 2
L
Z 1
17 N
Z 5
R
Z 4
L
Z 7
R
Z 6
L
Z 9
R
Z 8
L
Z 4
L
Z 6
L
Z 7
11 N
Z 6
R
Z 6
L
Z 8
L
Z 9
L
Z 7
R
Z 2
15 E
Z 6
R
Z 9
L
Z 5
R
Z 4
L
Z 6
L
Z 4
L
Z 5
L
Z 9
15 N
Z 6
L
Z 10
L
Z 6
L
Z 6
L
Z 6
R
Z 6
L
Z 6
R
Z 10
19 N
Z 7
L
Z 3
L
Z 5
...

result:

wrong answer Wrong destination (test case 1)