QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #718096 | #9521. Giving Directions in Harbin | Rubt | WA | 0ms | 3640kb | C++14 | 785b | 2024-11-06 19:41:09 | 2024-11-06 19:41:09 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int N = 20;
int d[N];
char g[N];
int x[N];
// E S W N E S
// 1 2 3 4
char way[6] = { 'E', 'S', 'W', 'N', 'E', 'S' };
int main()
{
int t;
cin >> t;
while (t--)
{
int n, idx = 0;
cin >> n;
for (int i = 0; i < n; i++)
{
char k;
cin >> k >> x[i];
for (int j = 1; j < n; j++)
{
if (k == way[j])
d[i] = j;
}
}
g[0] = way[d[0]];
for (int i = 1; i < n; i++)
{
if (way[d[i]] == way[d[i - 1] - 1])
g[i] = 'L';
else if (way[d[i]] == way[d[i - 1] + 1])
g[i] = 'R';
}
cout << 2 * n - 1 << " ";
for (int i = 0; i < n; i++)
{
cout << g[i] << endl;
cout << 'Z' << " " << x[i] << endl;
}
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3640kb
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: 0ms
memory: 3636kb
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
result:
wrong answer Token parameter [name=g] equals to "~", doesn't correspond to pattern "[ZLR]" (test case 1)