QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#741811	#9521. Giving Directions in Harbin	mumu_sir^#	WA	0ms	3556kb	C++20	1.3kb	2024-11-13 15:16:17	2024-11-13 15:16:20

Judging History

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

[2024-11-13 15:16:20]
评测

测评结果：WA
用时：0ms
内存：3556kb

查看

[2024-11-13 15:16:17]
提交

answer

#include <bits/stdc++.h>
#define int long long
using namespace std;
#define YES "YES"
#define NO "NO"
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
const double eps = 1e-9;
const int N = 2e6 + 10;
const int M = 2e5 + 10;
const int INF = 1e16 + 100;
const int mod = 998244353;
const int base = 23333;
mt19937 rng(std::chrono::steady_clock::now().time_since_epoch().count());
pii node[N];
void solve()
{
    int n; cin >> n;
    map<char, int>mp;
    mp['N'] = 0;
    mp['E'] = 1;
    mp['S'] = 2;
    mp['W'] = 3;
    char opt;
    for(int i = 1;i <= n;i++){
        char ch; cin >> ch;
        if(i == 1) opt = ch;
        int x, y; cin >> y;
        x = mp[ch];
        node[i] = {x, y};
    }
    cout << n + n - 1 << " " << opt << "\n";
    int nowopt = mp[opt];
    for(int i = 1;i <= n;i++){
        int x = node[i].first, y = node[i].second;
        if(nowopt != x){
            if((nowopt + 1) % 4 == x)
                cout << "R\n";
            else
                cout << "L\n";
        }
        cout << "Z " << y << "\n";
    }
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--) solve();
    return 0;
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3552kb

input:

output:

3 S
Z 2
L
Z 1

result:

ok ok (1 test case)

Test #2:

score: -100

Wrong Answer

time: 0ms

memory: 3556kb

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

result:

wrong answer Wrong destination (test case 1)