F. Bouncy Ball （模拟)

Problem - F - Codeforces

在n * m 的图中给定起点和终点，以及最开始的球的朝向，问球经过多少次弹跳能到达终点，如果到达不了输出-1

6
5 7 1 7 2 4 DL
5 7 1 7 3 2 DL
3 3 1 3 2 2 UR
2 4 2 1 2 2 DR
4 3 1 1 1 3 UL
6 4 1 2 3 4 DR

3
-1
1
-1
4
0

 

#include <iostream>
#include <vector>
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <algorithm>
#define x first
#define y second
#define pb emplace_back
#define fu(i,a,b) for(int i=a;i<=b; ++ i)
#define fd(i,a,b) for(int i=a;i>=b; -- i)
#define endl '\n'
#define ms(x,y) memset(x,y,sizeof x)
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;

typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef vector<vector<LL>> VVL;
typedef vector<vector<int>> VVI;
typedef vector<LL> VL;
typedef vector<bool> VB;
typedef vector<int> VI;
typedef vector<string> VS;
typedef pair<int,int> PII;
typedef vector<PII> VPII;
typedef pair<PII,int> PIII;
typedef pair<double,double> PDD;
typedef pair<double,int> PDI;
typedef pair<char,int> PCI;
typedef pair<string,int> PSI;
typedef pair<int,string> PIS;
typedef pair<int,char> PIC;
typedef pair<LL,LL> PLL;
typedef __int128 i128;
typedef unsigned long long ULL;
const int N = 1e5 +  10 ,M =100,INF = 0x3f3f3f3f,P = 131;
const double eps = 1e-8,DNF = 1e18;
const int mod = 998244353 ,base= 20010;
const LL LNF=(LL) INF * INF;




void solve()
{
	int n,m,sx,sy,ex,ey;
	string op;// 读入一开始的方向 
	cin >> n >> m >> sx>> sy >>ex>> ey >>op;
	
	int dx = 1,dy =1; // 假定一开始的方向是往右下的 
	if(op[0] =='U') dx = -1;  // 向上 
	if(op[1] =='L') dy = -1;  // 向左	
	
	int cnt=0 ,ans= 0 ;
	
	while(cnt < 4 * n * m)
	{
		if(sx == ex  && sy == ey )
		{
			cout << ans << endl;return;
		}
		cnt ++ ;
		bool bounce = 0 ;
		if(sx + dx < 1 || sx + dx > n )bounce = 1,dx*= -1 ; //竖直方向撞墙 
		if(sy + dy < 1 || sy + dy > m )bounce = 1,dy*= -1;	// 水平方向撞墙 
		ans += bounce; // 有撞到墙，弹跳次数加 1  
		sx += dx;
		sy += dy;
	}
	cout << -1 << endl;
		
}



signed main()
{
//  freopen("1.txt","r",stdin);
//  #define int long long 
//  init(N-1);
    ios
//  cout << fixed<<setprecision(2);
    int t=1;
    cin>>t;
    int now = 1;
    while(t -- )
    {
//     cout<<"Case "; 
//      cout<<"Case #"; 
//      cout<<"Scenario #"; 
//     cout<< now ++ <<": ";
//      cout<< now ++ <<": \n";
        solve();
    }


    return 0;
}