题目链接：https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&category=648&page=show_problem&problem=5151
You have a rectangle of size N × M, N rows from top to bottom and M columns from left to right,
that is divided into a grid of unit squares. The corners and sides of those squares will be called grid
points and grid lines, respectively.
You are given a path along some grid lines. The path satisfies the following properties:
• Both start and end of the path are at the top left grid point.
• Each step is to go along the grid line (i.e., move up, down, left, or right).
You need to calculate the square sum of all the rotation values in each all. The definition of the
notation value in each cell is below.
Suppose there is a moving car at the path and a person stands at the center of the cell. The person
is facing the car all the time. After the path is finished, the rotation value of the grid equals to the
net number of clockwise turns the person would make if he stood in that square. (In other words, if
the person standing in that square rotate by the same total amount clockwise and counterclockwise,
the rotation value is 0. If the person’s total clockwise rotation is 360x degrees more than the person’s
total counterclockwise rotation, the rotation value of the cell is x. If the person’s total couuterclockwise
rotation is 360x degrees more than the person’s total clockwise rotation, the rotation value of the cell
is −x)
Input
The first line of the input gives the number of test cases, T. T cases follow. For each test case, the first
line contains three numbers, N, M and K. The next K line describes the steps of the path. Each line
containing ‘d s’, where d is one of the four characters (‘U’ for up, ‘D’ for down, ‘L’ for left, ‘R’ for right)
means the direction of the step and s is the length of the step.
It is guaranteed that the path is inside the grid.
Output
For each test case, output one line containing ‘Case #x: y’, where x is the test case number (starting
from 1) and y is square sum of all the rotation values of each cell.

题目大意：给一个n*m的矩阵，每个方块上有一个人。现在有一辆车在左上角的格点处，矩阵里的人都会一直面向那辆车。现在给出车的移动路线，问每个人总旋转角度的平方和是多少。若一个人顺时针旋转10个圈，逆时针旋转15个圈，最终算旋转角度为5个圈。
思路：根据题意，车一定会回到原点，那么每个人的初始面向方向与最终面向方向相同，每个人旋转的圈数都必将是整数。
若车在人的正左方下降了X次，上升了Y次，那么那个人的旋转圈数便是abs(X-Y)。（不要问我为什么，多想想多想想）

然后暴力模拟车的移动：

在车向下移动的时候，我们就要给车影响右方的一个矩阵加上1。
在车向上移动的时候，我们就要给车影响右方的一个矩阵减去1。
为了给一个矩阵加上一个值，因为本题只需要最终结果，可以使用静态的矩阵前缀和的方式处理。
最后求出矩阵，直接累加结果即可。

代码（0.249S）：

 #ifdef OYK_JUDGE

 #define longformat "%I64d"

 #else

 #define longformat "%lld"

 #endif // OYK_JUDGE

 #include <iostream>

 #include <cstdio>

 #include <algorithm>

 #include <cstring>

 #include <vector>

 using namespace std;

 typedef long long LL;

 vector<vector<int> > mat;

 int T, n, m, k;

 char str[] = "RDLU";

 int fr[] = {, , , -};

 int fc[] = {, , -, };

 void modify(int c, int r1, int r2, int val) {

     mat[r1][c] += val;

     mat[r2][c] -= val;

 }

 LL solve() {

     int step, r = , c = ;

     char op;

     while(k--) {

         scanf(" %c%d", &op, &step);

         if(op == 'D') modify(c, r, r + step, );

         if(op == 'U') modify(c, r - step, r, -);

         int f = strchr(str, op) - str;

         r += step * fr[f];

         c += step * fc[f];

     }

     LL res = ;

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

         for(int j = ; j <= m; ++j) {

             mat[i][j] = mat[i][j] + mat[i - ][j] + mat[i][j - ] - mat[i - ][j - ];

             res += mat[i][j] * mat[i][j];

         }

     return res;

 }

 int main() {

     scanf("%d", &T);

     for(int t = ; t <= T; ++t) {

         scanf("%d%d%d", &n, &m, &k);

         mat = vector<vector<int> >(n + , vector<int>(m + , ));

         LL res = solve();

         printf("Case #%d: " longformat "\n", t, res);

     }

 }