QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#780528	#9521. Giving Directions in Harbin	ucup-team093^#	AC ✓	6ms	3636kb	C++20	2.5kb	2024-11-25 11:24:32	2024-11-25 11:24:33

Judging History

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

[2024-11-25 11:24:33]
评测

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

查看

[2024-11-25 11:24:32]
提交

answer

#include <bits/stdc++.h>
using namespace std;

using pci = pair<char, int>;

void solve() {
    int n, x = 0, y = 0;
    cin >> n;
    for(int i = 1; i <= n; i ++) {
        char c;
        int d;
        cin >> c >> d;
        if(c == 'N') y += d;
        else if(c == 'S') y -= d;
        else if(c == 'W') x -= d;
        else if(c == 'E') x += d;
    }
    if(x == 0 && y == 0) {
        cout << "7 E\n";
        for(int i : {0, 0, 0, 1}) {
            cout << "Z 1\n";
            if(!i) cout << "R\n";
        }
        return;
    }
    if(x < 0) {
        vector<pci> v;
        v.emplace_back('Z', -x);
        if(y < 0) {
            v.emplace_back('L', 0);
            v.emplace_back('Z', -y);
        }
        if(y > 0) {
            v.emplace_back('R', 0);
            v.emplace_back('Z', y);
        }
        cout << v.size() << " W\n";
        for(auto &[a, b] : v) {
            cout << a;
            if(a == 'Z') cout << " " << b;
            cout << "\n";
        }
    }else if(x > 0){
        vector<pci> v;
        v.emplace_back('Z', x);
        if(y < 0) {
            v.emplace_back('R', 0);
            v.emplace_back('Z', -y);
        }
        if(y > 0) {
            v.emplace_back('L', 0);
            v.emplace_back('Z', y);
        }
        cout << v.size() << " E\n";
        for(auto &[a, b] : v) {
            cout << a;
            if(a == 'Z') cout << " " << b;
            cout << "\n";
        }
    }else if(y > 0) {
        vector<pci> v;
        v.emplace_back('Z', y);
        if(x < 0) {
            v.emplace_back('L', 0);
            v.emplace_back('Z', -x);
        }
        if(x > 0) {
            v.emplace_back('R', 0);
            v.emplace_back('Z', x);
        }
        cout << v.size() << " N\n";
        for(auto &[a, b] : v) {
            cout << a;
            if(a == 'Z') cout << " " << b;
            cout << "\n";
        }
    }else if(y < 0) {
        vector<pci> v;
        v.emplace_back('Z', -y);
        if(x < 0) {
            v.emplace_back('R', 0);
            v.emplace_back('Z', -x);
        }
        if(x > 0) {
            v.emplace_back('L', 0);
            v.emplace_back('Z', x);
        }
        cout << v.size() << " S\n";
        for(auto &[a, b] : v) {
            cout << a;
            if(a == 'Z') cout << " " << b;
            cout << "\n";
        }
    }
    assert(-1);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int T;
    cin >> T;
    while(T --) {
        solve();
    }
}

源文件, 语言: C++20

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

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3624kb

input:

output:

3 E
Z 1
R
Z 2

result:

ok ok (1 test case)

Test #2:

score: 0

Accepted

time: 0ms

memory: 3528kb

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 E
Z 4
R
Z 7
7 E
Z 1
R
Z 1
R
Z 1
R
Z 1
3 E
Z 12
L
Z 14
3 W
Z 1
R
Z 7
7 E
Z 1
R
Z 1
R
Z 1
R
Z 1
7 E
Z 1
R
Z 1
R
Z 1
R
Z 1
3 W
Z 1
R
Z 18
7 E
Z 1
R
Z 1
R
Z 1
R
Z 1
7 E
Z 1
R
Z 1
R
Z 1
R
Z 1
7 E
Z 1
R
Z 1
R
Z 1
R
Z 1
7 E
Z 1
R
Z 1
R
Z 1
R
Z 1
3 E
Z 9
R
Z 3
1 W
Z 10
7 E
Z 1
R
Z 1
R
Z 1
R
Z 1
3 W
Z 9
L
...

result:

ok ok (99 test cases)

Test #3:

score: 0

Accepted

time: 6ms

memory: 3636kb

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

result:

ok ok (10000 test cases)

Extra Test:

score: 0

Extra Test Passed