SCAU 10893 Spiral

10893 Spiral

时间限制:1000MS  内存限制:65535K

题型: 编程题   语言: 无限制

Description

Given an odd number n, we can arrange integers from 1 to n*n in the shape of a spiral. The figure 2.4.1 below illustrates the spiral made by integers from 1 to 25.

【图片】

21  22  23  24  25
20   7   8   9  10
19   6   1   2  11
18   5   4   3  12
17  16  15  14  13

As we see above, each position in the spiral corresponds to a unique integer. For example, the number in row 1, column 1 is 21, and integer 16 is in row 5, column 2.

Now, given the odd number n (1≤n≤32768), and an integer m (1≤m≤n*n), you should write a program to find out the position of m.

输入格式

The first line of the input is a positive integer T(T≤20). T is the number of the test cases followed. Each case consists of two integer n and m as described above.

输出格式

For each case, output the row number and column number that the given integer is in, separated by a single whitespace. Please note that the row and column number are both starting from 1.

输入样例

3
3 9
5 21
5 16

输出样例

1 3
1 1
5 2

来源

zsu

作者

200831000423

解题思路

上年校赛选拔的时候没做出来却将蛇形矩阵的规律找出来并打印出来，后来无疑肯定是TLE。数据量大就得找规律，解题的办法是找到这个数m在哪个圈子里。通过5*5矩阵可以找出斜线上在不同圈子里数之间的关系，打表存储，在给出数据的时候通过打表的值判断这个数在哪个圈子里然后在这个圈子里找对应的数的位置，具体看实现的代码

 #include<iostream>
  #include<cstdio>
  #include<string>
  #include<cstring>
  #include<algorithm>
  #define MAXN 34000

  using namespace std;

 int list[MAXN/];

 void init()
 {//打表存储斜线上的值
     for(int i=; i<MAXN/; ++i)
     {
         if(!i) list[i] = ;
         else list[i] = *i-+list[i-];
     }
 }

  int main()
  {
      #ifndef ONLINE_JUDGE
      freopen("F:\\test\\input.txt", "r", stdin);
      #endif // ONLINE_JUDGE
      init();
      int T, row, column;
      cin>>T;
      while(T--)
      {
          int n, m;
          cin>>n>>m;
          int circle = -, cnt = , dis;
          while(list[++circle] < m);
          column = row = n/+-circle;
          dis = list[circle] - m; //仍需要移动的步数
          //找到圈子的情况下进一步处理数据找到最终的位置
          if(dis <= circle*)
          {
              if(dis <= circle*) row = row + dis;
              else
              {
                  row = row + circle*;
                  column = column + (dis - circle*);
              }
          }
          else
          {
              int temp = dis - circle*;
              if(temp <= circle*-)
              {
                  row = row + circle* - temp;
                  column = column + circle*;
              }
              else
              {
                  temp = temp - (circle*-);
                  row = row + ;
                  column = column + circle* - temp;
              }
          }
         cout<<row<<" "<<column<<endl;
      }

      return ;
  }