oj.uz

Submission #1001535

# Submission time Handle Problem Language Result Execution time Memory
1001535 2024-06-19T05:33:01 Z amirhoseinfar1385 Sličnost (COI23_slicnost) C++17
67 / 100
 2735 ms 524292 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)*3];
	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==0){
			u=i;
		}else{
			seg[te]=seg[i];
			te++;
		}
		if(wtf==0){
			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

# Verdict Execution time Memory Grader output
1 Correct 105 ms 332656 KB Output is correct
2 Correct 103 ms 332884 KB Output is correct
3 Correct 104 ms 332868 KB Output is correct
4 Correct 102 ms 332640 KB Output is correct
5 Correct 112 ms 332876 KB Output is correct
6 Correct 105 ms 332880 KB Output is correct
7 Correct 100 ms 332628 KB Output is correct
8 Correct 102 ms 332744 KB Output is correct
9 Correct 110 ms 332712 KB Output is correct
10 Correct 105 ms 332880 KB Output is correct
11 Correct 101 ms 332792 KB Output is correct
12 Correct 99 ms 332704 KB Output is correct
13 Correct 111 ms 332880 KB Output is correct
14 Correct 100 ms 332880 KB Output is correct
15 Correct 100 ms 332880 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 105 ms 332656 KB Output is correct
2 Correct 103 ms 332884 KB Output is correct
3 Correct 104 ms 332868 KB Output is correct
4 Correct 102 ms 332640 KB Output is correct
5 Correct 112 ms 332876 KB Output is correct
6 Correct 105 ms 332880 KB Output is correct
7 Correct 100 ms 332628 KB Output is correct
8 Correct 102 ms 332744 KB Output is correct
9 Correct 110 ms 332712 KB Output is correct
10 Correct 105 ms 332880 KB Output is correct
11 Correct 101 ms 332792 KB Output is correct
12 Correct 99 ms 332704 KB Output is correct
13 Correct 111 ms 332880 KB Output is correct
14 Correct 100 ms 332880 KB Output is correct
15 Correct 100 ms 332880 KB Output is correct
16 Correct 100 ms 333140 KB Output is correct
17 Correct 112 ms 333104 KB Output is correct
18 Correct 113 ms 332884 KB Output is correct
19 Correct 116 ms 332880 KB Output is correct
20 Correct 108 ms 333136 KB Output is correct
21 Correct 108 ms 333140 KB Output is correct
22 Correct 105 ms 333140 KB Output is correct
23 Correct 106 ms 333192 KB Output is correct
24 Correct 105 ms 333140 KB Output is correct
25 Correct 114 ms 333136 KB Output is correct
26 Correct 102 ms 333196 KB Output is correct
27 Correct 100 ms 333136 KB Output is correct
28 Correct 105 ms 333136 KB Output is correct
29 Correct 112 ms 333136 KB Output is correct
30 Correct 104 ms 333136 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 105 ms 332656 KB Output is correct
2 Correct 103 ms 332884 KB Output is correct
3 Correct 104 ms 332868 KB Output is correct
4 Correct 102 ms 332640 KB Output is correct
5 Correct 112 ms 332876 KB Output is correct
6 Correct 105 ms 332880 KB Output is correct
7 Correct 100 ms 332628 KB Output is correct
8 Correct 102 ms 332744 KB Output is correct
9 Correct 110 ms 332712 KB Output is correct
10 Correct 105 ms 332880 KB Output is correct
11 Correct 101 ms 332792 KB Output is correct
12 Correct 99 ms 332704 KB Output is correct
13 Correct 111 ms 332880 KB Output is correct
14 Correct 100 ms 332880 KB Output is correct
15 Correct 100 ms 332880 KB Output is correct
16 Correct 100 ms 333140 KB Output is correct
17 Correct 112 ms 333104 KB Output is correct
18 Correct 113 ms 332884 KB Output is correct
19 Correct 116 ms 332880 KB Output is correct
20 Correct 108 ms 333136 KB Output is correct
21 Correct 108 ms 333140 KB Output is correct
22 Correct 105 ms 333140 KB Output is correct
23 Correct 106 ms 333192 KB Output is correct
24 Correct 105 ms 333140 KB Output is correct
25 Correct 114 ms 333136 KB Output is correct
26 Correct 102 ms 333196 KB Output is correct
27 Correct 100 ms 333136 KB Output is correct
28 Correct 105 ms 333136 KB Output is correct
29 Correct 112 ms 333136 KB Output is correct
30 Correct 104 ms 333136 KB Output is correct
31 Correct 187 ms 340048 KB Output is correct
32 Correct 198 ms 340056 KB Output is correct
33 Correct 136 ms 335364 KB Output is correct
34 Correct 215 ms 337748 KB Output is correct
35 Correct 271 ms 340052 KB Output is correct
36 Correct 216 ms 339684 KB Output is correct
37 Correct 157 ms 335628 KB Output is correct
38 Correct 282 ms 339796 KB Output is correct
39 Correct 213 ms 340124 KB Output is correct
40 Correct 231 ms 338140 KB Output is correct
41 Correct 266 ms 338748 KB Output is correct
42 Correct 298 ms 339540 KB Output is correct
43 Correct 222 ms 337748 KB Output is correct
44 Correct 214 ms 337236 KB Output is correct
45 Correct 167 ms 335864 KB Output is correct

Subtask #4
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 105 ms 332656 KB Output is correct
2 Correct 103 ms 332884 KB Output is correct
3 Correct 104 ms 332868 KB Output is correct
4 Correct 102 ms 332640 KB Output is correct
5 Correct 112 ms 332876 KB Output is correct
6 Correct 105 ms 332880 KB Output is correct
7 Correct 100 ms 332628 KB Output is correct
8 Correct 102 ms 332744 KB Output is correct
9 Correct 110 ms 332712 KB Output is correct
10 Correct 105 ms 332880 KB Output is correct
11 Correct 101 ms 332792 KB Output is correct
12 Correct 99 ms 332704 KB Output is correct
13 Correct 111 ms 332880 KB Output is correct
14 Correct 100 ms 332880 KB Output is correct
15 Correct 100 ms 332880 KB Output is correct
16 Correct 112 ms 332892 KB Output is correct
17 Correct 116 ms 332884 KB Output is correct
18 Correct 142 ms 332988 KB Output is correct
19 Correct 109 ms 332884 KB Output is correct
20 Correct 107 ms 332880 KB Output is correct
21 Correct 116 ms 332812 KB Output is correct
22 Correct 113 ms 332880 KB Output is correct
23 Correct 109 ms 332816 KB Output is correct
24 Correct 112 ms 332884 KB Output is correct
25 Correct 108 ms 332884 KB Output is correct
26 Correct 130 ms 332888 KB Output is correct
27 Correct 104 ms 332884 KB Output is correct
28 Correct 105 ms 332884 KB Output is correct
29 Correct 116 ms 332880 KB Output is correct
30 Correct 104 ms 332880 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 105 ms 332656 KB Output is correct
2 Correct 103 ms 332884 KB Output is correct
3 Correct 104 ms 332868 KB Output is correct
4 Correct 102 ms 332640 KB Output is correct
5 Correct 112 ms 332876 KB Output is correct
6 Correct 105 ms 332880 KB Output is correct
7 Correct 100 ms 332628 KB Output is correct
8 Correct 102 ms 332744 KB Output is correct
9 Correct 110 ms 332712 KB Output is correct
10 Correct 105 ms 332880 KB Output is correct
11 Correct 101 ms 332792 KB Output is correct
12 Correct 99 ms 332704 KB Output is correct
13 Correct 111 ms 332880 KB Output is correct
14 Correct 100 ms 332880 KB Output is correct
15 Correct 100 ms 332880 KB Output is correct
16 Correct 100 ms 333140 KB Output is correct
17 Correct 112 ms 333104 KB Output is correct
18 Correct 113 ms 332884 KB Output is correct
19 Correct 116 ms 332880 KB Output is correct
20 Correct 108 ms 333136 KB Output is correct
21 Correct 108 ms 333140 KB Output is correct
22 Correct 105 ms 333140 KB Output is correct
23 Correct 106 ms 333192 KB Output is correct
24 Correct 105 ms 333140 KB Output is correct
25 Correct 114 ms 333136 KB Output is correct
26 Correct 102 ms 333196 KB Output is correct
27 Correct 100 ms 333136 KB Output is correct
28 Correct 105 ms 333136 KB Output is correct
29 Correct 112 ms 333136 KB Output is correct
30 Correct 104 ms 333136 KB Output is correct
31 Correct 112 ms 332892 KB Output is correct
32 Correct 116 ms 332884 KB Output is correct
33 Correct 142 ms 332988 KB Output is correct
34 Correct 109 ms 332884 KB Output is correct
35 Correct 107 ms 332880 KB Output is correct
36 Correct 116 ms 332812 KB Output is correct
37 Correct 113 ms 332880 KB Output is correct
38 Correct 109 ms 332816 KB Output is correct
39 Correct 112 ms 332884 KB Output is correct
40 Correct 108 ms 332884 KB Output is correct
41 Correct 130 ms 332888 KB Output is correct
42 Correct 104 ms 332884 KB Output is correct
43 Correct 105 ms 332884 KB Output is correct
44 Correct 116 ms 332880 KB Output is correct
45 Correct 104 ms 332880 KB Output is correct
46 Correct 119 ms 333392 KB Output is correct
47 Correct 116 ms 333216 KB Output is correct
48 Correct 121 ms 333116 KB Output is correct
49 Correct 113 ms 333140 KB Output is correct
50 Correct 129 ms 333392 KB Output is correct
51 Correct 108 ms 333044 KB Output is correct
52 Correct 129 ms 333244 KB Output is correct
53 Correct 132 ms 333316 KB Output is correct
54 Correct 120 ms 333392 KB Output is correct
55 Correct 110 ms 333140 KB Output is correct
56 Correct 124 ms 333388 KB Output is correct
57 Correct 133 ms 333396 KB Output is correct
58 Correct 124 ms 333128 KB Output is correct
59 Correct 136 ms 333248 KB Output is correct
60 Correct 115 ms 333136 KB Output is correct

Subtask #6
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 105 ms 332656 KB Output is correct
2 Correct 103 ms 332884 KB Output is correct
3 Correct 104 ms 332868 KB Output is correct
4 Correct 102 ms 332640 KB Output is correct
5 Correct 112 ms 332876 KB Output is correct
6 Correct 105 ms 332880 KB Output is correct
7 Correct 100 ms 332628 KB Output is correct
8 Correct 102 ms 332744 KB Output is correct
9 Correct 110 ms 332712 KB Output is correct
10 Correct 105 ms 332880 KB Output is correct
11 Correct 101 ms 332792 KB Output is correct
12 Correct 99 ms 332704 KB Output is correct
13 Correct 111 ms 332880 KB Output is correct
14 Correct 100 ms 332880 KB Output is correct
15 Correct 100 ms 332880 KB Output is correct
16 Correct 100 ms 333140 KB Output is correct
17 Correct 112 ms 333104 KB Output is correct
18 Correct 113 ms 332884 KB Output is correct
19 Correct 116 ms 332880 KB Output is correct
20 Correct 108 ms 333136 KB Output is correct
21 Correct 108 ms 333140 KB Output is correct
22 Correct 105 ms 333140 KB Output is correct
23 Correct 106 ms 333192 KB Output is correct
24 Correct 105 ms 333140 KB Output is correct
25 Correct 114 ms 333136 KB Output is correct
26 Correct 102 ms 333196 KB Output is correct
27 Correct 100 ms 333136 KB Output is correct
28 Correct 105 ms 333136 KB Output is correct
29 Correct 112 ms 333136 KB Output is correct
30 Correct 104 ms 333136 KB Output is correct
31 Correct 187 ms 340048 KB Output is correct
32 Correct 198 ms 340056 KB Output is correct
33 Correct 136 ms 335364 KB Output is correct
34 Correct 215 ms 337748 KB Output is correct
35 Correct 271 ms 340052 KB Output is correct
36 Correct 216 ms 339684 KB Output is correct
37 Correct 157 ms 335628 KB Output is correct
38 Correct 282 ms 339796 KB Output is correct
39 Correct 213 ms 340124 KB Output is correct
40 Correct 231 ms 338140 KB Output is correct
41 Correct 266 ms 338748 KB Output is correct
42 Correct 298 ms 339540 KB Output is correct
43 Correct 222 ms 337748 KB Output is correct
44 Correct 214 ms 337236 KB Output is correct
45 Correct 167 ms 335864 KB Output is correct
46 Correct 112 ms 332892 KB Output is correct
47 Correct 116 ms 332884 KB Output is correct
48 Correct 142 ms 332988 KB Output is correct
49 Correct 109 ms 332884 KB Output is correct
50 Correct 107 ms 332880 KB Output is correct
51 Correct 116 ms 332812 KB Output is correct
52 Correct 113 ms 332880 KB Output is correct
53 Correct 109 ms 332816 KB Output is correct
54 Correct 112 ms 332884 KB Output is correct
55 Correct 108 ms 332884 KB Output is correct
56 Correct 130 ms 332888 KB Output is correct
57 Correct 104 ms 332884 KB Output is correct
58 Correct 105 ms 332884 KB Output is correct
59 Correct 116 ms 332880 KB Output is correct
60 Correct 104 ms 332880 KB Output is correct
61 Correct 119 ms 333392 KB Output is correct
62 Correct 116 ms 333216 KB Output is correct
63 Correct 121 ms 333116 KB Output is correct
64 Correct 113 ms 333140 KB Output is correct
65 Correct 129 ms 333392 KB Output is correct
66 Correct 108 ms 333044 KB Output is correct
67 Correct 129 ms 333244 KB Output is correct
68 Correct 132 ms 333316 KB Output is correct
69 Correct 120 ms 333392 KB Output is correct
70 Correct 110 ms 333140 KB Output is correct
71 Correct 124 ms 333388 KB Output is correct
72 Correct 133 ms 333396 KB Output is correct
73 Correct 124 ms 333128 KB Output is correct
74 Correct 136 ms 333248 KB Output is correct
75 Correct 115 ms 333136 KB Output is correct
76 Correct 597 ms 341400 KB Output is correct
77 Correct 603 ms 340820 KB Output is correct
78 Correct 236 ms 336724 KB Output is correct
79 Runtime error 2735 ms 524292 KB Execution killed with signal 9
80 Halted 0 ms 0 KB -