rt. 我的这份 $O(Qn\log n)$ 代码可以通过 9~10

while(Q--){
			int op,x,y;
			cin>>op>>x>>y;
			if(op==1)a[x]+=y;
			else{
				long long mx=0;
				s[x-1]=0;
				for(int i=x;i<=y;i++){
					s[i]=s[i-1]+a[i];
					mx=max(mx,a[i]);
				}
				if(c[0]>=y-x+1&&s[y]<=w[0])cout<<"cont\n";
				else{
					bool fg=0;
					for(int i=x;i<=y;i++){
						int l=i,r=y,mid;
						while(l<=r){
							mid=l+r>>1;
							if(s[mid]-s[i-1]>w[1])r=mid-1;
							else l=mid+1;
						}
						if(l<=y&&l-i+1<=c[1])fg=1;
					}
					if(fg||mx>w[0])cout<<"tetris\n";
					else cout<<"cont\n";
				}
			}
		}