QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#688842#9521. Giving Directions in Harbinzny780624#AC ✓6ms3588kbC++202.4kb2024-10-30 13:54:052024-10-30 13:54:06

Judging History

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

  • [2024-10-30 13:54:06]
  • 评测
  • 测评结果:AC
  • 用时:6ms
  • 内存:3588kb
  • [2024-10-30 13:54:05]
  • 提交

answer

#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <bitset>
#include <cstring>
#include <queue>
#define fi first
#define se second
using namespace std;
using ll = long long;
typedef pair<int, int> PII;
void silverwolf()
{
    int n;
    cin >> n;
    int x = 0, y = 0;
    for (int i = 1; i <= n; i++)
    {
        char op;
        int t;
        cin >> op >> t;
        if (op == 'N')
            x -= t;
        else if (op == 'S')
            x += t;
        else if (op == 'W')
            y -= t;
        else
            y += t;
    }
    if (x == 0 && y == 0)
    {
        cout<<"7 E\n";
        cout<<"Z 1\n";
        cout<<"R\n";
        cout<<"Z 1\n";
        cout<<"R\n";
        cout<<"Z 1\n";
        cout<<"R\n";
        cout<<"Z 1\n";
    }
    if (x == 0)
    {
        if (y > 0)
        {
            cout << "1 E\n";
            cout << "Z " << y << endl;
            return;
        }
        else if (y < 0)
        {
            cout << "1 W\n";
            cout << "Z " << -y << endl;
            return;
        }
    }
    if (y == 0)
    {
        if (x > 0)
        {
            cout << "1 S\n";
            cout << "Z " << x << endl;
            return;
        }
        else if (x < 0)
        {
            cout << "1 N\n";
            cout << "Z " << -x << endl;
            return;
        }
    }
    if (x > 0 && y > 0)
    {
        cout << "3 S\n";
        cout << "Z ";
        cout << x << "\n";
        cout << "L\n";
        cout << "Z ";
        cout << y << "\n";
        return;
    }
    if (x > 0 && y < 0)
    {
        cout << "3 S\n";
        cout << "Z ";
        cout << x << "\n";
        cout << "R\n";
        cout << "Z ";
        cout << -y << "\n";
        return;
    }
    if (x < 0 && y > 0)
    {
        cout << "3 N\n";
        cout << "Z ";
        cout << -x << "\n";
        cout << "R\n";
        cout << "Z ";
        cout << y << "\n";
        return;
    }
    if (x < 0 && y < 0)
    {
        cout << "3 N\n";
        cout << "Z ";
        cout << -x << "\n";
        cout << "L\n";
        cout << "Z ";
        cout << -y << "\n";
        return;
    }
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int T;
    cin >> T;
    while (T--)
        silverwolf();
    return 0;
}

这程序好像有点Bug,我给组数据试试?

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 3588kb

input:

1
2
S 2
E 1

output:

3 S
Z 2
L
Z 1

result:

ok ok (1 test case)

Test #2:

score: 0
Accepted
time: 0ms
memory: 3564kb

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

result:

ok ok (99 test cases)

Test #3:

score: 0
Accepted
time: 6ms
memory: 3584kb

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