QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#785275	#9521. Giving Directions in Harbin	SZH^#	WA	1ms	3672kb	C++14	1.1kb	2024-11-26 17:22:59	2024-11-26 17:23:01

Judging History

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

[2024-11-26 17:23:01]
评测

测评结果：WA
用时：1ms
内存：3672kb

查看

[2024-11-26 17:22:59]
提交

answer

#include<bits/stdc++.h>
#define pa pair<int,int>
#define INF 0x3f3f3f3f
#define inf 0x3f
#define fi first
#define se second
#define mp make_pair
#define ll long long
#define ull unsigned long long
#define pb push_back

using namespace std;

inline ll read()
{
	ll f=1,sum=0;char c=getchar();
	while (!isdigit(c)) {if (c=='-') f=-1;c=getchar();}
	while (isdigit(c)) {sum=sum*10+c-'0';c=getchar();}
	return sum*f;
}
map <char,int> id;
int main()
{
	id['N']=1,id['E']=2,id['S']=3,id['W']=4;
	int T=read();
	while (T--)
	{
		int n=read();
		vector <pair<char,int> > ans;
		char op,st;
		for (int i=1;i<=n;i++)
		{
			char dir[3];
			scanf("%s",dir+1);
			int len=read();
			if (i==1)
			{
				op=st=dir[1];
				ans.push_back(mp('Z',len));
			}
			else
			{
				int d=dir[1]-op;
				if (d==-1 || d==3) ans.push_back(mp('R',-1));
				else if (!d) ;
				else ans.push_back(mp('L',-1));
				ans.push_back(mp('Z',len));
				op=dir[1];
			}
		}
		cout<<ans.size()<<' '<<st<<'\n';
		for (auto p:ans)
			if (p.se!=-1) cout<<p.fi<<' '<<p.se<<'\n';
			else cout<<p.fi<<'\n';
	}	
	return 0;
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3640kb

input:

output:

3 S
Z 2
L
Z 1

result:

ok ok (1 test case)

Test #2:

score: -100

Wrong Answer

time: 1ms

memory: 3672kb

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

result:

wrong answer Wrong destination (test case 3)