QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#714827	#9521. Giving Directions in Harbin	ucup-team4717^#	WA	1ms	7720kb	C++20	2.3kb	2024-11-06 08:30:56	2024-11-06 08:30:57

Judging History

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

[2024-11-06 08:30:57]
评测

测评结果：WA
用时：1ms
内存：7720kb

查看

[2024-11-06 08:30:56]
提交

answer

#include<bits/stdc++.h>
#define int long long
using namespace std;
namespace IO{
    char buff[1<<21],*p1=buff,*p2=buff;
    template<typename T>
    void read(T &x){
        char ch=getchar();int fl=1;x=0;
        while(ch>'9'||ch<'0'){if(ch=='-')fl=-1;ch=getchar();}
        while(ch<='9'&&ch>='0'){x=x*10+ch-48;ch=getchar();}
        x*=fl;
    }
    template<typename T,typename ...Args>
    void read(T &x,Args& ...args){
        read(x);read(args...);
    }
    char obuf[1<<21],*p3=obuf;
    void putch(char ch){
        if(p3-obuf<(1<<21))*p3++=ch;
        else fwrite(obuf,p3-obuf,1,stdout),p3=obuf,*p3++=ch;
    }
    char ch[100];
    template<typename T>
    void write(T x){
        if(!x)return putch('0');
        if(x<0)putch('-'),x*=-1;
        int top=0;
        while(x)ch[++top]=x%10+48,x/=10;
        while(top)putch(ch[top]),top--;
    }
    template<typename T,typename ...Args>
    void write(T x,Args ...args){
        write(x);write(args...);
    }
    void flush(){fwrite(obuf,p3-obuf,1,stdout);}
}
using namespace IO;
const int N=5e5+5;
int T,p[N],x,y;
char c[N];

int tot;
char ans[N];
int res[N];

signed main(){
    cin>>T;
    while(T--){
        int n;
        cin>>n;
        for(int i=1;i<=n;i++){
            cin>>c[i]>>p[i];
            if(c[i]=='S') x+=p[i];
            else if(c[i]=='N') x-=p[i];
            else if(c[i]=='W') y-=p[i];
            else if(c[i]=='E') y+=p[i];  
        }
        tot=0;
        char cs='S';
        if(x!=0){
            if(x>0) ++tot,ans[tot]='Z',res[tot]=x,cs='S';
            else ++tot,ans[tot]='Z',res[tot]=abs(x),cs='N';
        }
        if(y!=0){
            if(y>0){
                if(tot==1&&x>0) ++tot,ans[tot]='L'; 
                else if(tot==1&&x<0) ++tot,ans[tot]='R';
                else cs='E';
                ++tot,ans[tot]='Z',res[tot]=y;
            }
            else{
                if(tot==1&&x>0) ++tot,ans[tot]='R'; 
                else if(tot==1&&x<0) ++tot,ans[tot]='L';
                else cs='W';
                ++tot,ans[tot]='Z',res[tot]=abs(y);               
            }
        }
        cout<<tot<<" "<<cs<<"\n";
        for(int i=1;i<=tot;i++){
            cout<<ans[i];
            if(ans[i]!='L'&&ans[i]!='R') cout<<" "<<res[i];
            cout<<"\n";
        }
    }
    return 0;
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 7720kb

input:

output:

3 S
Z 2
L
Z 1

result:

ok ok (1 test case)

Test #2:

score: -100

Wrong Answer

time: 1ms

memory: 7656kb

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
3 S
Z 7
L
Z 4
3 N
Z 7
R
Z 16
3 N
Z 14
R
Z 15
3 N
Z 14
R
Z 15
3 N
Z 14
R
Z 15
3 N
Z 32
R
Z 14
3 N
Z 32
R
Z 14
3 N
Z 32
R
Z 14
3 N
Z 32
R
Z 14
3 N
Z 32
R
Z 14
3 N
Z 29
R
Z 23
3 N
Z 29
R
Z 13
3 N
Z 29
R
Z 13
3 N
Z 13
R
Z 4
3 N
Z 17
R
Z 1
3 N
Z 10
R
Z 6
3 N
Z 10
R
Z 6
3 N
Z 10
R
Z 6
3 S
Z ...

result:

wrong answer Wrong destination (test case 2)