Submission #35696627

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
map<int, set<int> > r, c;
int n, m, sx, sy, o, x, y, q, l;
char d;
int main()
{
	cin >> n >> m >> sx >> sy >> o;
	for (int i = 0; i < o; i++)
	{
		cin >> x >> y;
		r[x].insert(y);
		c[y].insert(x);
	}
	cin >> q;
	for (int i = 0; i < q; i++)
	{
		cin >> d >> l;
		if (d == 'L')
		{
			r[sx].insert(0);
			int p = *--r[sx].upper_bound(sy);
			sy = max(sy - l, p + 1);
		}
		else if (d == 'R')
		{
			r[sx].insert(m + 1);
			int p = *r[sx].upper_bound(sy);
			sy = min(sy + l, p - 1);			
		}
		else if (d == 'U')
		{
			c[sy].insert(0);
			int p = *--c[sy].upper_bound(sx);
			sx = max(sx - l, p + 1);
		}
		else
		{
			c[sy].insert(n + 1);
			int p = *c[sy].upper_bound(sx);
			sx = min(sx + l, p - 1);
		}
		printf("%d %d\n", sx, sy);
	}
	return 0;
}

Submission Info

Judge Result