CodeForces - 385E Bear in the Field —

题目链接：https://vjudge.net/problem/CodeForces-385E

E. Bear in the Field

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Our bear's forest has a checkered field. The checkered field is an n × n table, the rows are numbered from 1 to n from top to bottom, the columns are numbered from 1 to n from left to right. Let's denote a cell of the field on the intersection of row x and column y by record (x, y). Each cell of the field contains growing raspberry, at that, the cell (x, y) of the field contains x + y raspberry bushes.

The bear came out to walk across the field. At the beginning of the walk his speed is (dx, dy). Then the bear spends exactly t seconds on the field. Each second the following takes place:

Let's suppose that at the current moment the bear is in cell (x, y).
First the bear eats the raspberry from all the bushes he has in the current cell. After the bear eats the raspberry from k bushes, he increases each component of his speed by k. In other words, if before eating the k bushes of raspberry his speed was (dx, dy), then after eating the berry his speed equals (dx + k, dy + k).
Let's denote the current speed of the bear (dx, dy) (it was increased after the previous step). Then the bear moves from cell (x, y) to cell (((x + dx - 1) mod n) + 1, ((y + dy - 1) mod n) + 1).
Then one additional raspberry bush grows in each cell of the field.

You task is to predict the bear's actions. Find the cell he ends up in if he starts from cell (sx, sy). Assume that each bush has infinitely much raspberry and the bear will never eat all of it.

Input

The first line of the input contains six space-separated integers: n, sx, sy, dx, dy, t(1 ≤ n ≤ 109; 1 ≤ sx, sy ≤ n; - 100 ≤ dx, dy ≤ 100; 0 ≤ t ≤ 1018).

Output

Print two integers — the coordinates of the cell the bear will end up in after t seconds.

Examples

input

5 1 2 0 1 2

output

3 1

input

1 1 1 -1 -1 2

output

1 1

Note

Operation a mod b means taking the remainder after dividing a by b. Note that the result of the operation is always non-negative. For example, ( - 1) mod 3 = 2.

In the first sample before the first move the speed vector will equal (3,4) and the bear will get to cell (4,1). Before the second move the speed vector will equal (9,10) and he bear will get to cell (3,1). Don't forget that at the second move, the number of berry bushes increased by 1.

In the second sample before the first move the speed vector will equal (1,1) and the bear will get to cell (1,1). Before the second move, the speed vector will equal (4,4) and the bear will get to cell (1,1). Don't forget that at the second move, the number of berry bushes increased by 1.

题解：

1.为了方便取模，把x、y轴都改成从0开始，最后加1即可。设（sx[t], sy[t]）为t时刻的位置，（dx[t], dy[t]）为从t-1到t时间段的速度（偏移量），根据题意，可得：

dx[t] = dx[t-1] + sx[t-1] +1 + sy[t-1]+1 + t-1

dy[t] = dy[t-1] + sx[t-1] +1 + sy[t-1]+1 + t-1

sx[t] = sx[t-1] + dx[t-1] + sx[t-1] +1 + sy[t-1]+1 + t-1

sy[t] = sy[t-1] + dy[t-1] + sx[t-1] +1 + sy[t-1]+1 + t-1

2.根据上述递推式，构造矩阵求解即可。

代码如下：

 #include <iostream>

 #include <cstdio>

 #include <cstring>

 #include <algorithm>

 #include <vector>

 #include <cmath>

 #include <queue>

 #include <stack>

 #include <map>

 #include <string>

 #include <set>

 using namespace std;

 typedef long long LL;

 const int INF = 2e9;

 const LL LNF = 9e18;

 //const int MOD = 1e9+7;

 const int MAXN = 1e6+;

 int MOD;

 const int Size = ;

 struct MA

 {

     LL mat[Size][Size];

     void init()

     {

         for(int i = ; i<Size; i++)

         for(int j = ; j<Size; j++)

             mat[i][j] = (i==j);

     }

 };

 MA mul(MA x, MA y)

 {

     MA ret;

     memset(ret.mat, , sizeof(ret.mat));

     for(int i = ; i<Size; i++)

     for(int j = ; j<Size; j++)

     for(int k = ; k<Size; k++)

         ret.mat[i][j] += (1LL*x.mat[i][k]*y.mat[k][j]%MOD+MOD)%MOD, ret.mat[i][j] %= MOD;

     return ret;

 }

 MA qpow(MA x, LL y)

 {

     MA s;

     s.init();

     while(y)

     {

         if(y&) s = mul(s, x);

         x = mul(x, x);

         y >>= ;

     }

     return s;

 }

 MA tmp = {

     ,,,,,,

     ,,,,,,

     ,,,,,,

     ,,,,,,

     ,,,,,,

     ,,,,,

 };

 int main()

 {

     LL n, sx, sy, dx, dy, t;

     while(scanf("%lld%lld%lld%lld%lld%lld",&n,&sx,&sy,&dx,&dy,&t)!=EOF)

     {

         MOD = n;

         MA s = tmp;

         s = qpow(s, t);

         sx--; sy--;

         LL a[] = {dx,dy,sx,sy,,};

         sx = sy = ;

         for(int i = ; i<Size; i++)

         {

             sx += (1LL*s.mat[][i]*a[i]%MOD+MOD)%MOD, sx %= MOD;

             sy += (1LL*s.mat[][i]*a[i]%MOD+MOD)%MOD, sy %= MOD;

         }

         printf("%lld %lld\n", sx+, sy+);

     }

 }

巴特西

CodeForces - 385E Bear in the Field —— 矩阵快速幂

最新文章

热门文章