QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#713361 | #9521. Giving Directions in Harbin | L_liu11# | AC ✓ | 7ms | 3644kb | C++17 | 1.6kb | 2024-11-05 19:08:35 | 2024-11-05 19:08:42 |
Judging History
answer
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<map>
#include<cmath>
#include<stack>
#include<queue>
#include<set>
//#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define N 200010
ll n, maxn,m,k;
char l;
ll r;
ll a[N];
ll sum;
set<ll>st;
char ch[N];
string s;
string t = "NESW";
void solve() {
cin >> k;
n = k;
int j = 1;
while (k--) {
cin >> l >> r;
ch[j] = l;
a[j] = r;
j++;
}
k = 0;
cout << 2 * n - 1 << " " << ch[1] << '\n';
cout << "Z " << a[1]<<"\n";
for (int i = 2; i <= n; i++) {
if (ch[i-1] == 'N' && ch[i] == 'E') {
cout << "R\n";
cout << "Z " << a[i] << '\n';
}
else if (ch[i - 1] == 'N' && ch[i] == 'W') {
cout << "L\n";
cout << "Z " << a[i] << '\n';
}
else if (ch[i - 1] == 'E' && ch[i] == 'N') {
cout << "L\n";
cout << "Z " << a[i] << '\n';
}
else if (ch[i - 1] == 'E' && ch[i] == 'S') {
cout << "R\n";
cout << "Z " << a[i] << '\n';
}
else if (ch[i - 1] == 'S' && ch[i] == 'E') {
cout << "L\n";
cout << "Z " << a[i] << '\n';
}
else if (ch[i - 1] == 'S' && ch[i] == 'W') {
cout << "R\n";
cout << "Z " << a[i] << '\n';
}
else if (ch[i - 1] == 'W' && ch[i] == 'S') {
cout << "L\n";
cout << "Z " << a[i] << '\n';
}
else if (ch[i - 1] == 'W' && ch[i] == 'N') {
cout << "R\n";
cout << "Z " << a[i] << '\n';
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
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: 3644kb
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: 1ms
memory: 3588kb
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: 7ms
memory: 3596kb
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