oj.uz

답안 #942293

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
942293 2024-03-10T12:05:28 Z MilosMilutinovic 수확 (JOI20_harvest) C++14
100 / 100
 2552 ms 264196 KB 
#include<bits/stdc++.h>
 
#define pb push_back
#define fi first
#define se second
#define mp make_pair
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef long double ld;
 
template <typename T> bool chkmin(T &x,T y){return x>y?x=y,1:0;}
template <typename T> bool chkmax(T &x,T y){return x<y?x=y,1:0;}
 
ll readint(){
	ll 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*10+ch-'0';ch=getchar();}
	return x*f;
}
 
int n,m,l,c,q,T,tsz;
int a[200005],b[200005],prv[200005],deg[200005],rt[600005],fenw[600005],dfn[200005],dfo[200005],cnt[30000005],ls[30000005],rs[30000005],root[600005];
ll d[200005],sum[30000005];
vector<pair<ll,int>> qs[200005];
vector<array<ll,4>> ev;
vector<ll> my[200005];
ll ans[200005];
vector<int> topo,ch[200005];
bool oncyc[200005];
 
ll calc(ll x){return x>=c?x:((c-x+l-1)/l)*1ll*l+x;}
ll divb(ll x,ll y){return x>=0?x-x%y:x-((y+(x%y))%y);}
 
int getprv(int x){
	int d=c%l;
	if(a[1]<=x-d){
		int l=1,r=n,p=1;
		while(l<=r){
			int mid=(l+r)/2;
			if(a[mid]<=x-d) l=mid+1,p=mid; 
			else r=mid-1;
		}
		return p;
	}else{
		int l=1,r=n,p=1;
		while(l<=r){
			int mid=(l+r)/2;
			if(x+::l-a[mid]>=d) l=mid+1,p=mid; 
			else r=mid-1;
		}
		return p;
	}
}
 
void change(int p,int v){
	for(;p<600005;p|=p+1) fenw[p]+=v;  
}
 
int ask(int p){
	int v=0;
	for(;p>=0;p=(p&(p+1))-1) v+=fenw[p];
	return v;
}
 
void dfs1(int x,ll d){
	dfn[x]=++T;
	for(auto&p:my[x]) ev.pb({d+p,0,dfn[x],0});
	for(auto&p:qs[x]) ev.pb({p.fi+d,1,x,p.se});
	for(auto&p:my[x]) my[rt[x]].pb(p+d);
	for(int v:ch[x]){
		rt[v]=rt[x];
		ll w=calc(a[x]<=a[v]?a[v]-a[x]:a[v]+l-a[x]);
		dfs1(v,d+w);
	}
	dfo[x]=T;
}
 
void modifyy(int&id,int l,int r,int p,ll v){
	if(!id) id=++tsz,cnt[id]=sum[id]=ls[id]=rs[id]=0;
	sum[id]+=v;
	cnt[id]++;  
	if(l==r) return;
	int mid=(l+r)/2;
	if(p<=mid) modifyy(ls[id],l,mid,p,v);
	else modifyy(rs[id],mid+1,r,p,v);
}
 
void modifyx(int x,int y,ll v){
	for(;x<600005;x|=(x+1)) modifyy(root[x],0,600005,y,v);
}
 
pair<ll,int> queryy(int id,int l,int r,int ql,int qr){
	if(ql<=l&&r<=qr) return mp(sum[id],cnt[id]);
	int mid=(l+r)/2;
	if(qr<=mid) return queryy(ls[id],l,mid,ql,qr);
	else if(ql>mid) return queryy(rs[id],mid+1,r,ql,qr);
	pair<ll,int> lv=queryy(ls[id],l,mid,ql,qr);
	pair<ll,int> rv=queryy(rs[id],mid+1,r,ql,qr);
	return mp(lv.fi+rv.fi,lv.se+rv.se);
}
 
pair<ll,int> queryx(int x1,int x2,int y1,int y2){
	pair<ll,int> ret=mp(0ll,0);
	for(int x=x2;x>=0;x=(x&(x+1))-1){
		pair<ll,int> f=queryy(root[x],0,600005,y1,y2);
		ret.fi+=f.fi; 
		ret.se+=f.se;
	}
	for(int x=x1-1;x>=0;x=(x&(x+1))-1){
		pair<ll,int> f=queryy(root[x],0,600005,y1,y2);
		ret.fi-=f.fi;
		ret.se-=f.se;
	}
	return ret;
}
 
void clrx(int x){
	for(;x<600005;x|=(x+1)) root[x]=0;
}
 
int main(){
	n=readint(); m=readint(); l=readint(); c=readint();
	for(int i=1;i<=n;i++) a[i]=readint();
	for(int i=1;i<=m;i++) b[i]=readint();
	q=readint();
	for(int i=1;i<=q;i++){
		int v=readint();
		ll t=readint();
		qs[v].pb(mp(t,i));
	}
	for(int i=1;i<=n;i++) prv[i]=getprv(a[i]);
	for(int i=1;i<=m;i++){
		int idx;
		if(a[1]<=b[i]){
			int l=1,r=n;
			while(l<=r){
				int mid=(l+r)/2;
				if(a[mid]<=b[i]) idx=mid,l=mid+1;
				else r=mid-1;
			}
		}else idx=n;
		my[idx].pb((b[i]-a[idx]+l)%l);
	}
	for(int i=1;i<=n;i++) deg[prv[i]]++;
	for(int i=1;i<=n;i++) if(deg[i]==0) topo.pb(i);
	for(int i=0;i<(int)topo.size();i++){
		int v=topo[i];
		deg[prv[v]]--;
		if(deg[prv[v]]==0) topo.pb(prv[v]);
	}
	for(int i=1;i<=n;i++) oncyc[i]=true;
	for(int i:topo) oncyc[i]=false;
	for(int i=1;i<=n;i++) ch[prv[i]].pb(i);
	for(int i=1;i<=n;i++){
		if(oncyc[i]||!oncyc[prv[i]]) continue;
		rt[i]=prv[i];
		ll w=calc(a[prv[i]]<=a[i]?a[i]-a[prv[i]]:a[i]+l-a[prv[i]]);
		T=0;
		ev.clear();
		dfs1(i,w);
		sort(ev.begin(),ev.end());
		for(auto&p:ev){
			if(p[1]==0){
				change(p[2],1);
			}else{
				ans[p[3]]=ask(dfo[p[2]])-ask(dfn[p[2]]-1);
			}
		}
		for(auto&p:ev) if(p[1]==0) change(p[2],-1);
	}
	for(int i=1;i<=n;i++){
		if(!oncyc[i]) continue;
		vector<int> f;
		int ver=i;
		while(oncyc[ver]){
			f.pb(ver);
			oncyc[ver]=false;
			ver=prv[ver];
		}
		int sz=(int)f.size();
		d[0]=0;
		for(int i=1;i<sz;i++){
			ll w=calc(a[f[i]]<=a[f[i-1]]?a[f[i-1]]-a[f[i]]:a[f[i-1]]+l-a[f[i]]);
			d[i]=d[i-1]+w;
		}
		ll len=d[sz-1]+calc(a[f[0]]<=a[f.back()]?a[f.back()]-a[f[0]]:a[f.back()]+l-a[f[0]]);
		if(f.size()==1) len=calc(l);
		vector<ll> xs1,xs2;
		for(int i=0;i<sz;i++){
			for(auto&p:my[f[i]]){
				xs1.pb(d[i]-p);
				xs2.pb(d[i]-p-divb(d[i]-p,len));
			}
			for(auto&p:qs[f[i]]){
				xs1.pb(-(p.fi-d[i]));
				xs2.pb(len-(p.fi-d[i]-divb(p.fi-d[i],len)));
			}
		}
		sort(xs1.begin(),xs1.end());
		xs1.erase(unique(xs1.begin(),xs1.end()),xs1.end());
		sort(xs2.begin(),xs2.end());
		xs2.erase(unique(xs2.begin(),xs2.end()),xs2.end());
		int sz1=(int)xs1.size(),sz2=(int)xs2.size();
		for(int i=0;i<sz;i++){
			for(auto&p:my[f[i]]){
				int idx1=(int)(lower_bound(xs1.begin(),xs1.end(),d[i]-p)-xs1.begin());
				int idx2=(int)(lower_bound(xs2.begin(),xs2.end(),d[i]-p-divb(d[i]-p,len))-xs2.begin());
				modifyx(idx1,idx2,divb(d[i]-p,len)/len);
			}
			for(auto&p:qs[f[i]]){
				int idx1=(int)(lower_bound(xs1.begin(),xs1.end(),-(p.fi-d[i]))-xs1.begin());
				int idx2=(int)(lower_bound(xs2.begin(),xs2.end(),len-(p.fi-d[i]-divb(p.fi-d[i],len)))-xs2.begin());
				pair<ll,int> tmp=queryx(idx1,sz1-1,0,sz2-1);
				ll s=tmp.se*(divb(p.fi-d[i],len)/len)+tmp.se+tmp.fi;
				ans[p.se]+=s+queryx(idx1,sz1-1,idx2,sz2-1).se;
			}
		}
		while(tsz){
			ls[tsz]=rs[tsz]=sum[tsz]=cnt[tsz]=0;
			tsz--;
		}
		for(int i=0;i<sz;i++) {
			for(auto&p:my[f[i]]){
				int idx1=(int)(lower_bound(xs1.begin(),xs1.end(),d[i]-p)-xs1.begin());
				clrx(idx1);
			}
		}
		xs1.clear();
		xs2.clear();
		for(int i=0;i<sz;i++){
			for(auto&p:my[f[i]]){
				xs1.pb((d[i]-len)-p);
				xs2.pb((d[i]-len)-p-divb((d[i]-len)-p,len));
			}
			for(auto&p:qs[f[i]]){
				xs1.pb(-(p.fi-d[i]));
				xs2.pb(len-(p.fi-d[i]-divb(p.fi-d[i],len)));
			}
		}
		sort(xs1.begin(),xs1.end());
		xs1.erase(unique(xs1.begin(),xs1.end()),xs1.end());
		sort(xs2.begin(),xs2.end());
		xs2.erase(unique(xs2.begin(),xs2.end()),xs2.end());
		sz1=(int)xs1.size(),sz2=(int)xs2.size();
		for(int i=sz-1;i>=0;i--){
			for(auto&p:qs[f[i]]){
				int idx1=(int)(lower_bound(xs1.begin(),xs1.end(),-(p.fi-d[i]))-xs1.begin());
				int idx2=(int)(lower_bound(xs2.begin(),xs2.end(),len-(p.fi-d[i]-divb(p.fi-d[i],len)))-xs2.begin());
				pair<ll,int> tmp=queryx(idx1,sz1-1,0,sz2-1);
				ll s=tmp.se*(divb(p.fi-d[i],len)/len)+tmp.se+tmp.fi;
				ans[p.se]+=s+queryx(idx1,sz1-1,idx2,sz2-1).se;
			}
			for(auto&p:my[f[i]]){
				int idx1=(int)(lower_bound(xs1.begin(),xs1.end(),(d[i]-len)-p)-xs1.begin());
				int idx2=(int)(lower_bound(xs2.begin(),xs2.end(),(d[i]-len)-p-divb((d[i]-len)-p,len))-xs2.begin());
				modifyx(idx1,idx2,divb((d[i]-len)-p,len)/len);
			}
		}
		while(tsz){
			ls[tsz]=rs[tsz]=sum[tsz]=cnt[tsz]=0;
			tsz--;
		}
		for(int i=0;i<sz;i++) {
			for(auto&p:my[f[i]]){
				int idx1=(int)(lower_bound(xs1.begin(),xs1.end(),(d[i]-len)-p)-xs1.begin());
				clrx(idx1);
			}
		}
	}
	for(int i=1;i<=q;i++) printf("%lld\n",ans[i]);
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 29276 KB Output is correct
2 Correct 16 ms 25176 KB Output is correct
3 Correct 28 ms 33624 KB Output is correct
4 Correct 15 ms 39964 KB Output is correct
5 Correct 15 ms 40476 KB Output is correct
6 Correct 15 ms 40484 KB Output is correct
7 Correct 15 ms 40460 KB Output is correct
8 Correct 14 ms 39512 KB Output is correct
9 Correct 15 ms 39756 KB Output is correct
10 Correct 16 ms 39896 KB Output is correct
11 Correct 14 ms 39896 KB Output is correct
12 Correct 26 ms 28960 KB Output is correct
13 Correct 26 ms 33624 KB Output is correct
14 Correct 26 ms 31572 KB Output is correct
15 Correct 17 ms 40188 KB Output is correct
16 Correct 18 ms 40220 KB Output is correct
17 Correct 15 ms 40216 KB Output is correct
18 Correct 14 ms 40220 KB Output is correct
19 Correct 15 ms 40232 KB Output is correct
20 Correct 17 ms 40216 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1453 ms 39476 KB Output is correct
2 Correct 142 ms 50304 KB Output is correct
3 Correct 179 ms 35788 KB Output is correct
4 Correct 1425 ms 46352 KB Output is correct
5 Correct 144 ms 88148 KB Output is correct
6 Correct 146 ms 88552 KB Output is correct
7 Correct 88 ms 45380 KB Output is correct
8 Correct 124 ms 55020 KB Output is correct
9 Correct 1548 ms 45988 KB Output is correct
10 Correct 1418 ms 49132 KB Output is correct
11 Correct 1534 ms 46004 KB Output is correct
12 Correct 1511 ms 45904 KB Output is correct
13 Correct 1560 ms 45900 KB Output is correct
14 Correct 1380 ms 48928 KB Output is correct
15 Correct 1261 ms 44656 KB Output is correct
16 Correct 135 ms 74552 KB Output is correct
17 Correct 136 ms 75356 KB Output is correct
18 Correct 115 ms 57024 KB Output is correct
19 Correct 95 ms 56660 KB Output is correct
20 Correct 117 ms 49828 KB Output is correct

Subtask #3
75.0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 29276 KB Output is correct
2 Correct 16 ms 25176 KB Output is correct
3 Correct 28 ms 33624 KB Output is correct
4 Correct 15 ms 39964 KB Output is correct
5 Correct 15 ms 40476 KB Output is correct
6 Correct 15 ms 40484 KB Output is correct
7 Correct 15 ms 40460 KB Output is correct
8 Correct 14 ms 39512 KB Output is correct
9 Correct 15 ms 39756 KB Output is correct
10 Correct 16 ms 39896 KB Output is correct
11 Correct 14 ms 39896 KB Output is correct
12 Correct 26 ms 28960 KB Output is correct
13 Correct 26 ms 33624 KB Output is correct
14 Correct 26 ms 31572 KB Output is correct
15 Correct 17 ms 40188 KB Output is correct
16 Correct 18 ms 40220 KB Output is correct
17 Correct 15 ms 40216 KB Output is correct
18 Correct 14 ms 40220 KB Output is correct
19 Correct 15 ms 40232 KB Output is correct
20 Correct 17 ms 40216 KB Output is correct
21 Correct 1453 ms 39476 KB Output is correct
22 Correct 142 ms 50304 KB Output is correct
23 Correct 179 ms 35788 KB Output is correct
24 Correct 1425 ms 46352 KB Output is correct
25 Correct 144 ms 88148 KB Output is correct
26 Correct 146 ms 88552 KB Output is correct
27 Correct 88 ms 45380 KB Output is correct
28 Correct 124 ms 55020 KB Output is correct
29 Correct 1548 ms 45988 KB Output is correct
30 Correct 1418 ms 49132 KB Output is correct
31 Correct 1534 ms 46004 KB Output is correct
32 Correct 1511 ms 45904 KB Output is correct
33 Correct 1560 ms 45900 KB Output is correct
34 Correct 1380 ms 48928 KB Output is correct
35 Correct 1261 ms 44656 KB Output is correct
36 Correct 135 ms 74552 KB Output is correct
37 Correct 136 ms 75356 KB Output is correct
38 Correct 115 ms 57024 KB Output is correct
39 Correct 95 ms 56660 KB Output is correct
40 Correct 117 ms 49828 KB Output is correct
41 Correct 694 ms 227340 KB Output is correct
42 Correct 956 ms 41552 KB Output is correct
43 Correct 1496 ms 46360 KB Output is correct
44 Correct 2386 ms 255884 KB Output is correct
45 Correct 574 ms 262564 KB Output is correct
46 Correct 599 ms 262360 KB Output is correct
47 Correct 615 ms 264196 KB Output is correct
48 Correct 570 ms 259008 KB Output is correct
49 Correct 572 ms 262284 KB Output is correct
50 Correct 520 ms 209976 KB Output is correct
51 Correct 534 ms 224156 KB Output is correct
52 Correct 2434 ms 251008 KB Output is correct
53 Correct 1880 ms 217584 KB Output is correct
54 Correct 2552 ms 252440 KB Output is correct
55 Correct 1968 ms 258076 KB Output is correct
56 Correct 661 ms 252000 KB Output is correct
57 Correct 674 ms 257992 KB Output is correct
58 Correct 706 ms 260368 KB Output is correct
59 Correct 585 ms 252440 KB Output is correct
60 Correct 596 ms 253148 KB Output is correct
61 Correct 608 ms 253404 KB Output is correct
62 Correct 1973 ms 149308 KB Output is correct
63 Correct 545 ms 238372 KB Output is correct
64 Correct 538 ms 236820 KB Output is correct
65 Correct 577 ms 238048 KB Output is correct
66 Correct 558 ms 232240 KB Output is correct
67 Correct 563 ms 231960 KB Output is correct
68 Correct 577 ms 232764 KB Output is correct
69 Correct 685 ms 232384 KB Output is correct
70 Correct 664 ms 228548 KB Output is correct
71 Correct 721 ms 237532 KB Output is correct
72 Correct 725 ms 244524 KB Output is correct