QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#694819#9521. Giving Directions in HarbinQingTian#WA 1ms3596kbC++141.3kb2024-10-31 18:43:592024-10-31 18:43:59

Judging History

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

  • [2024-10-31 18:43:59]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3596kb
  • [2024-10-31 18:43:59]
  • 提交

answer

#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define debug(x) cerr << #x << " = " << x << endl
#define inf 0x3f3f3f3f3f3f3f3f
#define fi first
#define se second
#define endl "\n"

using namespace std;
const int N = 2e5 + 10;
const int MOD = 998244353;
int T = 1;

int n;

void solve(){
	using pci = pair<char, int>;
	vector<pci>v, ans;
	cin >> n;
	for (int i = 0; i < n; i ++){
		char c;
		int p;
		cin >> c >> p;
		v.pb({c, p});
	}
	char cur = v[0].fi;
	string h = "ENWS";
	map<char, int>mp;
	mp['E'] = 0;
	mp['N'] = 1;
	mp['W'] = 2;
	mp['S'] = 3;
	auto lf = [&](char c) -> char {
		int t = (mp[c] + 5) % 4;
		return h[t];
	};
	auto ri = [&](char c) -> char {
		return h[(mp[c] + 3) % 4];
	};
	for (auto [c, p] : v){
		if (cur == c){
			ans.pb({'Z', p});
		}
		else {
			if (c == lf(cur)){
				ans.pb({'L', 0});
			}
			else if (c == ri(cur)){
				ans.pb({'R', 0});
			}
			else{
				ans.pb({'L', 0});
				ans.pb({'L', 0});
			}
			ans.pb({'Z', p});
		}
	}
	cout << ans.size() << ' ' << v[0].fi << endl;
	for (auto [c, p] : ans){
		if (c == 'Z') cout << c << ' ' << p << endl;
		else cout << c << endl;
	}
}

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin >> T;
	while (T --){
		solve();
	}

	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 3596kb

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

result:

wrong answer Same direction appears twice (test case 1)