QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#691882 | #9521. Giving Directions in Harbin | gates_orz | AC ✓ | 5ms | 3656kb | C++20 | 2.3kb | 2024-10-31 13:18:57 | 2024-10-31 13:19:06 |
Judging History
answer
#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
typedef long long LL;
//#define int LL
#define inl inline
const int N = 3e5 + 10;
const int M = N * 2;
//const int mod=998244353;
const int mod = 1000000007;
const double eps = 1e-8;
//const int mod=1e9+7;
typedef pair<int, int> PII;
//const int INF=0x3f3f3f3f;
const LL INF = 0x3f3f3f3f3f3f3f3f;
int n, m;
void become_faster() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
void solve() {
cin>>n;
int x=0,y=0;
for(int i=1;i<=n;i++) {
char c;
int dis;
cin>>c>>dis;
if(c=='S')y-=dis;
if(c=='N')y+=dis;
if(c=='W')x-=dis;
if(c=='E')x+=dis;
}
if(x==0&&y==0) {
cout<<"7 N"<<"\n";
cout<<"Z 1"<<"\n";
cout<<"R"<<"\n";
cout<<"Z 1"<<"\n";
cout<<"R"<<"\n";
cout<<"Z 1"<<"\n";
cout<<"R"<<"\n";
cout<<"Z 1"<<"\n";
}
else if(x==0) {
if(y>0) {
cout<<"1 N"<<"\n";
cout<<"Z "<<y<<"\n";
}
else {
cout<<"1 S"<<"\n";
cout<<"Z "<<abs(y)<<"\n";
}
}
else if(y==0) {
if(x>0) {
cout<<"1 E"<<"\n";
cout<<"Z "<<x<<"\n";
}
else {
cout<<"1 W"<<"\n";
cout<<"Z "<<abs(x)<<"\n";
}
}
else {
cout<<"3 ";
if(x>0) {
cout<<"E"<<"\n";
cout<<"Z "<<x<<"\n";
if(y>0) {
cout<<"L"<<"\n";
cout<<"Z "<<y<<"\n";
}
else {
cout<<"R"<<"\n";
cout<<"Z "<<abs(y)<<"\n";
}
}
else {
cout<<"W"<<"\n";
cout<<"Z "<<abs(x)<<"\n";
if(y>0) {
cout<<"R"<<"\n";
cout<<"Z "<<y<<"\n";
}
else {
cout<<"L"<<"\n";
cout<<"Z "<<abs(y)<<"\n";
}
}
}
}
/*
1
2
S 2
E 1
*/
signed main() {
become_faster();
int T = 1;
//T=read();
cin>>T;
//for(int i=1;i<=100;i++)solve(i);
while (T--) solve();
return 0;
}
这程序好像有点Bug,我给组数据试试?
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3644kb
input:
1 2 S 2 E 1
output:
3 E Z 1 R Z 2
result:
ok ok (1 test case)
Test #2:
score: 0
Accepted
time: 0ms
memory: 3656kb
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: 5ms
memory: 3652kb
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