QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#689021	#9521. Giving Directions in Harbin	xuaoxuaoxuao	AC ✓	9ms	3868kb	C++23	1.8kb	2024-10-30 14:54:44	2024-10-30 14:54:44

Judging History

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

[2024-10-30 14:54:44]
评测

测评结果：AC
用时：9ms
内存：3868kb

查看

[2024-10-30 14:54:44]
提交

answer

#include <bits/stdc++.h>
//#define int long long
#define endl "\n"
#define pi acos(-1)
#define ll long long
#define lowbit(x) ((x) & -(x))
#define ALL(v) v.begin(), v.end()
#define out(x) cerr << "|-> " << #x << " = " << (x) << " <-|" << endl
#define out2(x, y) cerr << "|-> " << #x << " = " << (x) << ", " << #y << " = " << (y) << " <-|" << endl 

using namespace std;

typedef vector<int> vi;
typedef vector<double> vd;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

const int N = 1e5 + 10;
const double eps = 1e-6;
const int mod = 998244353;
const int MOD = 1000000007;
const ll inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;

//char tur[4]={'N', 'E', 'S', 'W'};
map<char,int> mp;

void solve() {
	int n;
	cin>>n;
	
	int cnt=0;
	vector<string> ans;
	char ft=100;
	for(int i=0;i<n;i++)
	{
		char c;
		string d;
		cin>>c>>d;
		if(i==0)
		{
			string t1, t2;
			t1+=c;
			t2="Z ";
			t2+=d;
			ans.push_back(t1);
			ans.push_back(t2);
			ft=mp[c];
			cnt+=2;
		}
		else
		{
			char nt=mp[c];
			if((nt-ft+4)%4==1)
			{
				string t1, t2;
				t1="R";
				t2="Z ";
				t2+=d;
				ans.push_back(t1);
				ans.push_back(t2);
				cnt+=2;
			}
			else //if((nt-ft+4)%4==3)
			{
				string t1, t2;
				t1="L";
				t2="Z ";
				t2+=d;
				ans.push_back(t1);
				ans.push_back(t2);
				cnt+=2;
			}
			//else
			//{
			//	string t1, t2, t3;
			//	t1="R";
			//	t2="R";
			//	ans.push_back(t1);
			//	ans.push_back(t2);
			//	t3="Z ";
			//	t3+=d;
			//	ans.push_back(t3);
			//	cnt+=3;
			//}
			ft=nt;
		}
	}
	
	cout<<cnt-1<<' ';
	for(int i=0;i<cnt;i++)
	{
		cout<<ans[i]<<endl;
	}
}

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	
	int t = 1;
	cin >> t;
	
	mp['N']=0;
	mp['E']=1;
	mp['S']=2;
	mp['W']=3;
	
	while (t--) {
		solve();
	}
	
	return 0;
}

Source code, Language: C++23

这程序好像有点Bug，我给组数据试试？

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3788kb

input:

output:

3 S
Z 2
L
Z 1

result:

ok ok (1 test case)

Test #2:

score: 0

Accepted

time: 0ms

memory: 3564kb

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

result:

ok ok (99 test cases)

Test #3:

score: 0

Accepted

time: 9ms

memory: 3868kb

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

result:

ok ok (10000 test cases)

Extra Test:

score: 0

Extra Test Passed