oj.uz

답안 #1001532

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1001532 2024-06-19T05:30:27 Z amirhoseinfar1385 Sličnost (COI23_slicnost) C++17
50 / 100
 221 ms 229204 KB 
#include<bits/stdc++.h>
using namespace std;
const int maxn=100000+10,lg=17;
int n,k,q,inf=1e8;
int all[maxn],allb[maxn],lnk[maxn],allroot[maxn],root=0,kaf=(1<<lg);
set<pair<int,int>>st;
map<int,long long>mp;
 
struct segmentpersistant{
	struct node{
		int cl,cr,ted;
		int maxa,lazy;
		int vis;
		node(){
			vis=0;
			ted=0;
			cl=cr=0;
			maxa=lazy=0;
		}
	};
	node seg[(1<<(lg+1))*(lg+1)*2];
	int te=1;
	pair<int,int>comp(pair<int,int>a,pair<int,int>b,int w){
		pair<int ,int> ret=a;
		if(b.first==a.first){
			ret.second+=b.second;
		}else if(b.first>a.first){
			ret=b;
		}
		ret.first+=w;
		return ret;
	}
	void calc(int u,int l,int r){
		int len=r-l+1;
		len/=2;
		seg[u].ted=0;
		seg[u].maxa=max(seg[seg[u].cl].maxa+seg[seg[u].cl].lazy,seg[seg[u].cr].maxa+seg[seg[u].cr].lazy);
		if(seg[seg[u].cl].maxa+seg[seg[u].cl].lazy==seg[u].maxa){
			seg[u].ted+=seg[seg[u].cl].ted;
		}
		if(seg[seg[u].cr].maxa+seg[seg[u].cr].lazy==seg[u].maxa){
			seg[u].ted+=seg[seg[u].cr].ted;
		}
		if(seg[u].maxa==0){
			if(seg[u].cl==0){
				seg[u].ted+=len;
			}
			if(seg[u].cr==0){
				seg[u].ted+=len;
			}
		}
		return ;
	}
	int upd(int i,int l,int r,int tl,int tr,int w,int wtf=0){
		if(l>r||l>tr||r<tl||tl>tr){
			return i;
		}
		int u=te;
		if(wtf==1&&seg[i].vis==1){
			u=i;
		}else{
			seg[te]=seg[i];
			te++;
		}
		if(wtf){
			seg[i].vis=1;
		}
		if(l>=tl&&r<=tr){
			seg[u].lazy+=w;
			if(seg[u].cl==0&&seg[u].cr==0){
				seg[u].ted=r-l+1;
			}
			return u;
		}
		int m=(l+r)>>1;
		seg[u].cl=upd(seg[u].cl,l,m,tl,tr,w,wtf);
		seg[u].cr=upd(seg[u].cr,m+1,r,tl,tr,w,wtf);
		calc(u,l,r);
		return u;
	}
	pair<int,int> pors(int i,int l,int r,int tl,int tr){
		return make_pair(seg[i].maxa+seg[i].lazy,seg[i].ted);
	}
}segper;
 
void ezaf(int u){
	if(u<k){
		return ;
	}
	pair<int,int>z=segper.pors(allroot[u],0,kaf-1,1,n-k+1);
	st.insert(make_pair(z.first,u));
	mp[z.first]+=z.second;
	//cout<<"ziad: "<<u<<" "<<z.first<<" "<<z.second<<endl;
}
 
void kam(int u){
	if(u<k){
		return ;
	}
	pair<int,int>z=segper.pors(allroot[u],0,kaf-1,1,n-k+1);
	st.erase(make_pair(z.first,u));
	mp[z.first]-=z.second;
	//cout<<"kam: "<<u<<" "<<z.first<<" "<<z.second<<endl;
}
 
void khor(){
	auto x=(*st.rbegin());
	cout<<x.first<<" "<<mp[x.first]<<"\n";
}
 
void vorod(){
	cin>>n>>k>>q;
	for(int i=1;i<=n;i++){
		cin>>all[i];
	}
	for(int i=1;i<=n;i++){
		cin>>allb[i];
		lnk[allb[i]]=i;
	}
}
 
void pre(){
	for(int i=1;i<=n;i++){
		root=segper.upd(root,0,kaf-1,max(lnk[all[i]]-k+1,1),min(n-k+1,lnk[all[i]]),1);
		if(i-k>=1){
			root=segper.upd(root,0,kaf-1,max(lnk[all[i-k]]-k+1,1),min(n-k+1,lnk[all[i-k]]),-1);
		}
		allroot[i]=root;
		if(i>=k){
			ezaf(i);
		}
	}
}
 
void solve(){
	khor();
	for(int i=0;i<q;i++){
		int u;
		cin>>u;
		kam(u);
		root=allroot[u];
		root=segper.upd(root,0,kaf-1,max(lnk[all[u]]-k+1,1),min(n-k+1,lnk[all[u]]),-1,1);
		root=segper.upd(root,0,kaf-1,max(lnk[all[u+1]]-k+1,1),min(n-k+1,lnk[all[u+1]]),1,1);
		allroot[u]=root;
		ezaf(u);
		if(u+k<=n){
			kam(u+k);
			root=allroot[u+k];
			root=segper.upd(root,0,kaf-1,max(lnk[all[u]]-k+1,1),min(n-k+1,lnk[all[u]]),1,1);
			root=segper.upd(root,0,kaf-1,max(lnk[all[u+1]]-k+1,1),min(n-k+1,lnk[all[u+1]]),-1,1);
			allroot[u+k]=root;
			ezaf(u+k);
		}
		swap(all[u],all[u+1]);
		khor();
	}
}
 
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	//freopen("inp.txt","r",stdin);
	vorod();
	pre();
	solve();
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 222080 KB Output is correct
2 Correct 68 ms 222032 KB Output is correct
3 Correct 66 ms 222084 KB Output is correct
4 Correct 67 ms 222088 KB Output is correct
5 Correct 68 ms 222036 KB Output is correct
6 Correct 71 ms 222036 KB Output is correct
7 Correct 68 ms 222028 KB Output is correct
8 Correct 69 ms 222032 KB Output is correct
9 Correct 69 ms 222000 KB Output is correct
10 Correct 67 ms 222120 KB Output is correct
11 Correct 74 ms 221996 KB Output is correct
12 Correct 70 ms 222032 KB Output is correct
13 Correct 68 ms 222084 KB Output is correct
14 Correct 68 ms 222128 KB Output is correct
15 Correct 69 ms 222032 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 222080 KB Output is correct
2 Correct 68 ms 222032 KB Output is correct
3 Correct 66 ms 222084 KB Output is correct
4 Correct 67 ms 222088 KB Output is correct
5 Correct 68 ms 222036 KB Output is correct
6 Correct 71 ms 222036 KB Output is correct
7 Correct 68 ms 222028 KB Output is correct
8 Correct 69 ms 222032 KB Output is correct
9 Correct 69 ms 222000 KB Output is correct
10 Correct 67 ms 222120 KB Output is correct
11 Correct 74 ms 221996 KB Output is correct
12 Correct 70 ms 222032 KB Output is correct
13 Correct 68 ms 222084 KB Output is correct
14 Correct 68 ms 222128 KB Output is correct
15 Correct 69 ms 222032 KB Output is correct
16 Correct 83 ms 222548 KB Output is correct
17 Correct 86 ms 222544 KB Output is correct
18 Correct 75 ms 222272 KB Output is correct
19 Correct 79 ms 222292 KB Output is correct
20 Correct 74 ms 222532 KB Output is correct
21 Correct 75 ms 222544 KB Output is correct
22 Correct 78 ms 222116 KB Output is correct
23 Correct 78 ms 222428 KB Output is correct
24 Correct 77 ms 222548 KB Output is correct
25 Correct 73 ms 222292 KB Output is correct
26 Correct 75 ms 222292 KB Output is correct
27 Correct 74 ms 222544 KB Output is correct
28 Correct 83 ms 222392 KB Output is correct
29 Correct 75 ms 222288 KB Output is correct
30 Correct 73 ms 222292 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 222080 KB Output is correct
2 Correct 68 ms 222032 KB Output is correct
3 Correct 66 ms 222084 KB Output is correct
4 Correct 67 ms 222088 KB Output is correct
5 Correct 68 ms 222036 KB Output is correct
6 Correct 71 ms 222036 KB Output is correct
7 Correct 68 ms 222028 KB Output is correct
8 Correct 69 ms 222032 KB Output is correct
9 Correct 69 ms 222000 KB Output is correct
10 Correct 67 ms 222120 KB Output is correct
11 Correct 74 ms 221996 KB Output is correct
12 Correct 70 ms 222032 KB Output is correct
13 Correct 68 ms 222084 KB Output is correct
14 Correct 68 ms 222128 KB Output is correct
15 Correct 69 ms 222032 KB Output is correct
16 Correct 83 ms 222548 KB Output is correct
17 Correct 86 ms 222544 KB Output is correct
18 Correct 75 ms 222272 KB Output is correct
19 Correct 79 ms 222292 KB Output is correct
20 Correct 74 ms 222532 KB Output is correct
21 Correct 75 ms 222544 KB Output is correct
22 Correct 78 ms 222116 KB Output is correct
23 Correct 78 ms 222428 KB Output is correct
24 Correct 77 ms 222548 KB Output is correct
25 Correct 73 ms 222292 KB Output is correct
26 Correct 75 ms 222292 KB Output is correct
27 Correct 74 ms 222544 KB Output is correct
28 Correct 83 ms 222392 KB Output is correct
29 Correct 75 ms 222288 KB Output is correct
30 Correct 73 ms 222292 KB Output is correct
31 Correct 156 ms 229132 KB Output is correct
32 Correct 156 ms 229056 KB Output is correct
33 Correct 100 ms 224596 KB Output is correct
34 Correct 178 ms 226900 KB Output is correct
35 Correct 201 ms 229200 KB Output is correct
36 Correct 157 ms 228692 KB Output is correct
37 Correct 104 ms 224848 KB Output is correct
38 Correct 200 ms 228940 KB Output is correct
39 Correct 166 ms 229204 KB Output is correct
40 Correct 191 ms 227412 KB Output is correct
41 Correct 199 ms 227924 KB Output is correct
42 Correct 221 ms 228688 KB Output is correct
43 Correct 178 ms 227156 KB Output is correct
44 Correct 166 ms 226388 KB Output is correct
45 Correct 126 ms 224852 KB Output is correct

Subtask #4
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 222080 KB Output is correct
2 Correct 68 ms 222032 KB Output is correct
3 Correct 66 ms 222084 KB Output is correct
4 Correct 67 ms 222088 KB Output is correct
5 Correct 68 ms 222036 KB Output is correct
6 Correct 71 ms 222036 KB Output is correct
7 Correct 68 ms 222028 KB Output is correct
8 Correct 69 ms 222032 KB Output is correct
9 Correct 69 ms 222000 KB Output is correct
10 Correct 67 ms 222120 KB Output is correct
11 Correct 74 ms 221996 KB Output is correct
12 Correct 70 ms 222032 KB Output is correct
13 Correct 68 ms 222084 KB Output is correct
14 Correct 68 ms 222128 KB Output is correct
15 Correct 69 ms 222032 KB Output is correct
16 Incorrect 70 ms 222156 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 222080 KB Output is correct
2 Correct 68 ms 222032 KB Output is correct
3 Correct 66 ms 222084 KB Output is correct
4 Correct 67 ms 222088 KB Output is correct
5 Correct 68 ms 222036 KB Output is correct
6 Correct 71 ms 222036 KB Output is correct
7 Correct 68 ms 222028 KB Output is correct
8 Correct 69 ms 222032 KB Output is correct
9 Correct 69 ms 222000 KB Output is correct
10 Correct 67 ms 222120 KB Output is correct
11 Correct 74 ms 221996 KB Output is correct
12 Correct 70 ms 222032 KB Output is correct
13 Correct 68 ms 222084 KB Output is correct
14 Correct 68 ms 222128 KB Output is correct
15 Correct 69 ms 222032 KB Output is correct
16 Correct 83 ms 222548 KB Output is correct
17 Correct 86 ms 222544 KB Output is correct
18 Correct 75 ms 222272 KB Output is correct
19 Correct 79 ms 222292 KB Output is correct
20 Correct 74 ms 222532 KB Output is correct
21 Correct 75 ms 222544 KB Output is correct
22 Correct 78 ms 222116 KB Output is correct
23 Correct 78 ms 222428 KB Output is correct
24 Correct 77 ms 222548 KB Output is correct
25 Correct 73 ms 222292 KB Output is correct
26 Correct 75 ms 222292 KB Output is correct
27 Correct 74 ms 222544 KB Output is correct
28 Correct 83 ms 222392 KB Output is correct
29 Correct 75 ms 222288 KB Output is correct
30 Correct 73 ms 222292 KB Output is correct
31 Incorrect 70 ms 222156 KB Output isn't correct
32 Halted 0 ms 0 KB -

Subtask #6
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 222080 KB Output is correct
2 Correct 68 ms 222032 KB Output is correct
3 Correct 66 ms 222084 KB Output is correct
4 Correct 67 ms 222088 KB Output is correct
5 Correct 68 ms 222036 KB Output is correct
6 Correct 71 ms 222036 KB Output is correct
7 Correct 68 ms 222028 KB Output is correct
8 Correct 69 ms 222032 KB Output is correct
9 Correct 69 ms 222000 KB Output is correct
10 Correct 67 ms 222120 KB Output is correct
11 Correct 74 ms 221996 KB Output is correct
12 Correct 70 ms 222032 KB Output is correct
13 Correct 68 ms 222084 KB Output is correct
14 Correct 68 ms 222128 KB Output is correct
15 Correct 69 ms 222032 KB Output is correct
16 Correct 83 ms 222548 KB Output is correct
17 Correct 86 ms 222544 KB Output is correct
18 Correct 75 ms 222272 KB Output is correct
19 Correct 79 ms 222292 KB Output is correct
20 Correct 74 ms 222532 KB Output is correct
21 Correct 75 ms 222544 KB Output is correct
22 Correct 78 ms 222116 KB Output is correct
23 Correct 78 ms 222428 KB Output is correct
24 Correct 77 ms 222548 KB Output is correct
25 Correct 73 ms 222292 KB Output is correct
26 Correct 75 ms 222292 KB Output is correct
27 Correct 74 ms 222544 KB Output is correct
28 Correct 83 ms 222392 KB Output is correct
29 Correct 75 ms 222288 KB Output is correct
30 Correct 73 ms 222292 KB Output is correct
31 Correct 156 ms 229132 KB Output is correct
32 Correct 156 ms 229056 KB Output is correct
33 Correct 100 ms 224596 KB Output is correct
34 Correct 178 ms 226900 KB Output is correct
35 Correct 201 ms 229200 KB Output is correct
36 Correct 157 ms 228692 KB Output is correct
37 Correct 104 ms 224848 KB Output is correct
38 Correct 200 ms 228940 KB Output is correct
39 Correct 166 ms 229204 KB Output is correct
40 Correct 191 ms 227412 KB Output is correct
41 Correct 199 ms 227924 KB Output is correct
42 Correct 221 ms 228688 KB Output is correct
43 Correct 178 ms 227156 KB Output is correct
44 Correct 166 ms 226388 KB Output is correct
45 Correct 126 ms 224852 KB Output is correct
46 Incorrect 70 ms 222156 KB Output isn't correct
47 Halted 0 ms 0 KB -