蒟蒻求助!样例过了 但全wa
查看原帖
蒟蒻求助!样例过了 但全wa
757278
Fucktheworld楼主2023/10/14 17:54
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e5+10;
struct L{
	int num,sum,ti;
}a[N],p[N];
int cnt,ans,l=0;
int n;
bool v[N];
signed main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i].num>>a[i].sum>>a[i].ti;
	}
	ans+=a[1].sum;
	if(a[1].num==0){
		l=1;
		cnt++;
		p[cnt].ti=a[1].ti+45;
		p[cnt].sum=a[1].sum;
	}
	for(int i=2;i<=n;i++){
		if(l!=0&&p[l].ti<a[i].ti){
			l++;
		}
		if(a[i].num==0){
			if(l==0){
				l=1;
			}
			if(l>cnt){
				l=cnt+1;
			}
			++cnt;
			p[cnt].sum=a[i].sum;
			p[cnt].ti=a[i].ti+45;
			ans+=a[i].sum;
		}
		else{
			if(l>cnt){
				ans+=a[i].sum;
			}
			else{
				bool flag=0;
				for(int j=l;j<=cnt;j++){
					if(p[j].sum>=a[i].sum&&!v[j]){
						v[j]=1;
						flag=1;
						break;
					}
				}
				if(flag==0){
					ans+=a[i].sum;
				}
				
			}
		}
		//cout<<a[i].num<<" "<<a[i].sum<<" "<<a[i].ti<<" "<<ans<<" "<<l<<" "<<p[l].ti<<endl;
	}
	cout<<ans;
	return 0;
 }
2023/10/14 17:54
加载中...