ABC D
  • 板块学术版
  • 楼主hytallenxu
  • 当前回复2
  • 已保存回复2
  • 发布时间2024/12/28 21:40
  • 上次更新2024/12/29 10:24:33
查看原帖
ABC D
726098
hytallenxu楼主2024/12/28 21:40

WA on 5个测试点 求调

#include <bits/stdc++.h>
#define int long long
#ifdef LOCAL
	#include "debug.h"
#else
	#define debug(...) 42
#endif
#define mkp make_pair
#define pb emplace_back
#define endl "\n"
using namespace std;
using ll = long long;
int n,m,t,cnt=0;
constexpr int maxn=2e5+10;
struct node{
	int x,y;
	bool num;
}arr[maxn];

map<int,int> mp,mp2;
void insert(int x, int y){mp.emplace(x,y);mp2.emplace(y,x);}

bool query(int x, int y){
	if(mp.empty()) return 0;
	auto it=mp.upper_bound(x);
	if(it==mp.begin()) return 0;
	it--;
	return it->first<=x && it->second<=y;
}

signed main(){
	cin.tie(nullptr)->sync_with_stdio(0);
	cin>>n>>m;
	for(int i=1;i<=m;i++){
		char op;
		cin>>arr[i].x>>arr[i].y>>op;
		if(op=='B'){
			arr[i].num=1;
		}
		else{
			arr[i].num=0;
			insert(arr[i].x,arr[i].y);
		}
	}
	for(int i=1;i<=m;i++){
		if(arr[i].num){
			int x=arr[i].x,y=arr[i].y;
			if(query(x,y)){
				cout<<"No"<<endl;
				return 0;
			}
		}
	}
	cout<<"Yes"<<endl;
	return 0;
}
2024/12/28 21:40
加载中...