Submission #61194268

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <map>
using namespace std;

int n, m;
map<int, map<int, int> > fx, fy;

struct node
{
	int x, y;
	char c;
} ;

node p[200010];

int main()
{
	cin >> n >> m;
	for (int i = 1; i <= m; i++)
	{
		int x, y;
		char c;
		cin >> x >> y >> c;
		p[i] = (node){x, y, c};
		if (c == 'B')
		{
			fx[x][y] = 1;
			fy[y][x] = 1;
		}
	}
	for (int i = 1; i <= m; i++)
	{
		int x = p[i].x;
		int y = p[i].y;
		if (p[i].c == 'B')
			continue;
		map<int, map<int, int> >::iterator po = fx.lower_bound(x);
		map<int, int>::iterator pos;
		if (po != fx.end()) pos = fx[po->first].lower_bound(y);
		if (po != fx.end() && pos != fx[po->first].end())
		{
			cout << "No" << endl;
			return 0;
		}
		po = fy.lower_bound(y);
		if (po != fy.end()) pos = fy[po->first].lower_bound(x);
		if (po != fy.end() && pos != fy[po->first].end())
		{
			cout << "No" << endl;
			return 0;
		}
	}
	cout << "Yes" << endl;
	return 0;
}

Submission Info

Judge Result