QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#719156#9521. Giving Directions in HarbinyykWA 1ms3756kbC++14731b2024-11-06 22:54:292024-11-06 22:54:29

Judging History

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

  • [2024-11-06 22:54:29]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3756kb
  • [2024-11-06 22:54:29]
  • 提交

answer

#include <vector>
#include <iostream>
using namespace std;

typedef pair<char,int> PCI;
char st[]="NESW";

int main() {
	int T;
	cin>>T;
	while(T--){
		int n;
		cin>>n;
		int idx=0;
		char sta=0,last;
		vector<PCI> a;
		while(n--){
			char op;
			int x;
			cin>>op>>x;
			if(sta==0){
				sta=last=op;
				for(int i=0;i<4;++i){
					if(st[i]==sta){
						idx=i;
						break;
					}
				}
			}
			else if(st[(idx+3)%4]==op){
				a.push_back({'L',0});
			}
			else if(st[(idx+1)%4]==op){
				a.push_back({'R',0});
			}
			a.push_back({'Z',x});
		}
		cout<<a.size()<<' '<<sta<<endl;
		for(PCI t:a){
			cout<<t.first<<' ';
			if(t.second) cout<<t.second;
			cout<<endl;
		}
	}
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

1
2
S 2
E 1

output:

3 S
Z 2
L 
Z 1

result:

ok ok (1 test case)

Test #2:

score: -100
Wrong Answer
time: 1ms
memory: 3756kb

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:

6 E
Z 6
L 
Z 1
Z 2
R 
Z 8
12 W
Z 10
R 
Z 1
Z 10
L 
Z 2
Z 2
R 
Z 2
Z 2
L 
Z 1
13 N
Z 5
R 
Z 4
Z 7
R 
Z 6
Z 9
R 
Z 8
Z 4
L 
Z 6
Z 7
9 N
Z 6
R 
Z 6
Z 8
L 
Z 9
Z 7
R 
Z 2
12 E
Z 6
R 
Z 9
Z 5
R 
Z 4
Z 6
L 
Z 4
Z 5
L 
Z 9
12 N
Z 6
L 
Z 10
Z 6
L 
Z 6
Z 6
R 
Z 6
Z 6
R 
Z 10
15 N
Z 7
L 
Z 3
Z 5
L 
Z 5
Z 8
L ...

result:

wrong answer Same direction appears twice (test case 1)