0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2025-01-11 16:31:58 +00:00

P2689 东南西北

R41149657
This commit is contained in:
Baoshuo Ren 2020-11-03 16:11:32 +08:00 committed by Baoshuo Ren
parent 327f478b5d
commit bc2208afd7
Signed by: baoshuo
GPG Key ID: 70F90A673FB1AB68

34
problem/P2689/P2689.cpp Normal file
View File

@ -0,0 +1,34 @@
#include<bits/stdc++.h>
using namespace std;
int main() {
int x1, y1, x2, y2, t, ans = 0;
char c;
cin >> x1 >> y1 >> x2 >> y2 >> t;
for(int i = 1 ; i <= t ; i++) {
cin >> c;
if(c == 'E' && y1 < y2) {
y1++;
ans++;
}
else if(c == 'W' && y1 > y2) {
y1--;
ans++;
}
else if(c == 'N' && x1 < x2) {
x1++;
ans++;
}
else if(c == 'S' && x1 > x2) {
x1--;
ans++;
}
if(x1 == x2 && y1 == y2) {
cout << ans << endl;
return 0;
}
}
cout << -1 << endl;
return 0;
}