QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#560989#9242. An Easy Geometry ProblemyhdddWA 8ms12088kbC++202.4kb2024-09-12 19:21:112024-09-12 19:21:13

Judging History

你现在查看的是最新测评结果

  • [2024-09-12 19:21:13]
  • 评测
  • 测评结果:WA
  • 用时:8ms
  • 内存:12088kb
  • [2024-09-12 19:21:11]
  • 提交

answer

#include<bits/stdc++.h>
#define int long long
#define ull unsigned long long
#define mod 998244353ll
#define pii pair<int,int>
#define fi first
#define se second
#define mems(x,y) memset(x,y,sizeof(x))
#define pb push_back
using namespace std;
const int maxn=200010;
const int inf=1e18;
inline int read(){
	int x=0,f=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+(ch-48);ch=getchar();}
	return x*f;
}
bool Mbe;

int n,q,k,b,a[maxn],c[maxn];
ull bas,pw[maxn];
#define mid (l+r>>1)
#define ls nd<<1
#define rs nd<<1|1
ull h1[maxn<<2],h2[maxn<<2];
void build(int nd,int l,int r){
	if(l==r){
		h1[nd]=c[l];
		h2[nd]=k-c[l];
		return ;
	}
	build(ls,l,mid),build(rs,mid+1,r);
	h1[nd]=h1[ls]*pw[mid-l+1]+h1[rs];
	h2[nd]=h2[ls]+h2[rs]*pw[r-mid];
}
void updata(int nd,int l,int r,int p){
	if(l==r){
		h1[nd]=c[l];
		h2[nd]=k-c[l];
		return ;
	}
	if(p<=mid)updata(ls,l,mid,p);
	else updata(rs,mid+1,r,p);
	h1[nd]=h1[ls]*pw[mid-l+1]+h1[rs];
	h2[nd]=h2[ls]+h2[rs]*pw[r-mid];
}
ull query(int nd,int l,int r,int ql,int qr,bool fl){
	if(l>=ql&&r<=qr){
		if(!fl)return h1[nd];
		else return h2[nd];
	}
	if(qr<=mid)return query(ls,l,mid,ql,qr,fl);
	if(ql>mid)return query(rs,mid+1,r,ql,qr,fl);
	if(!fl)return query(ls,l,mid,ql,qr,fl)*pw[mid-max(l,ql)+1]+query(rs,mid+1,r,ql,qr,fl);
	else return query(ls,l,mid,ql,qr,fl)+query(rs,mid+1,r,ql,qr,fl)*pw[min(r,qr)-mid];
}
#undef mid
mt19937 rnd(1);
bool check(int p,int x){
	return query(1,1,n,p+2,p+x,0)==query(1,1,n,p-x+1,p-1,1);
}
void work(){
	n=read();q=read();k=read();b=read();
	for(int i=1;i<=n;i++)a[i]=read(),c[i]=a[i]-a[i-1];
	bas=rnd();pw[0]=1;for(int i=1;i<=n;i++)pw[i]=pw[i-1]*bas;
	build(1,1,n);
	while(q--){
		int op=read();
		if(op==1){
			int l=read(),r=read(),w=read();
			c[l]+=w,updata(1,1,n,l);
			if(r<n)c[r+1]-=w,updata(1,1,n,r+1);
		}
		else{
			int p=read();
			if(c[p]+c[p+1]!=k+b)puts("0");
			else{
				int l=2,r=min(p-1,n-p),res=1;
				while(l<=r){
					int mid=l+r>>1;
					if(check(p,mid))l=mid+1,res=mid;
					else r=mid-1;
				}
				printf("%lld\n",res);
			}
		}
	}
}

// \
444

bool Med;
int T;
signed main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	
//	ios::sync_with_stdio(0);
//	cin.tie(0);cout.tie(0);
	
//	cerr<<(&Mbe-&Med)/1048576.0<<" MB\n";
	
	T=1;
	while(T--)work();
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 2ms
memory: 9976kb

input:

6 6 6 2
1 5 9 10 15 18
2 2
1 3 3 -3
2 2
1 3 4 3
2 3
2 4

output:

1
0
2
0

result:

ok 4 number(s): "1 0 2 0"

Test #2:

score: -100
Wrong Answer
time: 8ms
memory: 12088kb

input:

5000 5000 2 0
-329 -328 -327 -326 -325 -324 -323 -322 -321 -320 -319 -318 -317 -316 -315 -314 -313 -312 -311 -310 -309 -308 -307 -306 -305 -304 -303 -302 -301 -300 -299 -298 -297 -296 -295 -294 -293 -292 -291 -290 -289 -288 -287 -286 -285 -284 -283 -282 -281 -280 -279 -278 -277 -276 -275 -274 -273 -...

output:

2
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
5
3
5
3
5
5
3
3
1
3
3
4
3
4
3
4
3
5
3
3
3
1
3
3
3
3
3
3
5
3
1
3
3
3
3
3
3
3
3
5
3
5
3
2
3
5
3
5
5
3
5
3
3
3
5
2
3
3
3
3
3
3
4
5
3
3
3
3
3
1
5
3
4
3
2
3
3
3
3
3
3
3
5
3
3
3
3
3
3
5
3
3
5
3
3
5
3
3
3
3
2
3
3
4
3
3
3
3
3
3
3
3
5
3
3
3
0
3
3
3
3
3
3
1
3
3
3
3
2
3
5
...

result:

wrong answer 2nd numbers differ - expected: '304', found: '3'