73分求调,WA on #6,7,8
  • 板块P1250 种树
  • 楼主Maysoul
  • 当前回复4
  • 已保存回复4
  • 发布时间2023/4/2 16:30
  • 上次更新2023/10/23 19:37:49
查看原帖
73分求调,WA on #6,7,8
409774
Maysoul楼主2023/4/2 16:30
//2023/4/1
#include<bits/stdc++.h>
#define int long long 
using namespace std;
const int MAXN=1e6+10;
int num,ans;
struct house{
	int b;
	int e;
	int t;
}a[50010];
bool vis[300100];
bool cmp(house x,house y)
{
	return x.e<y.e;
}
signed main()
{
	int n,m;
	cin>>n>>m;
	for (int i=1;i<=m;i++)
	{
		cin>>a[i].b>>a[i].e>>a[i].t;
	}
	sort(a+1,a+1+m,cmp);
	for (int i=1;i<=n;i++)
	{
		for (int j=a[i].b;j<=a[i].e;j++)
		{
			if(vis[j]==1)
			{
				a[i].t--;
			}
		}
		for (int j=a[i].e;j>=a[i].b;j--)
		{
			if(a[i].t<=0)
			{
				break;
			}
			if (vis[j]==0)
			{
				vis[j]=1;
				a[i].t--;
				ans++;
			} 
		} 
	}
	cout<<ans<<endl;
	return 0;
}

2023/4/2 16:30
加载中...