QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#685348	#9521. Giving Directions in Harbin	blhxzjr^#	AC ✓	8ms	3828kb	C++23	2.2kb	2024-10-28 18:58:23	2024-10-28 18:58:23

Judging History

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

[2024-10-28 18:58:23]
评测

测评结果：AC
用时：8ms
内存：3828kb

查看

[2024-10-28 18:58:23]
提交

answer

#include<bits/stdc++.h>
using namespace std;
//#define int long long
//const int N=1e6+10;
int n,m,_;
void solve(){
	cin>>n;
	int x=0,y=0;
	for(int i=1;i<=n;i++){
		char a;
		int d;
		cin>>a>>d;
		if(a=='S') y-=d;
		else if(a=='N') y+=d;
		else if(a=='W') x-=d;
		else x+=d;
	}
	vector<pair<char,int>>a;
	char d;
	int cc=0;
	if(x>0) d='E';
	else if(x<0) d='W',x=-x;
	else{
		if(y==0){
			d='N';
			a.push_back({'Z',1});
			a.push_back({'R',0});
			a.push_back({'Z',1});
			a.push_back({'R',0});
			a.push_back({'Z',1});
			a.push_back({'R',0});
			a.push_back({'Z',1});
		}
		else{
			if(y>0) d='N';
			else d='S';
		}
	}
	while(x){
		if(x>100){
			a.push_back({'Z',100});
			x-=100;
		}
		else{
			a.push_back({'Z',x});
			x=0;
			break;
		}
		a.push_back({'L',0});
		if(x>100){
			a.push_back({'Z',1});
			a.push_back({'R',0});
			a.push_back({'Z',100});
			a.push_back({'R',0});
			a.push_back({'Z',1});
			a.push_back({'L',0});
			x-=100;
		}
		else{
			a.push_back({'Z',1});
			a.push_back({'R',0});
			a.push_back({'Z',x});
			a.push_back({'R',0});
			a.push_back({'Z',1});
			a.push_back({'L',0});
			x=0;
			break;
		}
	}
	if(d=='W'){
		if(y<0){
			a.push_back({'L',0});
		}
		else if(y>0){
			a.push_back({'R',0});
		}
	}
	else if(d=='E'){
		if(y<0){
			a.push_back({'R',0});
		}
		else if(y>0){
			a.push_back({'L',0});
		}
	}
	x=abs(y);
	while(x){
		if(x>100){
			a.push_back({'Z',100});
			x-=100;
		}
		else{
			a.push_back({'Z',x});
			x=0;
			break;
		}
		a.push_back({'L',0});
		if(x>100){
			a.push_back({'Z',1});
			a.push_back({'R',0});
			a.push_back({'Z',100});
			a.push_back({'R',0});
			a.push_back({'Z',1});
			a.push_back({'L',0});
			x-=100;
		}
		else{
			a.push_back({'Z',1});
			a.push_back({'R',0});
			a.push_back({'Z',x});
			a.push_back({'R',0});
			a.push_back({'Z',1});
			a.push_back({'L',0});
			x=0;
			break;
		}
	}
	cout<<a.size()<<' ';
	cout<<d;
	cout<<endl; 
	for(auto [x,y]:a){
		if(x=='Z'){
			cout<<x<<' '<<y<<endl;
		}
		else cout<<x<<endl;
	}
}
signed main(){
	ios_base::sync_with_stdio(false),cin.tie(0);
	_=1;
	cin >> _;
	while(_--){
		solve();
	}
	return 0;
}

Source code, Language: C++23

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3612kb

input:

output:

3 E
Z 1
R
Z 2

result:

ok ok (1 test case)

Test #2:

score: 0

Accepted

time: 1ms

memory: 3820kb

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

result:

ok ok (99 test cases)

Test #3:

score: 0

Accepted

time: 8ms

memory: 3828kb

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 W
Z 10
L
Z 21
3 E
Z 8
R
Z 10
3 W
Z 5
R
Z 7
3 E
Z 1
R
Z 4
3 E
Z 2
R
Z 4
3 W
Z 18
R
Z 16
3 W
Z 2
R
Z 1
3 E
Z 14
L
Z 13
3 W
Z 7
L
Z 5
3 W
Z 9
R
Z 2
3 W
Z 4
R
Z 13
3 W
Z 12
L
Z 29
3 E
Z 11
L
Z 2
3 E
Z 21
L
Z 1
3 E
Z 5
L
Z 7
3 W
Z 16
L
Z 9
1 S
Z 7
3 E
Z 5
R
Z 9
1 N
Z 10
3 E
Z 5
L
Z 9
3 ...

result:

ok ok (10000 test cases)

Extra Test:

score: 0

Extra Test Passed