CF - 724C 模拟 + STL

题意：

给出的一个n*m的矩形区域，另外给出k个点的坐标，在初始时刻0从坐标原点想由上方45度射出一条射线，射线的速度为根号2，遇到墙壁会按照反射定律反射，问对于每个询问的点，计算出射线到达该点的时间，如果没到达就输出-1。

思路：

n和m都是1e5级别，对于每个点，都只有两条直线可以穿过它，且斜率k是+1或者-1，用map嵌套set来报存每一条直线上存在的点。然后设置一个当前反射点的坐标x,y,当前时间，模拟一下射线的移动过程即可。

代码：

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 1e5 + 10;

struct node {
    int x, y;
}a[MAXN];

map <int, set <int> > mp[2];
set <int> :: iterator it;
ll ans[MAXN];

int main() {
    //freopen("in", "r", stdin);
    int n, m, p;
    scanf("%d%d%d", &m, &n, &p);
    for (int i = 1; i <= p; i++) {
        scanf("%d%d", &a[i].x, &a[i].y);
        mp[0][a[i].y - a[i].x].insert(i);
        mp[1][a[i].x + a[i].y].insert(i);
    }
    int k = 0, b = 0, nx = 0, ny = 0;
    ll nt = 0;
    memset(ans, -1, sizeof(ans));
    while (true) {
        for (it = mp[k][b].begin(); it != mp[k][b].end(); it++) {
            //if (ans[*it] != -1) continue;
            int x = a[*it].x, y = a[*it].y;
            ans[*it] = nt + (ll)abs(x - nx);
            if (k == 0) mp[1][x + y].erase(*it);
            else mp[0][y - x].erase(*it);
        }
        int kk = k == 0 ? 1 : -1;
        int xx[4] = {0, -b / kk, m, (n - b) / kk};
        int yy[4] = {b, 0, kk * m + b, n};
        int tx = nx, ty = ny;
        for (int i = 0; i < 4; i++) {
            if (xx[i] >= 0 && xx[i] <= m && yy[i] >= 0 && yy[i] <= n && xx[i] != tx && yy[i] != ty) {
                nt += (ll)abs(xx[i] - tx);
                nx = xx[i];
                ny = yy[i];
            }
        }
        if ((nx == m && ny == n) || (nx == 0 && ny == 0) || (nx == m && ny == 0) || (nx == 0 && ny == n)) break;
        kk = -kk;
        b = ny - kk * nx;
        k = kk == 1 ? 0 : 1;
    }
    for (int i = 1; i <= p; i++)
        printf("%I64d\n", ans[i]);
    return 0;
}