Submission #1442227

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int N,Q;
ll W[101010],T[101010],X[101010];
ll add[3][3710000];

int day[101010];
ll num[4000000];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>Q;
	priority_queue<pair<ll,int>> P;
	FOR(i,N) {
		cin>>W[i]>>T[i]>>X[i];
		P.push({-W[i],i});
	}
	
	ll cur[3]={};
	ll tot=0;
	for(i=0;i<=3700000;i++) {
		tot += cur[0] + cur[1]*i + cur[2]*i*i;
		if(i==0) cur[0]++;
		num[i]=tot;
		while(P.size() && tot>=-P.top().first) {
			x = P.top().second;
			P.pop();
			day[x]=i;
			num[i]++;
			if(T[x]==0) {
				cur[0]++;
				add[0][i+X[x]]--;
			}
			else if(T[x]==1) {
				cur[0]-=i;
				add[0][i+X[x]]+=i;
				cur[1]++;
				add[1][i+X[x]]--;
			}
			else if(T[x]==2) {
				cur[0]+=1LL*i*i;
				add[0][i+X[x]]-=1LL*i*i;
				cur[1]-=2LL*i;
				add[1][i+X[x]]+=2LL*i;
				cur[2]++;
				add[2][i+X[x]]--;
			}
			
		}
		cur[0]+=add[0][i];
		cur[1]+=add[1][i];
		cur[2]+=add[2][i];
	}
	
	FOR(i,N) {
		if(day[i]==0 || day[i]>3652425) cout<<"Many years later"<<endl;
		else cout<<day[i]<<endl;
	}
	FOR(i,Q) {
		cin>>x;
		cout<<num[x]<<endl;
	}
	
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n';
	FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	solve(); return 0;
}

Submission Info

Judge Result