QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#718063	#9521. Giving Directions in Harbin	Exile_Code^#	WA	0ms	3780kb	C++20	1.5kb	2024-11-06 19:36:57	2024-11-06 19:36:58

Judging History

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

[2024-11-06 19:36:58]
评测

测评结果：WA
用时：0ms
内存：3780kb

查看

[2024-11-06 19:36:57]
提交

answer

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

#define ll long long 
#define pii pair<ll,ll>
#define endl '\n'
#define vv vector
#define all(x) x.begin()+1,x.end()

#define int ll

#define ft first
#define sd second


void solve(){

    int n;
    cin>>n;
    vector<pii> act(n);
    auto turn1=[&](char d)->int
    {
        if(d=='N')
            return 0;
        else if(d=='E')
            return 1;
        else if(d=='S')
            return 2;
        else if(d=='W')
            return 3;
    };
    auto turn2=[&](int d)->char
    {
        if(d==0)
            return 'N';
        else if(d==1)
            return 'E';
        else if(d==2)
            return 'S';
        else if(d==3)
            return 'W';
    };
    for(int i=0;i<n;i++)
    {
        char ch;int x;
        cin>>ch>>x;
        act[i]={turn1(ch),x};
    }
    cout<<2*n-1<<" "<<turn2(act[0].ft)<<"\n";
    cout<<"Z "<<act[0].sd<<"\n";
    int now=act[0].ft;
    auto calc=[&](int las,int nex)->char
    {
        int diff=las-nex;
        if(diff==1)
            return 'L';
        else if(diff==-1)
            return 'R';
        else if(diff==3)
            return 'L';
        else
            return 'R';
    };
    for(int i=1;i<n;i++)
    {
        cout<<calc(now,act[i].ft)<<"\n";
        cout<<"Z "<<act[i].sd<<"\n";
    }
}
signed main(){

    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);

    int _;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: 3588kb

input:

output:

3 S
Z 2
L
Z 1

result:

ok ok (1 test case)

Test #2:

score: -100

Wrong Answer

time: 0ms

memory: 3780kb

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

result:

wrong answer Wrong destination (test case 1)