Submission #48925624

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fir first
#define sec second
int h, w, n;
int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, -1, 1};
int sx, sy;
map<int, set<int> > mph, mpl;
map<char, int> mpc;
int q;
void init() {
	mpc['U'] = 0;
	mpc['D'] = 1;
	mpc['L'] = 2;
	mpc['R'] = 3;
}
signed main() {
	init();
	cin >> h >> w >> sx >> sy;
	cin >> n;
	for(int i = 1, r, c; i <= n; i++) {
		cin >> r >> c;
		mph[r].insert(c);
		mph[r].insert(0);
		mph[r].insert(2e9);
		mpl[c].insert(r);
		mpl[c].insert(0);
		mpl[c].insert(2e9);
	}
	cin >> q;
	int x = sx, y = sy;
	while(q--) {
		char ch;
		int l;
		cin >> ch >> l;
		int d = mpc[ch];
		int nx = x + dx[d] * l;
		nx = max(1ll, nx);
		nx = min(nx, h);
		int ny = y + dy[d] * l;
		ny = max(1ll, ny);
		ny = min(ny, w);
		if(d == 0) {
			if(!mpl[ny].empty()) {
				int temp = *lower_bound(mpl[ny].rbegin(), mpl[ny].rend(), x, [](int xx, int yy) {
					return xx > yy;
				});
				if(temp >= nx && temp <= x) {
					x = temp + 1;
				}
				else {
					x = nx;
				}
			}
			else {
				x = nx;
			}
		}
		else if(d == 1) {
			if(!mpl[ny].empty()) {
				int temp = *lower_bound(mpl[ny].begin(), mpl[ny].end(), x);
				if(temp >= x && temp <= nx) {
					x = temp - 1;
				}
				else {
					x = nx;
				}
			}
			else {
				x = nx;
			}
		}
		else if(d == 2) {
			if(!mph[nx].empty()) {
				int temp = *lower_bound(mph[nx].rbegin(), mph[nx].rend(), y, [](int xx, int yy) {
					return xx > yy;
				});
				if(temp >= ny && temp <= y) {
					y = temp + 1;
				}
				else {
					y = ny;
				}
			}
			else {
				y = ny;
			}
		}
		else if(d == 3) {
			if(!mph[nx].empty()) {
				int temp = *lower_bound(mph[nx].begin(), mph[nx].end(), y);
				if(temp >= y && temp <= ny) {
					y = temp - 1;
				}
				else {
					y = ny;
				}
			}
			else {
				y = ny;
			}
		}
//		cout << "    ";
		cout << x << " " << y << "\n";
	}
	return 0;
}

Submission Info

Judge Result