QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#680505#9521. Giving Directions in Harbinucup-team1113#AC ✓5ms3648kbC++171.6kb2024-10-26 21:17:372024-10-26 21:17:38

Judging History

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

  • [2024-10-26 21:17:38]
  • 评测
  • 测评结果:AC
  • 用时:5ms
  • 内存:3648kb
  • [2024-10-26 21:17:37]
  • 提交

answer

#include <bits/stdc++.h>
#define endl '\n'

using ll = long long;

constexpr int N = 2e5 + 10;
constexpr int mod = 998244353;

using namespace std;

map<char, pair<int, int>> dir;

void init() {
	dir['S'] = {1, 0};
	dir['N'] = {-1, 0};
	dir['W'] = {0, -1};
	dir['E'] = {0, 1};
}

void solve(){
	int n;
	cin >> n;
	int x = 0, y = 0;
	for (int i = 1; i <= n; ++i) {
		char ch;
		int t;
		cin >> ch >> t;
		auto [dx, dy] = dir[ch];
		x += t * dx, y += t * dy;
	}
	if (x == 0 && y == 0) {
		cout << "7 S" << endl;
		cout << "Z 1" << endl;
		cout << "L" << endl;
		cout << "Z 1" << endl;
		cout << "L" << endl;
		cout << "Z 1" << endl;
		cout << "L" << endl;
		cout << "Z 1" << endl;
		return; 
	}

	if (x == 0) {
		if (y < 0) {
			cout << 1 << " W" << endl; 
		}else {
			cout << 1 << " E" << endl;
		}
		cout << "Z " << abs(y) << endl;
		return;
	}

	if (y == 0) {
		if (x < 0) {
			cout << 1 << " N" << endl;
		}else {
			cout << 1 << " S" << endl;
		}
		cout << "Z " << abs(x) << endl;
		return;
	}

	cout << 3 << " ";
	if (x > 0) {
		cout << "S" << endl;
		cout << "Z " << abs(x) << endl;
		if (y > 0) cout << "L" << endl;
		else cout << "R" << endl;
		cout << "Z " << abs(y) << endl; 
	}else {
		cout << "N" << endl;
		cout << "Z " << abs(x) << endl;
		if (y > 0) cout << "R" << endl;
		else cout << "L" << endl;
		cout << "Z " << abs(y) << endl; 
	}

}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    init();
    int t = 1;
    cin >> t;
    while(t--) solve();
    return 0;
}

这程序好像有点Bug,我给组数据试试?

詳細信息

Test #1:

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

input:

1
2
S 2
E 1

output:

3 S
Z 2
L
Z 1

result:

ok ok (1 test case)

Test #2:

score: 0
Accepted
time: 0ms
memory: 3568kb

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:

3 S
Z 7
L
Z 4
7 S
Z 1
L
Z 1
L
Z 1
L
Z 1
3 N
Z 14
R
Z 12
3 N
Z 7
L
Z 1
7 S
Z 1
L
Z 1
L
Z 1
L
Z 1
7 S
Z 1
L
Z 1
L
Z 1
L
Z 1
3 N
Z 18
L
Z 1
7 S
Z 1
L
Z 1
L
Z 1
L
Z 1
7 S
Z 1
L
Z 1
L
Z 1
L
Z 1
7 S
Z 1
L
Z 1
L
Z 1
L
Z 1
7 S
Z 1
L
Z 1
L
Z 1
L
Z 1
3 S
Z 3
L
Z 9
1 W
Z 10
7 S
Z 1
L
Z 1
L
Z 1
L
Z 1
3 S
Z 16
R...

result:

ok ok (99 test cases)

Test #3:

score: 0
Accepted
time: 5ms
memory: 3648kb

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
3 S
Z 21
R
Z 10
3 S
Z 10
L
Z 8
3 N
Z 7
L
Z 5
3 S
Z 4
L
Z 1
3 S
Z 4
L
Z 2
3 N
Z 16
L
Z 18
3 N
Z 1
L
Z 2
3 N
Z 13
R
Z 14
3 S
Z 5
R
Z 7
3 N
Z 2
L
Z 9
3 N
Z 13
L
Z 4
3 S
Z 29
R
Z 12
3 N
Z 2
R
Z 11
3 N
Z 1
R
Z 21
3 N
Z 7
R
Z 5
3 S
Z 9
R
Z 16
1 S
Z 7
3 S
Z 9
L
Z 5
1 N
Z 10
3 N
Z 9
R
Z 5
3 ...

result:

ok ok (10000 test cases)

Extra Test:

score: 0
Extra Test Passed