QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#677771#9521. Giving Directions in Harbinucup-team3661#AC ✓36ms3564kbC++20892b2024-10-26 13:23:442024-10-26 13:23:51

Judging History

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

  • [2024-10-26 13:23:51]
  • 评测
  • 测评结果:AC
  • 用时:36ms
  • 内存:3564kb
  • [2024-10-26 13:23:44]
  • 提交

answer

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

const vector<int>dx={1,0,-1,0};
const vector<int>dy={0,1,0,-1};
string str="SENW";

void solve(){
	int N;cin>>N;
	vector<pair<char,int>>D(N);
	for(int i=0;i<N;i++)cin>>D[i].first>>D[i].second;

	vector<pair<char,int>>ans;
	int nowd=str.find(D[0].first);
	char start=D[0].first;
	for(auto[d,c]:D){
		int nxtd=str.find(d);
		int cl=0,cr=0;
		int tmpd=nowd;
		while(tmpd!=nxtd){
			cl++;
			tmpd++;
			tmpd%=4;
		}
		tmpd=nowd;
		while(tmpd!=nxtd){
			cr++;
			tmpd+=3;
			tmpd%=4;
		}
		if(cl<cr){
			while(cl--)ans.push_back({'L',-1});
		}else{
			while(cr--)ans.push_back({'R',-1});
		}
		nowd=nxtd;
		ans.push_back({'Z',c});
	}

	cout<<ans.size()<<' '<<start<<endl;
	for(auto[d,c]:ans){
		cout<<d;
		if(c!=-1)cout<<' '<<c;
		cout<<endl;
	}
}

int main(){
	int T;cin>>T;

	while(T--)solve();
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 2ms
memory: 3512kb

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: 36ms
memory: 3468kb

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