oj.uz

Submission #1001583

# Submission time Handle Problem Language Result Execution time Memory
1001583 2024-06-19T06:14:56 Z amirhoseinfar1385 Sličnost (COI23_slicnost) C++17
67 / 100
 1024 ms 524288 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;
const int sz=(lg+1)*maxn*14;
 
struct segmentpersistant{
	struct node{
		int cl,cr,ted;
		int maxa,lazy;
		node(){
			ted=0;
			cl=cr=0;
			maxa=lazy=0;
		}
	};
	node seg[sz];
	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){
		if(l>r||l>tr||r<tl||tl>tr){
			return i;
		}
		int u=te;
		seg[te]=seg[i];
		te++;
		if(te==sz){
			assert(0);
		}
		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);
		seg[u].cr=upd(seg[u].cr,m+1,r,tl,tr,w);
		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);
		root=segper.upd(root,0,kaf-1,max(lnk[all[u+1]]-k+1,1),min(n-k+1,lnk[all[u+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);
			root=segper.upd(root,0,kaf-1,max(lnk[all[u+1]]-k+1,1),min(n-k+1,lnk[all[u+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

# Verdict Execution time Memory Grader output
1 Correct 173 ms 494932 KB Output is correct
2 Correct 185 ms 495184 KB Output is correct
3 Correct 171 ms 495052 KB Output is correct
4 Correct 157 ms 494928 KB Output is correct
5 Correct 167 ms 494928 KB Output is correct
6 Correct 162 ms 494944 KB Output is correct
7 Correct 189 ms 494920 KB Output is correct
8 Correct 186 ms 495072 KB Output is correct
9 Correct 168 ms 494928 KB Output is correct
10 Correct 172 ms 494928 KB Output is correct
11 Correct 175 ms 494928 KB Output is correct
12 Correct 177 ms 494928 KB Output is correct
13 Correct 168 ms 495184 KB Output is correct
14 Correct 167 ms 494932 KB Output is correct
15 Correct 168 ms 494932 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 173 ms 494932 KB Output is correct
2 Correct 185 ms 495184 KB Output is correct
3 Correct 171 ms 495052 KB Output is correct
4 Correct 157 ms 494928 KB Output is correct
5 Correct 167 ms 494928 KB Output is correct
6 Correct 162 ms 494944 KB Output is correct
7 Correct 189 ms 494920 KB Output is correct
8 Correct 186 ms 495072 KB Output is correct
9 Correct 168 ms 494928 KB Output is correct
10 Correct 172 ms 494928 KB Output is correct
11 Correct 175 ms 494928 KB Output is correct
12 Correct 177 ms 494928 KB Output is correct
13 Correct 168 ms 495184 KB Output is correct
14 Correct 167 ms 494932 KB Output is correct
15 Correct 168 ms 494932 KB Output is correct
16 Correct 171 ms 495288 KB Output is correct
17 Correct 164 ms 495700 KB Output is correct
18 Correct 176 ms 495176 KB Output is correct
19 Correct 184 ms 495092 KB Output is correct
20 Correct 188 ms 495436 KB Output is correct
21 Correct 172 ms 495192 KB Output is correct
22 Correct 168 ms 495184 KB Output is correct
23 Correct 171 ms 495284 KB Output is correct
24 Correct 170 ms 495364 KB Output is correct
25 Correct 165 ms 495184 KB Output is correct
26 Correct 167 ms 495184 KB Output is correct
27 Correct 167 ms 495184 KB Output is correct
28 Correct 164 ms 495188 KB Output is correct
29 Correct 179 ms 495200 KB Output is correct
30 Correct 162 ms 495048 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 173 ms 494932 KB Output is correct
2 Correct 185 ms 495184 KB Output is correct
3 Correct 171 ms 495052 KB Output is correct
4 Correct 157 ms 494928 KB Output is correct
5 Correct 167 ms 494928 KB Output is correct
6 Correct 162 ms 494944 KB Output is correct
7 Correct 189 ms 494920 KB Output is correct
8 Correct 186 ms 495072 KB Output is correct
9 Correct 168 ms 494928 KB Output is correct
10 Correct 172 ms 494928 KB Output is correct
11 Correct 175 ms 494928 KB Output is correct
12 Correct 177 ms 494928 KB Output is correct
13 Correct 168 ms 495184 KB Output is correct
14 Correct 167 ms 494932 KB Output is correct
15 Correct 168 ms 494932 KB Output is correct
16 Correct 171 ms 495288 KB Output is correct
17 Correct 164 ms 495700 KB Output is correct
18 Correct 176 ms 495176 KB Output is correct
19 Correct 184 ms 495092 KB Output is correct
20 Correct 188 ms 495436 KB Output is correct
21 Correct 172 ms 495192 KB Output is correct
22 Correct 168 ms 495184 KB Output is correct
23 Correct 171 ms 495284 KB Output is correct
24 Correct 170 ms 495364 KB Output is correct
25 Correct 165 ms 495184 KB Output is correct
26 Correct 167 ms 495184 KB Output is correct
27 Correct 167 ms 495184 KB Output is correct
28 Correct 164 ms 495188 KB Output is correct
29 Correct 179 ms 495200 KB Output is correct
30 Correct 162 ms 495048 KB Output is correct
31 Correct 244 ms 500816 KB Output is correct
32 Correct 262 ms 500680 KB Output is correct
33 Correct 186 ms 496288 KB Output is correct
34 Correct 265 ms 498516 KB Output is correct
35 Correct 333 ms 500820 KB Output is correct
36 Correct 293 ms 500564 KB Output is correct
37 Correct 214 ms 496572 KB Output is correct
38 Correct 313 ms 500568 KB Output is correct
39 Correct 263 ms 500816 KB Output is correct
40 Correct 289 ms 498912 KB Output is correct
41 Correct 283 ms 499596 KB Output is correct
42 Correct 334 ms 500312 KB Output is correct
43 Correct 289 ms 498740 KB Output is correct
44 Correct 301 ms 498000 KB Output is correct
45 Correct 212 ms 496464 KB Output is correct

Subtask #4
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 173 ms 494932 KB Output is correct
2 Correct 185 ms 495184 KB Output is correct
3 Correct 171 ms 495052 KB Output is correct
4 Correct 157 ms 494928 KB Output is correct
5 Correct 167 ms 494928 KB Output is correct
6 Correct 162 ms 494944 KB Output is correct
7 Correct 189 ms 494920 KB Output is correct
8 Correct 186 ms 495072 KB Output is correct
9 Correct 168 ms 494928 KB Output is correct
10 Correct 172 ms 494928 KB Output is correct
11 Correct 175 ms 494928 KB Output is correct
12 Correct 177 ms 494928 KB Output is correct
13 Correct 168 ms 495184 KB Output is correct
14 Correct 167 ms 494932 KB Output is correct
15 Correct 168 ms 494932 KB Output is correct
16 Correct 161 ms 494932 KB Output is correct
17 Correct 166 ms 494928 KB Output is correct
18 Correct 168 ms 495268 KB Output is correct
19 Correct 202 ms 494928 KB Output is correct
20 Correct 171 ms 495072 KB Output is correct
21 Correct 174 ms 495188 KB Output is correct
22 Correct 166 ms 494932 KB Output is correct
23 Correct 192 ms 494928 KB Output is correct
24 Correct 162 ms 494936 KB Output is correct
25 Correct 161 ms 494928 KB Output is correct
26 Correct 166 ms 495100 KB Output is correct
27 Correct 186 ms 494932 KB Output is correct
28 Correct 154 ms 494964 KB Output is correct
29 Correct 159 ms 494928 KB Output is correct
30 Correct 166 ms 494948 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 173 ms 494932 KB Output is correct
2 Correct 185 ms 495184 KB Output is correct
3 Correct 171 ms 495052 KB Output is correct
4 Correct 157 ms 494928 KB Output is correct
5 Correct 167 ms 494928 KB Output is correct
6 Correct 162 ms 494944 KB Output is correct
7 Correct 189 ms 494920 KB Output is correct
8 Correct 186 ms 495072 KB Output is correct
9 Correct 168 ms 494928 KB Output is correct
10 Correct 172 ms 494928 KB Output is correct
11 Correct 175 ms 494928 KB Output is correct
12 Correct 177 ms 494928 KB Output is correct
13 Correct 168 ms 495184 KB Output is correct
14 Correct 167 ms 494932 KB Output is correct
15 Correct 168 ms 494932 KB Output is correct
16 Correct 171 ms 495288 KB Output is correct
17 Correct 164 ms 495700 KB Output is correct
18 Correct 176 ms 495176 KB Output is correct
19 Correct 184 ms 495092 KB Output is correct
20 Correct 188 ms 495436 KB Output is correct
21 Correct 172 ms 495192 KB Output is correct
22 Correct 168 ms 495184 KB Output is correct
23 Correct 171 ms 495284 KB Output is correct
24 Correct 170 ms 495364 KB Output is correct
25 Correct 165 ms 495184 KB Output is correct
26 Correct 167 ms 495184 KB Output is correct
27 Correct 167 ms 495184 KB Output is correct
28 Correct 164 ms 495188 KB Output is correct
29 Correct 179 ms 495200 KB Output is correct
30 Correct 162 ms 495048 KB Output is correct
31 Correct 161 ms 494932 KB Output is correct
32 Correct 166 ms 494928 KB Output is correct
33 Correct 168 ms 495268 KB Output is correct
34 Correct 202 ms 494928 KB Output is correct
35 Correct 171 ms 495072 KB Output is correct
36 Correct 174 ms 495188 KB Output is correct
37 Correct 166 ms 494932 KB Output is correct
38 Correct 192 ms 494928 KB Output is correct
39 Correct 162 ms 494936 KB Output is correct
40 Correct 161 ms 494928 KB Output is correct
41 Correct 166 ms 495100 KB Output is correct
42 Correct 186 ms 494932 KB Output is correct
43 Correct 154 ms 494964 KB Output is correct
44 Correct 159 ms 494928 KB Output is correct
45 Correct 166 ms 494948 KB Output is correct
46 Correct 181 ms 495432 KB Output is correct
47 Correct 180 ms 495244 KB Output is correct
48 Correct 166 ms 495184 KB Output is correct
49 Correct 185 ms 495440 KB Output is correct
50 Correct 192 ms 495440 KB Output is correct
51 Correct 174 ms 495244 KB Output is correct
52 Correct 181 ms 495596 KB Output is correct
53 Correct 183 ms 495284 KB Output is correct
54 Correct 187 ms 495316 KB Output is correct
55 Correct 178 ms 495188 KB Output is correct
56 Correct 187 ms 495440 KB Output is correct
57 Correct 183 ms 495440 KB Output is correct
58 Correct 190 ms 495256 KB Output is correct
59 Correct 183 ms 495364 KB Output is correct
60 Correct 173 ms 495096 KB Output is correct

Subtask #6
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 173 ms 494932 KB Output is correct
2 Correct 185 ms 495184 KB Output is correct
3 Correct 171 ms 495052 KB Output is correct
4 Correct 157 ms 494928 KB Output is correct
5 Correct 167 ms 494928 KB Output is correct
6 Correct 162 ms 494944 KB Output is correct
7 Correct 189 ms 494920 KB Output is correct
8 Correct 186 ms 495072 KB Output is correct
9 Correct 168 ms 494928 KB Output is correct
10 Correct 172 ms 494928 KB Output is correct
11 Correct 175 ms 494928 KB Output is correct
12 Correct 177 ms 494928 KB Output is correct
13 Correct 168 ms 495184 KB Output is correct
14 Correct 167 ms 494932 KB Output is correct
15 Correct 168 ms 494932 KB Output is correct
16 Correct 171 ms 495288 KB Output is correct
17 Correct 164 ms 495700 KB Output is correct
18 Correct 176 ms 495176 KB Output is correct
19 Correct 184 ms 495092 KB Output is correct
20 Correct 188 ms 495436 KB Output is correct
21 Correct 172 ms 495192 KB Output is correct
22 Correct 168 ms 495184 KB Output is correct
23 Correct 171 ms 495284 KB Output is correct
24 Correct 170 ms 495364 KB Output is correct
25 Correct 165 ms 495184 KB Output is correct
26 Correct 167 ms 495184 KB Output is correct
27 Correct 167 ms 495184 KB Output is correct
28 Correct 164 ms 495188 KB Output is correct
29 Correct 179 ms 495200 KB Output is correct
30 Correct 162 ms 495048 KB Output is correct
31 Correct 244 ms 500816 KB Output is correct
32 Correct 262 ms 500680 KB Output is correct
33 Correct 186 ms 496288 KB Output is correct
34 Correct 265 ms 498516 KB Output is correct
35 Correct 333 ms 500820 KB Output is correct
36 Correct 293 ms 500564 KB Output is correct
37 Correct 214 ms 496572 KB Output is correct
38 Correct 313 ms 500568 KB Output is correct
39 Correct 263 ms 500816 KB Output is correct
40 Correct 289 ms 498912 KB Output is correct
41 Correct 283 ms 499596 KB Output is correct
42 Correct 334 ms 500312 KB Output is correct
43 Correct 289 ms 498740 KB Output is correct
44 Correct 301 ms 498000 KB Output is correct
45 Correct 212 ms 496464 KB Output is correct
46 Correct 161 ms 494932 KB Output is correct
47 Correct 166 ms 494928 KB Output is correct
48 Correct 168 ms 495268 KB Output is correct
49 Correct 202 ms 494928 KB Output is correct
50 Correct 171 ms 495072 KB Output is correct
51 Correct 174 ms 495188 KB Output is correct
52 Correct 166 ms 494932 KB Output is correct
53 Correct 192 ms 494928 KB Output is correct
54 Correct 162 ms 494936 KB Output is correct
55 Correct 161 ms 494928 KB Output is correct
56 Correct 166 ms 495100 KB Output is correct
57 Correct 186 ms 494932 KB Output is correct
58 Correct 154 ms 494964 KB Output is correct
59 Correct 159 ms 494928 KB Output is correct
60 Correct 166 ms 494948 KB Output is correct
61 Correct 181 ms 495432 KB Output is correct
62 Correct 180 ms 495244 KB Output is correct
63 Correct 166 ms 495184 KB Output is correct
64 Correct 185 ms 495440 KB Output is correct
65 Correct 192 ms 495440 KB Output is correct
66 Correct 174 ms 495244 KB Output is correct
67 Correct 181 ms 495596 KB Output is correct
68 Correct 183 ms 495284 KB Output is correct
69 Correct 187 ms 495316 KB Output is correct
70 Correct 178 ms 495188 KB Output is correct
71 Correct 187 ms 495440 KB Output is correct
72 Correct 183 ms 495440 KB Output is correct
73 Correct 190 ms 495256 KB Output is correct
74 Correct 183 ms 495364 KB Output is correct
75 Correct 173 ms 495096 KB Output is correct
76 Correct 627 ms 502192 KB Output is correct
77 Correct 690 ms 501704 KB Output is correct
78 Correct 273 ms 497492 KB Output is correct
79 Correct 749 ms 499904 KB Output is correct
80 Correct 1024 ms 502180 KB Output is correct
81 Correct 375 ms 498444 KB Output is correct
82 Correct 571 ms 501076 KB Output is correct
83 Correct 1022 ms 501848 KB Output is correct
84 Correct 809 ms 502612 KB Output is correct
85 Runtime error 540 ms 524288 KB Execution killed with signal 9
86 Halted 0 ms 0 KB -