QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#682988	#9521. Giving Directions in Harbin	HalloWorld	AC ✓	8ms	3836kb	C++20	1.6kb	2024-10-27 18:18:44	2024-10-27 18:18:45

Judging History

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

[2024-10-27 18:18:45]
评测

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

查看

[2024-10-27 18:18:44]
提交

answer

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define bit(a) (1<<a)
#define eb emplace_back
#define lowbit(a) (a&(-a))
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define debug(a) cout<<#a<<":"<<a<<endl
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define _for(i,b) for(int i=(0);i<(b);i++)
#define per(i,b,a) for(int i=b;i>=a;i--)
typedef long long ll;
typedef unsigned long long ull;
constexpr int N=200010;
constexpr int INF=2e9;
constexpr ll LLF=2e18;
constexpr ll mod=998244353;
constexpr int dir[4][2]={{-1,0},{1,0},{0,-1},{0,1}};
ll powmod(ll a,ll b,ll mod=mod) {ll res=1;a%=mod;for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll inv(ll a){return powmod(a,mod-2);}

void solve() {
	int n;cin>>n;
	vector<pair<char,int>> v1;
	rep(i,1,n){
		char c;cin>>c;
		int x;cin>>x;
		v1.push_back({c,x});
	}
	cout<<2*n-1<<" "<<v1[0].first<<"\n";
	cout<<"Z "<<v1[0].second<<"\n";
	rep(i,1,SZ(v1)-1){
		if(v1[i-1].first=='S'&&v1[i].first=='E') cout<<"L\n";
		if(v1[i-1].first=='S'&&v1[i].first=='W') cout<<"R\n";
		if(v1[i-1].first=='N'&&v1[i].first=='E') cout<<"R\n";
		if(v1[i-1].first=='N'&&v1[i].first=='W') cout<<"L\n";

		if(v1[i-1].first=='E'&&v1[i].first=='S') cout<<"R\n";
		if(v1[i-1].first=='W'&&v1[i].first=='S') cout<<"L\n";
		if(v1[i-1].first=='E'&&v1[i].first=='N') cout<<"L\n";
		if(v1[i-1].first=='W'&&v1[i].first=='N') cout<<"R\n";
		cout<<"Z "<<v1[i].second<<"\n";
	}
}
int main() {
	ios::sync_with_stdio(false);cin.tie(nullptr);
	// cout << fixed << setprecision(10);
	int testcase;cin>>testcase;rep(_,1,testcase){
		solve();
	}
	return 0;	
}

源文件, 语言: C++20

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

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3532kb

input:

output:

3 S
Z 2
L
Z 1

result:

ok ok (1 test case)

Test #2:

score: 0

Accepted

time: 0ms

memory: 3516kb

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: 8ms

memory: 3836kb

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