QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#692183	#9521. Giving Directions in Harbin	ucup-team3519^#	AC ✓	6ms	3844kb	C++17	1.8kb	2024-10-31 13:59:41	2024-10-31 13:59:44

Judging History

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

[2024-10-31 13:59:44]
评测

测评结果：AC
用时：6ms
内存：3844kb

查看

[2024-10-31 13:59:41]
提交

answer

#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pi;
#define fi first
#define se second 
#define V vector
#define pb push_back

pi trans(char c) {
    if(c == 'N') return {-1, 0};
    if(c == 'S') return {1, 0};
    if(c == 'W') return {0, -1};
    return {0, 1};
}
pi operator+(pi a, pi b) {
    return {a.fi + b.fi, a.se + b.se};
}
pi operator*(pi a, int b) {
    return {a.fi * b, a.se * b};
}
void solve() {
    int n; cin >> n;
    pi pos = {};
    for(int i = 1; i <= n; i++) {
        char c; cin >> c;
        int x; cin >> x;
        pi now = trans(c);
        pos = pos + now * x;
    }
    V<string> ans;
    char st;
    bool hav_fi = 0;



    if(pos.fi < 0) {
        st = 'N';
        ans.pb("Z " + to_string(-pos.fi));
        hav_fi = 1;
    } else if(pos.fi > 0) {
        st = 'S';
        ans.pb("Z " + to_string(pos.fi));
        hav_fi = 1;
    }


    if(pos.se < 0) {
        if(!hav_fi) st = 'W';
        else {
            if(st == 'S') {
                ans.pb("R");
            } else ans.pb("L");
        }
        ans.pb("Z " + to_string(-pos.se));
    } else if(pos.se > 0) {
        if(!hav_fi) st = 'E';
        else {
            if(st == 'S') {
                ans.pb("L");
            } else ans.pb("R");
        }
        ans.pb("Z " + to_string(pos.se));
    }

    if(pos == pi{}) {
        cout << "7 N" << "\n";
        cout << "Z 1" << "\n";
        cout << "L" << "\n";

        cout << "Z 1" << "\n";
        cout << "L" << "\n";

        cout << "Z 1" << "\n";
        cout << "L" << "\n";

        cout << "Z 1" << "\n";
        return;
    }
    cout << ans.size() << " " << st << "\n";
    for(auto x : ans) cout << x << "\n";

}
int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int t; cin >> t;
    while(t--) solve();
}

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: 3820kb

input:

output:

3 S
Z 2
L
Z 1

result:

ok ok (1 test case)

Test #2:

score: 0

Accepted

time: 0ms

memory: 3844kb

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:

3 S
Z 7
L
Z 4
7 N
Z 1
L
Z 1
L
Z 1
L
Z 1
3 N
Z 14
R
Z 12
3 N
Z 7
L
Z 1
7 N
Z 1
L
Z 1
L
Z 1
L
Z 1
7 N
Z 1
L
Z 1
L
Z 1
L
Z 1
3 N
Z 18
L
Z 1
7 N
Z 1
L
Z 1
L
Z 1
L
Z 1
7 N
Z 1
L
Z 1
L
Z 1
L
Z 1
7 N
Z 1
L
Z 1
L
Z 1
L
Z 1
7 N
Z 1
L
Z 1
L
Z 1
L
Z 1
3 S
Z 3
L
Z 9
1 W
Z 10
7 N
Z 1
L
Z 1
L
Z 1
L
Z 1
3 S
Z 16
R...

result:

ok ok (99 test cases)

Test #3:

score: 0

Accepted

time: 6ms

memory: 3572kb

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
3 S
Z 21
R
Z 10
3 S
Z 10
L
Z 8
3 N
Z 7
L
Z 5
3 S
Z 4
L
Z 1
3 S
Z 4
L
Z 2
3 N
Z 16
L
Z 18
3 N
Z 1
L
Z 2
3 N
Z 13
R
Z 14
3 S
Z 5
R
Z 7
3 N
Z 2
L
Z 9
3 N
Z 13
L
Z 4
3 S
Z 29
R
Z 12
3 N
Z 2
R
Z 11
3 N
Z 1
R
Z 21
3 N
Z 7
R
Z 5
3 S
Z 9
R
Z 16
1 S
Z 7
3 S
Z 9
L
Z 5
1 N
Z 10
3 N
Z 9
R
Z 5
3 ...

result:

ok ok (10000 test cases)

Extra Test:

score: 0

Extra Test Passed