[ACM] 1007 -球球方格

与兔子方格类似，不过一秒走一格；

 输入

5
6 5 2 0 10
10 10 4 4 6
3 20 0 0 7
30 30 2 28 4
3 3 1 0 100

 

代码

#include<iostream>
using namespace std;

int main(void) {
    int test_count;
    freopen("input.txt", "r", stdin);
    cin >> test_count;

    
    int R;//行数
    int C;//列数
    int A, B;//出发点坐标    
    int N;//经过时间
    int flagA;
    int flagB;
    for (int test_case = 1; test_case <= test_count; test_case++)
    {
        cin >> R >> C >> A >> B >> N;
        flagA = 1;//默认开始每个例子都是向右下角移动
        flagB = 1;

        while (N>0)
        {
            if (A != R - 1) {
                if(flagA == 1)
                {
                    A++;
                    if (A == R - 1)
                    {
                        flagA = -1;
                        
                    }
                    else
                    {
                        flagA = 1;
                        
                    }
                }
                else
                {
                    A--;
                    if (A == 0) {
                        flagA = 1;
                        
                    }
                    else
                    {
                        flagA = -1;
                        
                    }
                }
                
                
            }
            
            else 
            {
                if (flagA == -1)
                {
                    A--;
                    if (A == 0) {
                        flagA = 1;
                        
                    }
                    else
                    {
                        flagA = -1;
                        
                    }
                }
                else
                {
                    A++;
                    if (A == R - 1) {
                        flagA = -1;                        
                    }
                    else
                    {
                        flagA = 1;
                        
                    }
                }                
                
            }

            if (B != C - 1) {
                if (flagB == 1)
                {
                    B++;
                    if (B == C - 1)
                    {
                        flagB = -1;

                    }
                    else
                    {
                        flagB = 1;

                    }
                }
                else
                {
                    B--;
                    if (B == 0) {
                        flagB = 1;

                    }
                    else
                    {
                        flagB = -1;

                    }
                }


            }

            else
            {
                if (flagB == -1)
                {
                    B--;
                    if (B == 0) {
                        flagB = 1;

                    }
                    else
                    {
                        flagB = -1;

                    }
                }
                else
                {
                    B++;
                    if (B == C - 1) {
                        flagB = -1;

                    }
                    else
                    {
                        flagB = 1;

                    }
                }

            }
            N--;
        }


        cout << "#" << test_case << " " << A << " " << B << endl;
    }

    return 0;
}