NOI批量评测 - 记录详情

foo.cc: In member function 'void SEGMENT_TREE::build(int, int, int)':
foo.cc:77:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   77 |         #define mid (l+r>>1)
      |                      ~^~
foo.cc:91:31: note: in expansion of macro 'mid'
   91 |                 build(ls(p),l,mid);
      |                               ^~~
foo.cc:77:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   77 |         #define mid (l+r>>1)
      |                      ~^~
foo.cc:92:29: note: in expansion of macro 'mid'
   92 |                 build(rs(p),mid+1,r);
      |                             ^~~
foo.cc: In member function 'long long int SEGMENT_TREE::query(int, int, int, int)':
foo.cc:77:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   77 |         #define mid (l+r>>1)
      |                      ~^~
foo.cc:115:25: note: in expansion of macro 'mid'
  115 |                 if(pos<=mid) return query(ls(p),l,mid,pos);
      |                         ^~~
foo.cc:77:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   77 |         #define mid (l+r>>1)
      |                      ~^~
foo.cc:115:51: note: in expansion of macro 'mid'
  115 |                 if(pos<=mid) return query(ls(p),l,mid,pos);
      |                                                   ^~~
foo.cc:77:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   77 |         #define mid (l+r>>1)
      |                      ~^~
foo.cc:116:41: note: in expansion of macro 'mid'
  116 |                 else return query(rs(p),mid+1,r,pos);
      |                                         ^~~
foo.cc: In member function 'std::pair<long long int, long long int> SEGMENT_TREE::query1(int, int, int, int, int, long long int)':
foo.cc:77:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   77 |         #define mid (l+r>>1)
      |                      ~^~
foo.cc:130:41: note: in expansion of macro 'mid'
  130 |                 PLL resl=query1(ls(p),l,mid,beg,en,x),resr=query1(rs(p),mid+1,r,beg,en,x);
      |                                         ^~~
foo.cc:77:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   77 |         #define mid (l+r>>1)
      |                      ~^~
foo.cc:130:73: note: in expansion of macro 'mid'
  130 |                 PLL resl=query1(ls(p),l,mid,beg,en,x),resr=query1(rs(p),mid+1,r,beg,en,x);
      |                                                                         ^~~
foo.cc: In member function 'std::pair<long long int, long long int> SEGMENT_TREE::query2(int, int, int, int, int, long long int)':
foo.cc:77:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   77 |         #define mid (l+r>>1)
      |                      ~^~
foo.cc:146:41: note: in expansion of macro 'mid'
  146 |                 PLL resl=query2(ls(p),l,mid,beg,en,x),resr=query2(rs(p),mid+1,r,beg,en,x);
      |                                         ^~~
foo.cc:77:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   77 |         #define mid (l+r>>1)
      |                      ~^~
foo.cc:146:73: note: in expansion of macro 'mid'
  146 |                 PLL resl=query2(ls(p),l,mid,beg,en,x),resr=query2(rs(p),mid+1,r,beg,en,x);
      |                                                                         ^~~
Expand

#	状态分数	耗时	内存占用

#1	Accepted 4	1ms	408 KiB
#2	Accepted 4	1ms	404 KiB
#3	Accepted 4	1ms	404 KiB
#4	Accepted 4	2ms	404 KiB
#5	Accepted 4	1ms	404 KiB
#6	Accepted 4	2ms	404 KiB
#7	Accepted 4	1ms	404 KiB
#8	Accepted 4	5ms	916 KiB
#9	Accepted 4	5ms	920 KiB
#10	Accepted 4	6ms	916 KiB
#11	Accepted 4	5ms	916 KiB
#12	Accepted 4	138ms	15.3 MiB
#13	Accepted 4	184ms	15.4 MiB
#14	Accepted 4	169ms	15.3 MiB
#15	Accepted 4	162ms	15.4 MiB
#16	Accepted 4	181ms	15.3 MiB
#17	Accepted 4	152ms	15.4 MiB
#18	Accepted 4	172ms	15.4 MiB
#19	Accepted 4	630ms	32.7 MiB
#20	Accepted 4	533ms	32.7 MiB
#21	Accepted 4	504ms	32.7 MiB
#22	Accepted 4	491ms	32.7 MiB
#23	Accepted 4	456ms	32.7 MiB
#24	Accepted 4	405ms	32.7 MiB
#25	Accepted 4	437ms	32.7 MiB

#include<bits/stdc++.h>
#define ll long long
#define ul unsigned long long
#define PII pair<int,int>
#define PLL pair<long long,long long>
#define pb push_back
#define fi first
#define se second
#define endl '\n'
using namespace std;
template <typename T> T read(){
	T s=0,f=1;
	char ch=getchar();
	while(!isdigit(ch)){
		if(ch=='-') f=-1;
		ch=getchar();
	}
	while(isdigit(ch)){
		s=(s<<1)+(s<<3)+(ch^48);
		ch=getchar();
	}
	return s*f;
}
#define read() read<ll>()
void write_(int x){
	if(x<0){
		putchar('-');
		x=-x;
	}
	if(x>9) write_(x/10);
	putchar((x%10)^48);
	return;
}
void write(int x){
	write_(x);
	putchar('\n');
	return;
}
template <typename T> void getmax(T &x,T y){
	if(y>x) x=y;
	return;
}
template <typename T> void getmin(T &x,T y){
	if(y<x) x=y;
	return;
}
const ll INF=1e9;
const ll MOD=998244353;
ll kmi(ll a,ll b){
	ll res=1;
	while(b){
		if(b&1) res=res*a%MOD;
		a=a*a%MOD;
		b>>=1;
	}
	return res;
}
template <typename T> void getadd(T &x,T y){
	x+=y;
	if(x>=MOD) x-=MOD;
	return;
}
int ID,T;
int n;
struct node{
	ll a,b,t,id;
	bool operator < (const node &w) const{
		return t<w.t;
	}
}q[200005],q2[200005];
struct SEGMENT_TREE{
	ll mx[800005],mn[800005];
	ll len[800005],sum[800005];
	ll cov[800005];
	#define ls(x) (x<<1)
	#define rs(x) (x<<1|1)
	#define mid (l+r>>1)
	void pushup(int p){
		mx[p]=max(mx[ls(p)],mx[rs(p)]);
		mn[p]=min(mn[ls(p)],mn[rs(p)]);
		sum[p]=sum[ls(p)]+sum[rs(p)];
		return;
	}
	void build(int p,int l,int r){
		len[p]=r-l+1;
		cov[p]=-1e18;
		if(l==r){
			mx[p]=mn[p]=sum[p]=q[l].a-q[l].id;
			return;
		}
		build(ls(p),l,mid);
		build(rs(p),mid+1,r);
		pushup(p);
		return;
	}
	void getcov(int p,ll x){
		mx[p]=mn[p]=x;
		sum[p]=x*len[p];
		cov[p]=x;
		return;
	}
	void pushdown(int p){
		if(cov[p]>-1e18){
			getcov(ls(p),cov[p]);
			getcov(rs(p),cov[p]);
			cov[p]=-1e18;
		}
		return;
	}
	ll query(int p,int l,int r,int pos){
		if(l==r){
			return mx[p];
		}
		pushdown(p);
		if(pos<=mid) return query(ls(p),l,mid,pos);
		else return query(rs(p),mid+1,r,pos);
	}
	PLL query1(int p,int l,int r,int beg,int en,ll x){
		if(l>en||r<beg) return {0,0};
		if(mn[p]>x) return {0,0};
		if(l>=beg&&r<=en&&mx[p]==mn[p]){
			if(mn[p]<=x){
				PLL res={sum[p],len[p]};
				getcov(p,x);
				return res;
			}
			else return {0,0};
		}
		pushdown(p);
		PLL resl=query1(ls(p),l,mid,beg,en,x),resr=query1(rs(p),mid+1,r,beg,en,x);
		pushup(p);
		return {resl.fi+resr.fi,resl.se+resr.se};
	}
	PLL query2(int p,int l,int r,int beg,int en,ll x){
		if(l>en||r<beg) return {0,0};
		if(mx[p]<x) return {0,0};
		if(l>=beg&&r<=en&&mx[p]==mn[p]){
			if(mn[p]>=x){
				PLL res={sum[p],len[p]};
				getcov(p,x);
				return res;
			}
			else return {0,0};
		}
		pushdown(p);
		PLL resl=query2(ls(p),l,mid,beg,en,x),resr=query2(rs(p),mid+1,r,beg,en,x);
		pushup(p);
		return {resl.fi+resr.fi,resl.se+resr.se};
	}
}tr;
int main(){
	freopen("move.in","r",stdin);
	freopen("move.out","w",stdout);
	cin>>ID>>T;
	while(T--){
		bool flag=1;
		cin>>n;
		for(int i=1;i<=n;++i){
			ll a=read(),b=read(),t=read(),id=i;
			q[i]=q2[i]={a,b,t,id};
		}
		tr.build(1,1,n);
		sort(q2+1,q2+n+1);
		ll sum=0;
		for(int i=1;i<=n;++i){
			if(q2[i].b==q2[i].a);
			else if(q2[i].b>q2[i].a){
				PLL res=tr.query1(1,1,n,q2[i].id,n,q2[i].b-q2[i].id);
				sum+=(q2[i].b-q2[i].id)*res.se-res.fi;
			}
			else if(q2[i].b<q2[i].a){
				PLL res=tr.query2(1,1,n,1,q2[i].id,q2[i].b-q2[i].id);
				sum+=res.fi-(q2[i].b-q2[i].id)*res.se;
			}
			if(sum>q2[i].t){
				flag=0;
				break;
			}
		}
		if(flag) puts("Yes");
		else puts("No");
	}
	
	return 0;
}
/*
q[i].b>q[i].a
q[j].id>=q[i].id
q[i].b-q[i].id-(q[j].a-q[j].id)>=0
q[j].a-q[j].id=q[i].b-q[i].id

q[i].b<q[i].a
q[j].id<=q[i].id
q[j].a-q[j].id-(q[i].b-q[i].id)>=0
q[j].a-q[j].id=q[i].b-q[i].id



*/

递交者: SC-132
题目: NOISX2025GFD NOISX2025GFD
比赛: 【官方数据 SC】联合省选 2025 批量测试
语言: C++14(O2)
代码长度: 3.7 KiB
递交时间: 2025-3-6 14:04:00
评测时间: 2025-3-6 14:14:23

分数: 100
总耗时: 4646ms
峰值时间: 630ms
峰值内存: 32.7 MiB

100 Accepted

代码

信息

100 Accepted

代码

信息

还没有账户？

登录