QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#723892#9521. Giving Directions in HarbinLblAC ✓16ms3620kbC++141.1kb2024-11-08 02:41:492024-11-08 02:41:49

Judging History

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

  • [2024-11-08 02:41:49]
  • 评测
  • 测评结果:AC
  • 用时:16ms
  • 内存:3620kb
  • [2024-11-08 02:41:49]
  • 提交

answer

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
char a[4]={'S','N','E','W'};
char b[4];
char g[100005];
int f[100005];
void exc(char s){
	if(s==a[0]){
		b[0]='Z';
		b[1]='1';
		b[2]='L';
		b[3]='R';
	}
	if(s==a[1]){
		b[0]='1';
		b[1]='Z';
		b[2]='R';
		b[3]='L';
	}
	if(s==a[2]){
		b[0]='R';
		b[1]='L';
		b[2]='Z';
		b[3]='1';
	}
	if(s==a[3]){
		b[0]='L';
		b[1]='R';
		b[2]='1';
		b[3]='Z';
	}
}
int main(){
	int t;
	cin>>t;
	while(t--){
		int n;
		cin>>n;
		char c;
		int x;
		cin>>c>>x;
		int s=1;
		g[0]=c;
		g[1]='Z';
		f[1]=x;
		exc(c);
		for(int i=2;i<=n;i++){
			cin>>c;
			cin>>x;
			int y=0;
			for(int j=0;j<4;j++){
				if(c==a[j]){
					g[i]=b[j];
					f[i]=x;
					s++;
					if(b[j]=='L'||b[j]=='R'){
						s++;
					}
					y=1;
					exc(c);
					break;
				}
			}
			if(y==0){
				g[i]='Z';
				f[i]=-x;
				s++;
				exc(c);
			}
		}
		cout<<s<<" "<<g[0]<<"\n";
		for(int i=1;i<=n;i++){
			if(g[i]=='L'||g[i]=='R'){
				cout<<g[i]<<"\n";
				cout<<"Z"<<" "<<f[i]<<"\n";
			}
			else{
			cout<<g[i]<<" "<<f[i]<<"\n";
			}
		}
	}
	return 0;
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 1ms
memory: 3616kb

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: 3604kb

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