QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #700708 | #9521. Giving Directions in Harbin | Murphy_ | WA | 1ms | 3672kb | C++11 | 643b | 2024-11-02 13:19:12 | 2024-11-02 13:19:38 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
char op[4]={'N','E','S','W'}; // 北东南西，顺时针
inline int check(char c){
for(int i=0;i<4;++i) if(op[i]==c) return i;
}
int main() {
int T,m,x,pre,nw;
char c;
cin>>T;
while(T--) {
cin>>m;
cin>>c>>x;
cout<<m*2-1<<' '<<c<<'\n';
cout<<'Z'<<' '<<x<<'\n';
pre=check(c);
m--;
while(m--) {
cin>>c>>x;
nw=check(c);
if((pre+1)%4==nw) cout<<'R'<<'\n';
else cout<<'L'<<'\n';
cout<<'Z'<<' '<<x<<'\n';
}
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3672kb
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: 3664kb
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)