QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#724747	#9521. Giving Directions in Harbin	Lisens^#	WA	2ms	3828kb	C++20	1.3kb	2024-11-08 14:53:01	2024-11-08 14:53:03

Judging History

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

[2024-11-08 14:53:03]
评测

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

查看

[2024-11-08 14:53:01]
提交

answer

#include<bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define ios ios::sync_with_stdio(false);cin.tie(0),cout.tie(0)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using db = double;
using pii = pair<int, int>;
using pll = pair<long long, long long>;

std::map<char, int> mp = {
    {'N', 1},
    {'E', 2},
    {'S', 3},
    {'W', 4}
};

void solve() {
    int n;
    std::cin >> n;
    std::vector<std::pair<char, int>> ans;
    char start, now, pre;
    int cnt;
    for (int i = 1; i <= n; i ++) {
        std::cin >> now >> cnt;
        if (i == 1) {
            start = now;
            pre = now;
        }

        if (mp[pre] - mp[now] == 0) {
            ans.push_back({'Z', cnt});
        }
        else if (mp[pre] - mp[now] == 1) {
            ans.push_back({'L', 0});
            ans.push_back({'Z', cnt});
        }
        else {
            ans.push_back({'R', 0});
            ans.push_back({'Z', cnt});
        }
        pre = now;
    }

    std::cout << ans.size() << " " << start << std::endl;
    for (auto &[l, r]: ans) {
        if (r == 0) std::cout << l << std::endl;
        else std::cout << l << " " << r << std::endl;
    }

}

signed main() {
    ios;
    int _ = 1;
    //cout << fixed << setprecision(2);
    cin >> _;
    while(_--) 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: 3828kb

input:

output:

3 S
Z 2
L
Z 1

result:

ok ok (1 test case)

Test #2:

score: -100

Wrong Answer

time: 2ms

memory: 3596kb

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

result:

wrong answer Wrong destination (test case 1)