QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#714872	#9521. Giving Directions in Harbin	ucup-team4717^#	AC ✓	16ms	9816kb	C++20	2.3kb	2024-11-06 08:50:08	2024-11-06 08:50:09

Judging History

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

[2024-11-06 08:50:09]
评测

测评结果：AC
用时：16ms
内存：9816kb

查看

[2024-11-06 08:50:08]
提交

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;
        x=y=0;
        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=c[1];
        ans[++tot]='Z',res[tot]=p[1];
        for(int i=2;i<=n;i++){
            if(c[i]=='W'&&c[i-1]=='N') ans[++tot]='L';
            else if(c[i]=='E'&&c[i-1]=='N') ans[++tot]='R'; 
            else if(c[i]=='N'&&c[i-1]=='E') ans[++tot]='L'; 
            else if(c[i]=='S'&&c[i-1]=='E') ans[++tot]='R'; 
            else if(c[i]=='E'&&c[i-1]=='S') ans[++tot]='L'; 
            else if(c[i]=='W'&&c[i-1]=='S') ans[++tot]='R'; 
            else if(c[i]=='S'&&c[i-1]=='W') ans[++tot]='L'; 
            else if(c[i]=='N'&&c[i-1]=='W') ans[++tot]='R'; 

            ans[++tot]='Z',res[tot]=p[i];
        }
        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;
}

源文件, 语言: C++20

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

詳細信息

Test #1:

score: 100

Accepted

time: 2ms

memory: 9740kb

input:

output:

3 S
Z 2
L
Z 1

result:

ok ok (1 test case)

Test #2:

score: 0

Accepted

time: 0ms

memory: 9816kb

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

result:

ok ok (99 test cases)

Test #3:

score: 0

Accepted

time: 16ms

memory: 7696kb

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

result:

ok ok (10000 test cases)

Extra Test:

score: 0

Extra Test Passed