QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#695734	#9521. Giving Directions in Harbin	BlackSmith	AC ✓	10ms	3884kb	C++17	1.5kb	2024-10-31 20:40:53	2024-10-31 20:40:55

Judging History

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

[2024-10-31 20:40:55]
评测

测评结果：AC
用时：10ms
内存：3884kb

查看

[2024-10-31 20:40:53]
提交

answer

#include <bits/stdc++.h>
using namespace std;
#define int long long
constexpr int N = 1e3 + 3;
constexpr double pi = 3.14159265358979324;
int n, m, k, T;
vector<vector<int>> g(N);
vector<int> e(N, LLONG_MAX), d;
priority_queue<int>q[N];
set<double>st;
bitset<N>bt;
char s[N];
string ss[N];
void solve() {
    cin >> n;
    vector<pair<char, int>>v(n), g;
    for (auto &[x, y] : v)cin >> x >> y;
    g.push_back(make_pair('Z', v[0].second));
    for (int i = 1; i < v.size(); ++i) {
        if (v[i - 1].first == 'S') {
            if (v[i].first == 'E')g.push_back(make_pair('L', 0));
            else g.push_back(make_pair('R', 0));
        }
        else if(v[i-1].first == 'N'){
            if (v[i].first == 'E')g.push_back(make_pair('R', 0));
            else g.push_back(make_pair('L', 0));
        }
        else if(v[i-1].first == 'W') {
            if (v[i].first == 'N')g.push_back(make_pair('R',0));
            else g.push_back(make_pair('L',0));
        }
        else {
            if (v[i].first == 'N')g.push_back(make_pair('L',0));
            else g.push_back(make_pair('R',0));
        }
        g.push_back(make_pair('Z', v[i].second));
    }
    cout << g.size() << " " << v[0].first << "\n";
    for (auto [x, y] : g) {
        cout << x << " ";
        if (y)cout << y << "\n";
        else cout << "\n";
    }
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> T;
    while (T--)solve();
    return 0;
}

Source code, Language: C++17

这程序好像有点Bug，我给组数据试试？

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3684kb

input:

output:

3 S
Z 2
L 
Z 1

result:

ok ok (1 test case)

Test #2:

score: 0

Accepted

time: 0ms

memory: 3656kb

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...

result:

ok ok (99 test cases)

Test #3:

score: 0

Accepted

time: 10ms

memory: 3884kb

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 ...

result:

ok ok (10000 test cases)

Extra Test:

score: 0

Extra Test Passed