QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#683243 | #9521. Giving Directions in Harbin | wyssss | AC ✓ | 5ms | 3724kb | C++17 | 1.7kb | 2024-10-27 19:39:18 | 2024-10-27 19:39:20 |
Judging History
answer
#include <iostream>
#include <algorithm>
#include <set>
#include <queue>
#include <vector>
#include <cstring>
#include <numeric>
#include <cmath>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <string>
#define int long long
#define ll long long
#define pii pair<int,int>
#define piii pair<pii,int>
using namespace std;
const int inf = (1ll << 60) - 1 + (1ll << 60);
const int maxn = 2e5 + 5;
const int maxm = 2e5 + 5;
int dx[] = { 0,0,1,-1 }, dy[] = { 1,-1,0,0 };
void solve() {
int n;
cin >> n;
int x = 0, y = 0;
for (int i = 1; i <= n; i++) {
char c;
int t;
cin >> c >> t;
if (c == 'S')y -= t;
if (c == 'N')y += t;
if (c == 'E')x += t;
if (c == 'W')x -= t;
}
if (x == 0 && y == 0) {
cout << 7 << " N" << "\n";
cout << "Z 1" << "\n";
for (int i = 1; i <= 3; i++)cout << "R" << "\n" << "Z 1" << "\n";
}
else if (x == 0) {
cout << 1 << " ";
if (y > 0)cout << "N" << "\n";
else cout << "S" << "\n";
cout << "Z " << abs(y) << "\n";
}
else if (y == 0) {
cout << 1 << " ";
if (x > 0) cout << "E" << "\n";
else cout << "W" << "\n";
cout << "Z " << abs(x) << "\n";
}
else {
cout << 3 << " ";
if (y > 0)cout << "N" << "\n";
else cout << "S" << "\n";
cout << "Z " << abs(y) << "\n";
if (x * y > 0) cout << "R" << "\n";
else cout << "L" << "\n";
cout << "Z " << abs(x) << "\n";
}
}
signed main() {
ios::sync_with_stdio(0), cin.tie(0);
int T = 1;
cin >> T;
while (T--) {
solve();
}
return 0;
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3584kb
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: 3656kb
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 N Z 1 R Z 1 R Z 1 R Z 1 3 N Z 14 R Z 12 3 N Z 7 L Z 1 7 N Z 1 R Z 1 R Z 1 R Z 1 7 N Z 1 R Z 1 R Z 1 R Z 1 3 N Z 18 L Z 1 7 N Z 1 R Z 1 R Z 1 R Z 1 7 N Z 1 R Z 1 R Z 1 R Z 1 7 N Z 1 R Z 1 R Z 1 R Z 1 7 N Z 1 R Z 1 R Z 1 R Z 1 3 S Z 3 L Z 9 1 W Z 10 7 N Z 1 R Z 1 R Z 1 R Z 1 3 S Z 16 R...
result:
ok ok (99 test cases)
Test #3:
score: 0
Accepted
time: 5ms
memory: 3724kb
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