QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#692551	#9521. Giving Directions in Harbin	zime_www	WA	2ms	11432kb	C++14	946b	2024-10-31 14:41:37	2024-10-31 14:42:27

Judging History

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

[2024-10-31 14:42:27]
评测

测评结果：WA
用时：2ms
内存：11432kb

查看

[2024-10-31 14:41:37]
提交

answer

#include <bits/stdc++.h>

#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<string, int> PSI;
const double eps = 1e-6;
const int N = 2e5 + 5, mod = 1e9 + 7, MOD = 998244353;
int n, m;
PSI a[N];

string fg(string s) {
    if (s == "NE" || s == "ES" || s == "SW" || s == "WN")return "R";
    return "L";
}

void solve() {
    cin >> n;
    for (int i = 1; i <= n; ++i)cin >> a[i].fi >> a[i].se;
    cout << 2 * n - 1 << " " << a[1].fi << "\n";
    for (int i = 1; i <= 2 * n - 1; ++i) {
        if (i & 1)cout << "Z " << a[(i + 1) / 2].se << "\n";
        else cout << fg(a[i - 1].fi + a[i + 1].fi) << "\n";
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
    int tt = 1;
    cin >> tt;
    while (tt--) solve();
}

源文件, 语言: C++14

詳細信息

Test #1:

score: 100

Accepted

time: 2ms

memory: 11432kb

input:

output:

3 S
Z 2
L
Z 1

result:

ok ok (1 test case)

Test #2:

score: -100

Wrong Answer

time: 2ms

memory: 11404kb

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

result:

wrong answer Wrong destination (test case 3)