oj.uz

Submission #1001560

# Submission time Handle Problem Language Result Execution time Memory
1001560 2024-06-19T05:49:54 Z amirhoseinfar1385 Sličnost (COI23_slicnost) C++17
67 / 100
 539 ms 290640 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*8;
 
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,int wtf=0){
		if(l>r||l>tr||r<tl||tl>tr){
			return i;
		}
		int u=te;
		seg[te]=seg[i];
		te++;
		if(te==sz){
			exit(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,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 96 ms 282048 KB Output is correct
2 Correct 96 ms 282048 KB Output is correct
3 Correct 97 ms 282264 KB Output is correct
4 Correct 115 ms 282104 KB Output is correct
5 Correct 93 ms 282196 KB Output is correct
6 Correct 91 ms 282196 KB Output is correct
7 Correct 96 ms 282192 KB Output is correct
8 Correct 92 ms 282272 KB Output is correct
9 Correct 96 ms 282196 KB Output is correct
10 Correct 94 ms 282124 KB Output is correct
11 Correct 91 ms 282192 KB Output is correct
12 Correct 91 ms 282112 KB Output is correct
13 Correct 89 ms 282196 KB Output is correct
14 Correct 84 ms 282196 KB Output is correct
15 Correct 88 ms 282320 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 282048 KB Output is correct
2 Correct 96 ms 282048 KB Output is correct
3 Correct 97 ms 282264 KB Output is correct
4 Correct 115 ms 282104 KB Output is correct
5 Correct 93 ms 282196 KB Output is correct
6 Correct 91 ms 282196 KB Output is correct
7 Correct 96 ms 282192 KB Output is correct
8 Correct 92 ms 282272 KB Output is correct
9 Correct 96 ms 282196 KB Output is correct
10 Correct 94 ms 282124 KB Output is correct
11 Correct 91 ms 282192 KB Output is correct
12 Correct 91 ms 282112 KB Output is correct
13 Correct 89 ms 282196 KB Output is correct
14 Correct 84 ms 282196 KB Output is correct
15 Correct 88 ms 282320 KB Output is correct
16 Correct 92 ms 282448 KB Output is correct
17 Correct 89 ms 282472 KB Output is correct
18 Correct 95 ms 282320 KB Output is correct
19 Correct 92 ms 282448 KB Output is correct
20 Correct 96 ms 282452 KB Output is correct
21 Correct 100 ms 282452 KB Output is correct
22 Correct 94 ms 282192 KB Output is correct
23 Correct 104 ms 282676 KB Output is correct
24 Correct 95 ms 282452 KB Output is correct
25 Correct 103 ms 282452 KB Output is correct
26 Correct 106 ms 282452 KB Output is correct
27 Correct 131 ms 282540 KB Output is correct
28 Correct 102 ms 282448 KB Output is correct
29 Correct 98 ms 282316 KB Output is correct
30 Correct 106 ms 282448 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 282048 KB Output is correct
2 Correct 96 ms 282048 KB Output is correct
3 Correct 97 ms 282264 KB Output is correct
4 Correct 115 ms 282104 KB Output is correct
5 Correct 93 ms 282196 KB Output is correct
6 Correct 91 ms 282196 KB Output is correct
7 Correct 96 ms 282192 KB Output is correct
8 Correct 92 ms 282272 KB Output is correct
9 Correct 96 ms 282196 KB Output is correct
10 Correct 94 ms 282124 KB Output is correct
11 Correct 91 ms 282192 KB Output is correct
12 Correct 91 ms 282112 KB Output is correct
13 Correct 89 ms 282196 KB Output is correct
14 Correct 84 ms 282196 KB Output is correct
15 Correct 88 ms 282320 KB Output is correct
16 Correct 92 ms 282448 KB Output is correct
17 Correct 89 ms 282472 KB Output is correct
18 Correct 95 ms 282320 KB Output is correct
19 Correct 92 ms 282448 KB Output is correct
20 Correct 96 ms 282452 KB Output is correct
21 Correct 100 ms 282452 KB Output is correct
22 Correct 94 ms 282192 KB Output is correct
23 Correct 104 ms 282676 KB Output is correct
24 Correct 95 ms 282452 KB Output is correct
25 Correct 103 ms 282452 KB Output is correct
26 Correct 106 ms 282452 KB Output is correct
27 Correct 131 ms 282540 KB Output is correct
28 Correct 102 ms 282448 KB Output is correct
29 Correct 98 ms 282316 KB Output is correct
30 Correct 106 ms 282448 KB Output is correct
31 Correct 182 ms 288336 KB Output is correct
32 Correct 225 ms 288336 KB Output is correct
33 Correct 135 ms 283732 KB Output is correct
34 Correct 198 ms 285864 KB Output is correct
35 Correct 236 ms 289620 KB Output is correct
36 Correct 208 ms 288908 KB Output is correct
37 Correct 139 ms 285008 KB Output is correct
38 Correct 240 ms 289228 KB Output is correct
39 Correct 190 ms 289616 KB Output is correct
40 Correct 221 ms 287716 KB Output is correct
41 Correct 238 ms 288084 KB Output is correct
42 Correct 306 ms 289024 KB Output is correct
43 Correct 193 ms 287312 KB Output is correct
44 Correct 187 ms 286780 KB Output is correct
45 Correct 146 ms 285264 KB Output is correct

Subtask #4
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 282048 KB Output is correct
2 Correct 96 ms 282048 KB Output is correct
3 Correct 97 ms 282264 KB Output is correct
4 Correct 115 ms 282104 KB Output is correct
5 Correct 93 ms 282196 KB Output is correct
6 Correct 91 ms 282196 KB Output is correct
7 Correct 96 ms 282192 KB Output is correct
8 Correct 92 ms 282272 KB Output is correct
9 Correct 96 ms 282196 KB Output is correct
10 Correct 94 ms 282124 KB Output is correct
11 Correct 91 ms 282192 KB Output is correct
12 Correct 91 ms 282112 KB Output is correct
13 Correct 89 ms 282196 KB Output is correct
14 Correct 84 ms 282196 KB Output is correct
15 Correct 88 ms 282320 KB Output is correct
16 Correct 91 ms 282196 KB Output is correct
17 Correct 94 ms 282192 KB Output is correct
18 Correct 89 ms 282276 KB Output is correct
19 Correct 90 ms 282196 KB Output is correct
20 Correct 89 ms 282192 KB Output is correct
21 Correct 101 ms 282044 KB Output is correct
22 Correct 88 ms 282204 KB Output is correct
23 Correct 101 ms 282196 KB Output is correct
24 Correct 87 ms 282068 KB Output is correct
25 Correct 100 ms 282192 KB Output is correct
26 Correct 93 ms 282192 KB Output is correct
27 Correct 93 ms 282196 KB Output is correct
28 Correct 88 ms 282256 KB Output is correct
29 Correct 89 ms 282084 KB Output is correct
30 Correct 90 ms 282248 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 282048 KB Output is correct
2 Correct 96 ms 282048 KB Output is correct
3 Correct 97 ms 282264 KB Output is correct
4 Correct 115 ms 282104 KB Output is correct
5 Correct 93 ms 282196 KB Output is correct
6 Correct 91 ms 282196 KB Output is correct
7 Correct 96 ms 282192 KB Output is correct
8 Correct 92 ms 282272 KB Output is correct
9 Correct 96 ms 282196 KB Output is correct
10 Correct 94 ms 282124 KB Output is correct
11 Correct 91 ms 282192 KB Output is correct
12 Correct 91 ms 282112 KB Output is correct
13 Correct 89 ms 282196 KB Output is correct
14 Correct 84 ms 282196 KB Output is correct
15 Correct 88 ms 282320 KB Output is correct
16 Correct 92 ms 282448 KB Output is correct
17 Correct 89 ms 282472 KB Output is correct
18 Correct 95 ms 282320 KB Output is correct
19 Correct 92 ms 282448 KB Output is correct
20 Correct 96 ms 282452 KB Output is correct
21 Correct 100 ms 282452 KB Output is correct
22 Correct 94 ms 282192 KB Output is correct
23 Correct 104 ms 282676 KB Output is correct
24 Correct 95 ms 282452 KB Output is correct
25 Correct 103 ms 282452 KB Output is correct
26 Correct 106 ms 282452 KB Output is correct
27 Correct 131 ms 282540 KB Output is correct
28 Correct 102 ms 282448 KB Output is correct
29 Correct 98 ms 282316 KB Output is correct
30 Correct 106 ms 282448 KB Output is correct
31 Correct 91 ms 282196 KB Output is correct
32 Correct 94 ms 282192 KB Output is correct
33 Correct 89 ms 282276 KB Output is correct
34 Correct 90 ms 282196 KB Output is correct
35 Correct 89 ms 282192 KB Output is correct
36 Correct 101 ms 282044 KB Output is correct
37 Correct 88 ms 282204 KB Output is correct
38 Correct 101 ms 282196 KB Output is correct
39 Correct 87 ms 282068 KB Output is correct
40 Correct 100 ms 282192 KB Output is correct
41 Correct 93 ms 282192 KB Output is correct
42 Correct 93 ms 282196 KB Output is correct
43 Correct 88 ms 282256 KB Output is correct
44 Correct 89 ms 282084 KB Output is correct
45 Correct 90 ms 282248 KB Output is correct
46 Correct 101 ms 282448 KB Output is correct
47 Correct 112 ms 282708 KB Output is correct
48 Correct 111 ms 282456 KB Output is correct
49 Correct 103 ms 282448 KB Output is correct
50 Correct 137 ms 282452 KB Output is correct
51 Correct 108 ms 282452 KB Output is correct
52 Correct 105 ms 282452 KB Output is correct
53 Correct 107 ms 282516 KB Output is correct
54 Correct 104 ms 282452 KB Output is correct
55 Correct 110 ms 282452 KB Output is correct
56 Correct 110 ms 282652 KB Output is correct
57 Correct 117 ms 282448 KB Output is correct
58 Correct 102 ms 282324 KB Output is correct
59 Correct 113 ms 282588 KB Output is correct
60 Correct 102 ms 282448 KB Output is correct

Subtask #6
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 282048 KB Output is correct
2 Correct 96 ms 282048 KB Output is correct
3 Correct 97 ms 282264 KB Output is correct
4 Correct 115 ms 282104 KB Output is correct
5 Correct 93 ms 282196 KB Output is correct
6 Correct 91 ms 282196 KB Output is correct
7 Correct 96 ms 282192 KB Output is correct
8 Correct 92 ms 282272 KB Output is correct
9 Correct 96 ms 282196 KB Output is correct
10 Correct 94 ms 282124 KB Output is correct
11 Correct 91 ms 282192 KB Output is correct
12 Correct 91 ms 282112 KB Output is correct
13 Correct 89 ms 282196 KB Output is correct
14 Correct 84 ms 282196 KB Output is correct
15 Correct 88 ms 282320 KB Output is correct
16 Correct 92 ms 282448 KB Output is correct
17 Correct 89 ms 282472 KB Output is correct
18 Correct 95 ms 282320 KB Output is correct
19 Correct 92 ms 282448 KB Output is correct
20 Correct 96 ms 282452 KB Output is correct
21 Correct 100 ms 282452 KB Output is correct
22 Correct 94 ms 282192 KB Output is correct
23 Correct 104 ms 282676 KB Output is correct
24 Correct 95 ms 282452 KB Output is correct
25 Correct 103 ms 282452 KB Output is correct
26 Correct 106 ms 282452 KB Output is correct
27 Correct 131 ms 282540 KB Output is correct
28 Correct 102 ms 282448 KB Output is correct
29 Correct 98 ms 282316 KB Output is correct
30 Correct 106 ms 282448 KB Output is correct
31 Correct 182 ms 288336 KB Output is correct
32 Correct 225 ms 288336 KB Output is correct
33 Correct 135 ms 283732 KB Output is correct
34 Correct 198 ms 285864 KB Output is correct
35 Correct 236 ms 289620 KB Output is correct
36 Correct 208 ms 288908 KB Output is correct
37 Correct 139 ms 285008 KB Output is correct
38 Correct 240 ms 289228 KB Output is correct
39 Correct 190 ms 289616 KB Output is correct
40 Correct 221 ms 287716 KB Output is correct
41 Correct 238 ms 288084 KB Output is correct
42 Correct 306 ms 289024 KB Output is correct
43 Correct 193 ms 287312 KB Output is correct
44 Correct 187 ms 286780 KB Output is correct
45 Correct 146 ms 285264 KB Output is correct
46 Correct 91 ms 282196 KB Output is correct
47 Correct 94 ms 282192 KB Output is correct
48 Correct 89 ms 282276 KB Output is correct
49 Correct 90 ms 282196 KB Output is correct
50 Correct 89 ms 282192 KB Output is correct
51 Correct 101 ms 282044 KB Output is correct
52 Correct 88 ms 282204 KB Output is correct
53 Correct 101 ms 282196 KB Output is correct
54 Correct 87 ms 282068 KB Output is correct
55 Correct 100 ms 282192 KB Output is correct
56 Correct 93 ms 282192 KB Output is correct
57 Correct 93 ms 282196 KB Output is correct
58 Correct 88 ms 282256 KB Output is correct
59 Correct 89 ms 282084 KB Output is correct
60 Correct 90 ms 282248 KB Output is correct
61 Correct 101 ms 282448 KB Output is correct
62 Correct 112 ms 282708 KB Output is correct
63 Correct 111 ms 282456 KB Output is correct
64 Correct 103 ms 282448 KB Output is correct
65 Correct 137 ms 282452 KB Output is correct
66 Correct 108 ms 282452 KB Output is correct
67 Correct 105 ms 282452 KB Output is correct
68 Correct 107 ms 282516 KB Output is correct
69 Correct 104 ms 282452 KB Output is correct
70 Correct 110 ms 282452 KB Output is correct
71 Correct 110 ms 282652 KB Output is correct
72 Correct 117 ms 282448 KB Output is correct
73 Correct 102 ms 282324 KB Output is correct
74 Correct 113 ms 282588 KB Output is correct
75 Correct 102 ms 282448 KB Output is correct
76 Correct 506 ms 290640 KB Output is correct
77 Correct 539 ms 290384 KB Output is correct
78 Correct 214 ms 286204 KB Output is correct
79 Incorrect 431 ms 288140 KB Output isn't correct
80 Halted 0 ms 0 KB -