QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#729402#9521. Giving Directions in HarbinDBsoleil#WA 1ms3844kbC++23849b2024-11-09 17:03:072024-11-09 17:03:07

Judging History

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

  • [2024-11-09 17:03:07]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3844kb
  • [2024-11-09 17:03:07]
  • 提交

answer

#include<bits/stdc++.h>
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;

const int N=1e5+5;
int n;
int dir;
int toi[N];
vector<int> ans;

pii input()
{
    char s[5];
    int d;
    scanf("%s%d",s,&d);
    return pii{toi[s[0]],d};
}

void output()
{
    printf("%d S\n",ans.size());
    for(int x:ans)
    {
        if(x>0) printf("%c\n",x==1?'L':'R');
        else printf("Z %d\n",-x);
    }
}

void solve()
{
    scanf("%d",&n);
    ans.clear();
    dir=0;
    for(int cs=1;cs<=n;cs++)
    {
        auto[vdir,d]=input();
        if(vdir!=dir) ans.pb((vdir-dir+4)%4),dir=vdir;
        ans.pb(-d);
    }
    output();
}

int main()
{
    toi['S']=0,toi['E']=1,toi['N']=2,toi['W']=3;
    int T=1;
    scanf("%d",&T);
    for(int cs=1;cs<=T;cs++) solve();
}

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 3816kb

input:

1
2
S 2
E 1

output:

3 S
Z 2
L
Z 1

result:

ok ok (1 test case)

Test #2:

score: -100
Wrong Answer
time: 1ms
memory: 3844kb

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:

8 S
L
Z 6
L
Z 1
L
Z 2
L
Z 8
16 S
R
Z 10
R
Z 1
R
Z 10
R
Z 2
L
Z 2
L
Z 2
L
Z 2
L
Z 1
18 S
R
Z 5
R
Z 4
L
Z 7
R
Z 6
R
Z 9
L
Z 8
L
Z 4
L
Z 6
R
Z 7
12 S
R
Z 6
R
Z 6
L
Z 8
L
Z 9
L
Z 7
L
Z 2
16 S
L
Z 6
R
Z 9
R
Z 5
L
Z 4
R
Z 6
R
Z 4
R
Z 5
L
Z 9
16 S
R
Z 6
L
Z 10
R
Z 6
L
Z 6
L
Z 6
L
Z 6
R
Z 6
L
Z 10
20 S
R
Z ...

result:

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