oj.uz

Submission #1001544

# Submission time Handle Problem Language Result Execution time Memory
1001544 2024-06-19T05:39:00 Z amirhoseinfar1385 Sličnost (COI23_slicnost) C++17
67 / 100
 689 ms 377776 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=(1<<(lg+1))*(lg+1)*4;
 
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 117 ms 369712 KB Output is correct
2 Correct 116 ms 369748 KB Output is correct
3 Correct 119 ms 369692 KB Output is correct
4 Correct 119 ms 369744 KB Output is correct
5 Correct 113 ms 369748 KB Output is correct
6 Correct 110 ms 369744 KB Output is correct
7 Correct 109 ms 369748 KB Output is correct
8 Correct 109 ms 369748 KB Output is correct
9 Correct 124 ms 369748 KB Output is correct
10 Correct 111 ms 369748 KB Output is correct
11 Correct 119 ms 369740 KB Output is correct
12 Correct 129 ms 369748 KB Output is correct
13 Correct 124 ms 369744 KB Output is correct
14 Correct 119 ms 369744 KB Output is correct
15 Correct 122 ms 369748 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 117 ms 369712 KB Output is correct
2 Correct 116 ms 369748 KB Output is correct
3 Correct 119 ms 369692 KB Output is correct
4 Correct 119 ms 369744 KB Output is correct
5 Correct 113 ms 369748 KB Output is correct
6 Correct 110 ms 369744 KB Output is correct
7 Correct 109 ms 369748 KB Output is correct
8 Correct 109 ms 369748 KB Output is correct
9 Correct 124 ms 369748 KB Output is correct
10 Correct 111 ms 369748 KB Output is correct
11 Correct 119 ms 369740 KB Output is correct
12 Correct 129 ms 369748 KB Output is correct
13 Correct 124 ms 369744 KB Output is correct
14 Correct 119 ms 369744 KB Output is correct
15 Correct 122 ms 369748 KB Output is correct
16 Correct 117 ms 369976 KB Output is correct
17 Correct 134 ms 370128 KB Output is correct
18 Correct 119 ms 369748 KB Output is correct
19 Correct 118 ms 370008 KB Output is correct
20 Correct 119 ms 370004 KB Output is correct
21 Correct 123 ms 370004 KB Output is correct
22 Correct 118 ms 369748 KB Output is correct
23 Correct 124 ms 370076 KB Output is correct
24 Correct 119 ms 370004 KB Output is correct
25 Correct 126 ms 369868 KB Output is correct
26 Correct 122 ms 370000 KB Output is correct
27 Correct 126 ms 370004 KB Output is correct
28 Correct 121 ms 370056 KB Output is correct
29 Correct 130 ms 369944 KB Output is correct
30 Correct 124 ms 369812 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 117 ms 369712 KB Output is correct
2 Correct 116 ms 369748 KB Output is correct
3 Correct 119 ms 369692 KB Output is correct
4 Correct 119 ms 369744 KB Output is correct
5 Correct 113 ms 369748 KB Output is correct
6 Correct 110 ms 369744 KB Output is correct
7 Correct 109 ms 369748 KB Output is correct
8 Correct 109 ms 369748 KB Output is correct
9 Correct 124 ms 369748 KB Output is correct
10 Correct 111 ms 369748 KB Output is correct
11 Correct 119 ms 369740 KB Output is correct
12 Correct 129 ms 369748 KB Output is correct
13 Correct 124 ms 369744 KB Output is correct
14 Correct 119 ms 369744 KB Output is correct
15 Correct 122 ms 369748 KB Output is correct
16 Correct 117 ms 369976 KB Output is correct
17 Correct 134 ms 370128 KB Output is correct
18 Correct 119 ms 369748 KB Output is correct
19 Correct 118 ms 370008 KB Output is correct
20 Correct 119 ms 370004 KB Output is correct
21 Correct 123 ms 370004 KB Output is correct
22 Correct 118 ms 369748 KB Output is correct
23 Correct 124 ms 370076 KB Output is correct
24 Correct 119 ms 370004 KB Output is correct
25 Correct 126 ms 369868 KB Output is correct
26 Correct 122 ms 370000 KB Output is correct
27 Correct 126 ms 370004 KB Output is correct
28 Correct 121 ms 370056 KB Output is correct
29 Correct 130 ms 369944 KB Output is correct
30 Correct 124 ms 369812 KB Output is correct
31 Correct 227 ms 376632 KB Output is correct
32 Correct 208 ms 376656 KB Output is correct
33 Correct 151 ms 372052 KB Output is correct
34 Correct 214 ms 374384 KB Output is correct
35 Correct 269 ms 376656 KB Output is correct
36 Correct 206 ms 376312 KB Output is correct
37 Correct 156 ms 372304 KB Output is correct
38 Correct 310 ms 376400 KB Output is correct
39 Correct 204 ms 376656 KB Output is correct
40 Correct 232 ms 374872 KB Output is correct
41 Correct 259 ms 375380 KB Output is correct
42 Correct 291 ms 376152 KB Output is correct
43 Correct 276 ms 374492 KB Output is correct
44 Correct 216 ms 373840 KB Output is correct
45 Correct 169 ms 372304 KB Output is correct

Subtask #4
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 117 ms 369712 KB Output is correct
2 Correct 116 ms 369748 KB Output is correct
3 Correct 119 ms 369692 KB Output is correct
4 Correct 119 ms 369744 KB Output is correct
5 Correct 113 ms 369748 KB Output is correct
6 Correct 110 ms 369744 KB Output is correct
7 Correct 109 ms 369748 KB Output is correct
8 Correct 109 ms 369748 KB Output is correct
9 Correct 124 ms 369748 KB Output is correct
10 Correct 111 ms 369748 KB Output is correct
11 Correct 119 ms 369740 KB Output is correct
12 Correct 129 ms 369748 KB Output is correct
13 Correct 124 ms 369744 KB Output is correct
14 Correct 119 ms 369744 KB Output is correct
15 Correct 122 ms 369748 KB Output is correct
16 Correct 119 ms 369744 KB Output is correct
17 Correct 110 ms 369744 KB Output is correct
18 Correct 124 ms 369588 KB Output is correct
19 Correct 116 ms 369792 KB Output is correct
20 Correct 117 ms 369728 KB Output is correct
21 Correct 146 ms 369744 KB Output is correct
22 Correct 113 ms 369744 KB Output is correct
23 Correct 114 ms 369748 KB Output is correct
24 Correct 123 ms 369744 KB Output is correct
25 Correct 133 ms 369640 KB Output is correct
26 Correct 115 ms 369744 KB Output is correct
27 Correct 123 ms 369728 KB Output is correct
28 Correct 112 ms 369616 KB Output is correct
29 Correct 107 ms 369576 KB Output is correct
30 Correct 125 ms 369748 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 117 ms 369712 KB Output is correct
2 Correct 116 ms 369748 KB Output is correct
3 Correct 119 ms 369692 KB Output is correct
4 Correct 119 ms 369744 KB Output is correct
5 Correct 113 ms 369748 KB Output is correct
6 Correct 110 ms 369744 KB Output is correct
7 Correct 109 ms 369748 KB Output is correct
8 Correct 109 ms 369748 KB Output is correct
9 Correct 124 ms 369748 KB Output is correct
10 Correct 111 ms 369748 KB Output is correct
11 Correct 119 ms 369740 KB Output is correct
12 Correct 129 ms 369748 KB Output is correct
13 Correct 124 ms 369744 KB Output is correct
14 Correct 119 ms 369744 KB Output is correct
15 Correct 122 ms 369748 KB Output is correct
16 Correct 117 ms 369976 KB Output is correct
17 Correct 134 ms 370128 KB Output is correct
18 Correct 119 ms 369748 KB Output is correct
19 Correct 118 ms 370008 KB Output is correct
20 Correct 119 ms 370004 KB Output is correct
21 Correct 123 ms 370004 KB Output is correct
22 Correct 118 ms 369748 KB Output is correct
23 Correct 124 ms 370076 KB Output is correct
24 Correct 119 ms 370004 KB Output is correct
25 Correct 126 ms 369868 KB Output is correct
26 Correct 122 ms 370000 KB Output is correct
27 Correct 126 ms 370004 KB Output is correct
28 Correct 121 ms 370056 KB Output is correct
29 Correct 130 ms 369944 KB Output is correct
30 Correct 124 ms 369812 KB Output is correct
31 Correct 119 ms 369744 KB Output is correct
32 Correct 110 ms 369744 KB Output is correct
33 Correct 124 ms 369588 KB Output is correct
34 Correct 116 ms 369792 KB Output is correct
35 Correct 117 ms 369728 KB Output is correct
36 Correct 146 ms 369744 KB Output is correct
37 Correct 113 ms 369744 KB Output is correct
38 Correct 114 ms 369748 KB Output is correct
39 Correct 123 ms 369744 KB Output is correct
40 Correct 133 ms 369640 KB Output is correct
41 Correct 115 ms 369744 KB Output is correct
42 Correct 123 ms 369728 KB Output is correct
43 Correct 112 ms 369616 KB Output is correct
44 Correct 107 ms 369576 KB Output is correct
45 Correct 125 ms 369748 KB Output is correct
46 Correct 121 ms 370004 KB Output is correct
47 Correct 134 ms 370220 KB Output is correct
48 Correct 120 ms 369748 KB Output is correct
49 Correct 140 ms 370004 KB Output is correct
50 Correct 143 ms 370000 KB Output is correct
51 Correct 131 ms 370004 KB Output is correct
52 Correct 142 ms 370156 KB Output is correct
53 Correct 141 ms 370004 KB Output is correct
54 Correct 162 ms 370240 KB Output is correct
55 Correct 132 ms 370004 KB Output is correct
56 Correct 144 ms 369988 KB Output is correct
57 Correct 140 ms 370000 KB Output is correct
58 Correct 140 ms 369892 KB Output is correct
59 Correct 146 ms 370004 KB Output is correct
60 Correct 133 ms 370004 KB Output is correct

Subtask #6
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 117 ms 369712 KB Output is correct
2 Correct 116 ms 369748 KB Output is correct
3 Correct 119 ms 369692 KB Output is correct
4 Correct 119 ms 369744 KB Output is correct
5 Correct 113 ms 369748 KB Output is correct
6 Correct 110 ms 369744 KB Output is correct
7 Correct 109 ms 369748 KB Output is correct
8 Correct 109 ms 369748 KB Output is correct
9 Correct 124 ms 369748 KB Output is correct
10 Correct 111 ms 369748 KB Output is correct
11 Correct 119 ms 369740 KB Output is correct
12 Correct 129 ms 369748 KB Output is correct
13 Correct 124 ms 369744 KB Output is correct
14 Correct 119 ms 369744 KB Output is correct
15 Correct 122 ms 369748 KB Output is correct
16 Correct 117 ms 369976 KB Output is correct
17 Correct 134 ms 370128 KB Output is correct
18 Correct 119 ms 369748 KB Output is correct
19 Correct 118 ms 370008 KB Output is correct
20 Correct 119 ms 370004 KB Output is correct
21 Correct 123 ms 370004 KB Output is correct
22 Correct 118 ms 369748 KB Output is correct
23 Correct 124 ms 370076 KB Output is correct
24 Correct 119 ms 370004 KB Output is correct
25 Correct 126 ms 369868 KB Output is correct
26 Correct 122 ms 370000 KB Output is correct
27 Correct 126 ms 370004 KB Output is correct
28 Correct 121 ms 370056 KB Output is correct
29 Correct 130 ms 369944 KB Output is correct
30 Correct 124 ms 369812 KB Output is correct
31 Correct 227 ms 376632 KB Output is correct
32 Correct 208 ms 376656 KB Output is correct
33 Correct 151 ms 372052 KB Output is correct
34 Correct 214 ms 374384 KB Output is correct
35 Correct 269 ms 376656 KB Output is correct
36 Correct 206 ms 376312 KB Output is correct
37 Correct 156 ms 372304 KB Output is correct
38 Correct 310 ms 376400 KB Output is correct
39 Correct 204 ms 376656 KB Output is correct
40 Correct 232 ms 374872 KB Output is correct
41 Correct 259 ms 375380 KB Output is correct
42 Correct 291 ms 376152 KB Output is correct
43 Correct 276 ms 374492 KB Output is correct
44 Correct 216 ms 373840 KB Output is correct
45 Correct 169 ms 372304 KB Output is correct
46 Correct 119 ms 369744 KB Output is correct
47 Correct 110 ms 369744 KB Output is correct
48 Correct 124 ms 369588 KB Output is correct
49 Correct 116 ms 369792 KB Output is correct
50 Correct 117 ms 369728 KB Output is correct
51 Correct 146 ms 369744 KB Output is correct
52 Correct 113 ms 369744 KB Output is correct
53 Correct 114 ms 369748 KB Output is correct
54 Correct 123 ms 369744 KB Output is correct
55 Correct 133 ms 369640 KB Output is correct
56 Correct 115 ms 369744 KB Output is correct
57 Correct 123 ms 369728 KB Output is correct
58 Correct 112 ms 369616 KB Output is correct
59 Correct 107 ms 369576 KB Output is correct
60 Correct 125 ms 369748 KB Output is correct
61 Correct 121 ms 370004 KB Output is correct
62 Correct 134 ms 370220 KB Output is correct
63 Correct 120 ms 369748 KB Output is correct
64 Correct 140 ms 370004 KB Output is correct
65 Correct 143 ms 370000 KB Output is correct
66 Correct 131 ms 370004 KB Output is correct
67 Correct 142 ms 370156 KB Output is correct
68 Correct 141 ms 370004 KB Output is correct
69 Correct 162 ms 370240 KB Output is correct
70 Correct 132 ms 370004 KB Output is correct
71 Correct 144 ms 369988 KB Output is correct
72 Correct 140 ms 370000 KB Output is correct
73 Correct 140 ms 369892 KB Output is correct
74 Correct 146 ms 370004 KB Output is correct
75 Correct 133 ms 370004 KB Output is correct
76 Correct 620 ms 377776 KB Output is correct
77 Correct 626 ms 377332 KB Output is correct
78 Correct 231 ms 373076 KB Output is correct
79 Incorrect 689 ms 375748 KB Output isn't correct
80 Halted 0 ms 0 KB -