QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#767804	#9521. Giving Directions in Harbin	wk6_	WA	0ms	5664kb	C++17	1.0kb	2024-11-20 22:13:53	2024-11-20 22:13:54

Judging History

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

[2024-11-20 22:13:54]
评测

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

查看

[2024-11-20 22:13:53]
提交

answer

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define inf 0x3f3f3f3f3f3f3f3f
#define PII pair<int, int>
const int N = 2e6 + 10;
int n,x[N];
char s[N];
void solve() {
	cin>>n;
	int cnt=0;
	char st;
	for(int i=1;i<=n;i++){
		cin>>s[i]>>x[i];
		if(i==1)st=s[1];
	}
	cnt=n+(n-1);
	cout<<cnt<<" "<<st<<endl;
	for(int i=1;i<=cnt;i++){
		if(i%2==1){
			if(i!=1)
			cout<<'Z'<<" "<<x[i-1]<<endl;
			else
				cout<<'Z'<<" "<<x[1]<<endl;
		}
		else{
		    if(s[i-1]=='S'){
				if(s[i]=='E')cout<<'L'<<endl;
				if(s[i]=='W')cout<<'R'<<endl;
			}
			if(s[i-1]=='N'){
				if(s[i]=='E')cout<<'R'<<endl;
				if(s[i]=='W')cout<<'L'<<endl;
			}
			if(s[i-1]=='E'){
				if(s[i]=='N')cout<<'L'<<endl;
				if(s[i]=='S')cout<<'R'<<endl;
			}
			if(s[i-1]=='W'){
				if(s[i]=='N')cout<<'R'<<endl;
				if(s[i]=='S')cout<<'L'<<endl;
			}
		}
	}
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	int _ = 1;
	cin >> _;
	while (_--){
		solve();
	}
	return 0;
}

Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 5596kb

input:

output:

3 S
Z 2
L
Z 1

result:

ok ok (1 test case)

Test #2:

score: -100

Wrong Answer

time: 0ms

memory: 5664kb

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

result:

wrong answer Same direction appears twice (test case 1)