oj.uz

Submission #1001520

# Submission time Handle Problem Language Result Execution time Memory
1001520 2024-06-19T05:18:27 Z amirhoseinfar1385 Sličnost (COI23_slicnost) C++17
67 / 100
 2910 ms 524292 KB 
#include<bits/stdc++.h>
using namespace std;
const int maxn=300000+10,lg=19;
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;
		node(){
			ted=0;
			cl=cr=0;
			maxa=lazy=0;
		}
	};
	node seg[(1<<(lg+1))*lg];
	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(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 147 ms 390484 KB Output is correct
2 Correct 129 ms 390484 KB Output is correct
3 Correct 133 ms 390484 KB Output is correct
4 Correct 140 ms 390480 KB Output is correct
5 Correct 136 ms 390476 KB Output is correct
6 Correct 142 ms 390484 KB Output is correct
7 Correct 143 ms 390284 KB Output is correct
8 Correct 137 ms 390444 KB Output is correct
9 Correct 138 ms 390360 KB Output is correct
10 Correct 134 ms 390480 KB Output is correct
11 Correct 140 ms 390440 KB Output is correct
12 Correct 126 ms 390484 KB Output is correct
13 Correct 131 ms 390476 KB Output is correct
14 Correct 131 ms 390364 KB Output is correct
15 Correct 137 ms 390356 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 147 ms 390484 KB Output is correct
2 Correct 129 ms 390484 KB Output is correct
3 Correct 133 ms 390484 KB Output is correct
4 Correct 140 ms 390480 KB Output is correct
5 Correct 136 ms 390476 KB Output is correct
6 Correct 142 ms 390484 KB Output is correct
7 Correct 143 ms 390284 KB Output is correct
8 Correct 137 ms 390444 KB Output is correct
9 Correct 138 ms 390360 KB Output is correct
10 Correct 134 ms 390480 KB Output is correct
11 Correct 140 ms 390440 KB Output is correct
12 Correct 126 ms 390484 KB Output is correct
13 Correct 131 ms 390476 KB Output is correct
14 Correct 131 ms 390364 KB Output is correct
15 Correct 137 ms 390356 KB Output is correct
16 Correct 133 ms 390736 KB Output is correct
17 Correct 146 ms 390836 KB Output is correct
18 Correct 145 ms 390480 KB Output is correct
19 Correct 135 ms 390740 KB Output is correct
20 Correct 133 ms 390780 KB Output is correct
21 Correct 139 ms 390740 KB Output is correct
22 Correct 137 ms 390480 KB Output is correct
23 Correct 150 ms 390668 KB Output is correct
24 Correct 129 ms 390736 KB Output is correct
25 Correct 150 ms 390736 KB Output is correct
26 Correct 144 ms 390540 KB Output is correct
27 Correct 144 ms 390732 KB Output is correct
28 Correct 144 ms 390696 KB Output is correct
29 Correct 143 ms 390544 KB Output is correct
30 Correct 146 ms 390416 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 147 ms 390484 KB Output is correct
2 Correct 129 ms 390484 KB Output is correct
3 Correct 133 ms 390484 KB Output is correct
4 Correct 140 ms 390480 KB Output is correct
5 Correct 136 ms 390476 KB Output is correct
6 Correct 142 ms 390484 KB Output is correct
7 Correct 143 ms 390284 KB Output is correct
8 Correct 137 ms 390444 KB Output is correct
9 Correct 138 ms 390360 KB Output is correct
10 Correct 134 ms 390480 KB Output is correct
11 Correct 140 ms 390440 KB Output is correct
12 Correct 126 ms 390484 KB Output is correct
13 Correct 131 ms 390476 KB Output is correct
14 Correct 131 ms 390364 KB Output is correct
15 Correct 137 ms 390356 KB Output is correct
16 Correct 133 ms 390736 KB Output is correct
17 Correct 146 ms 390836 KB Output is correct
18 Correct 145 ms 390480 KB Output is correct
19 Correct 135 ms 390740 KB Output is correct
20 Correct 133 ms 390780 KB Output is correct
21 Correct 139 ms 390740 KB Output is correct
22 Correct 137 ms 390480 KB Output is correct
23 Correct 150 ms 390668 KB Output is correct
24 Correct 129 ms 390736 KB Output is correct
25 Correct 150 ms 390736 KB Output is correct
26 Correct 144 ms 390540 KB Output is correct
27 Correct 144 ms 390732 KB Output is correct
28 Correct 144 ms 390696 KB Output is correct
29 Correct 143 ms 390544 KB Output is correct
30 Correct 146 ms 390416 KB Output is correct
31 Correct 228 ms 397508 KB Output is correct
32 Correct 242 ms 397524 KB Output is correct
33 Correct 171 ms 392788 KB Output is correct
34 Correct 277 ms 395104 KB Output is correct
35 Correct 323 ms 397536 KB Output is correct
36 Correct 262 ms 397136 KB Output is correct
37 Correct 193 ms 393300 KB Output is correct
38 Correct 272 ms 397396 KB Output is correct
39 Correct 227 ms 397656 KB Output is correct
40 Correct 266 ms 395604 KB Output is correct
41 Correct 271 ms 396168 KB Output is correct
42 Correct 312 ms 396936 KB Output is correct
43 Correct 244 ms 395380 KB Output is correct
44 Correct 219 ms 394792 KB Output is correct
45 Correct 180 ms 393296 KB Output is correct

Subtask #4
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 147 ms 390484 KB Output is correct
2 Correct 129 ms 390484 KB Output is correct
3 Correct 133 ms 390484 KB Output is correct
4 Correct 140 ms 390480 KB Output is correct
5 Correct 136 ms 390476 KB Output is correct
6 Correct 142 ms 390484 KB Output is correct
7 Correct 143 ms 390284 KB Output is correct
8 Correct 137 ms 390444 KB Output is correct
9 Correct 138 ms 390360 KB Output is correct
10 Correct 134 ms 390480 KB Output is correct
11 Correct 140 ms 390440 KB Output is correct
12 Correct 126 ms 390484 KB Output is correct
13 Correct 131 ms 390476 KB Output is correct
14 Correct 131 ms 390364 KB Output is correct
15 Correct 137 ms 390356 KB Output is correct
16 Correct 128 ms 390484 KB Output is correct
17 Correct 151 ms 390324 KB Output is correct
18 Correct 151 ms 390544 KB Output is correct
19 Correct 142 ms 390484 KB Output is correct
20 Correct 135 ms 390476 KB Output is correct
21 Correct 137 ms 390480 KB Output is correct
22 Correct 141 ms 390300 KB Output is correct
23 Correct 136 ms 390472 KB Output is correct
24 Correct 150 ms 390392 KB Output is correct
25 Correct 137 ms 390484 KB Output is correct
26 Correct 136 ms 390480 KB Output is correct
27 Correct 134 ms 390480 KB Output is correct
28 Correct 155 ms 390368 KB Output is correct
29 Correct 136 ms 390496 KB Output is correct
30 Correct 128 ms 390428 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 147 ms 390484 KB Output is correct
2 Correct 129 ms 390484 KB Output is correct
3 Correct 133 ms 390484 KB Output is correct
4 Correct 140 ms 390480 KB Output is correct
5 Correct 136 ms 390476 KB Output is correct
6 Correct 142 ms 390484 KB Output is correct
7 Correct 143 ms 390284 KB Output is correct
8 Correct 137 ms 390444 KB Output is correct
9 Correct 138 ms 390360 KB Output is correct
10 Correct 134 ms 390480 KB Output is correct
11 Correct 140 ms 390440 KB Output is correct
12 Correct 126 ms 390484 KB Output is correct
13 Correct 131 ms 390476 KB Output is correct
14 Correct 131 ms 390364 KB Output is correct
15 Correct 137 ms 390356 KB Output is correct
16 Correct 133 ms 390736 KB Output is correct
17 Correct 146 ms 390836 KB Output is correct
18 Correct 145 ms 390480 KB Output is correct
19 Correct 135 ms 390740 KB Output is correct
20 Correct 133 ms 390780 KB Output is correct
21 Correct 139 ms 390740 KB Output is correct
22 Correct 137 ms 390480 KB Output is correct
23 Correct 150 ms 390668 KB Output is correct
24 Correct 129 ms 390736 KB Output is correct
25 Correct 150 ms 390736 KB Output is correct
26 Correct 144 ms 390540 KB Output is correct
27 Correct 144 ms 390732 KB Output is correct
28 Correct 144 ms 390696 KB Output is correct
29 Correct 143 ms 390544 KB Output is correct
30 Correct 146 ms 390416 KB Output is correct
31 Correct 128 ms 390484 KB Output is correct
32 Correct 151 ms 390324 KB Output is correct
33 Correct 151 ms 390544 KB Output is correct
34 Correct 142 ms 390484 KB Output is correct
35 Correct 135 ms 390476 KB Output is correct
36 Correct 137 ms 390480 KB Output is correct
37 Correct 141 ms 390300 KB Output is correct
38 Correct 136 ms 390472 KB Output is correct
39 Correct 150 ms 390392 KB Output is correct
40 Correct 137 ms 390484 KB Output is correct
41 Correct 136 ms 390480 KB Output is correct
42 Correct 134 ms 390480 KB Output is correct
43 Correct 155 ms 390368 KB Output is correct
44 Correct 136 ms 390496 KB Output is correct
45 Correct 128 ms 390428 KB Output is correct
46 Correct 166 ms 390772 KB Output is correct
47 Correct 158 ms 390740 KB Output is correct
48 Correct 143 ms 390424 KB Output is correct
49 Correct 147 ms 390656 KB Output is correct
50 Correct 156 ms 390740 KB Output is correct
51 Correct 144 ms 390484 KB Output is correct
52 Correct 150 ms 390724 KB Output is correct
53 Correct 154 ms 390736 KB Output is correct
54 Correct 160 ms 390736 KB Output is correct
55 Correct 157 ms 390740 KB Output is correct
56 Correct 176 ms 390740 KB Output is correct
57 Correct 159 ms 390740 KB Output is correct
58 Correct 155 ms 390532 KB Output is correct
59 Correct 150 ms 390740 KB Output is correct
60 Correct 150 ms 390740 KB Output is correct

Subtask #6
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 147 ms 390484 KB Output is correct
2 Correct 129 ms 390484 KB Output is correct
3 Correct 133 ms 390484 KB Output is correct
4 Correct 140 ms 390480 KB Output is correct
5 Correct 136 ms 390476 KB Output is correct
6 Correct 142 ms 390484 KB Output is correct
7 Correct 143 ms 390284 KB Output is correct
8 Correct 137 ms 390444 KB Output is correct
9 Correct 138 ms 390360 KB Output is correct
10 Correct 134 ms 390480 KB Output is correct
11 Correct 140 ms 390440 KB Output is correct
12 Correct 126 ms 390484 KB Output is correct
13 Correct 131 ms 390476 KB Output is correct
14 Correct 131 ms 390364 KB Output is correct
15 Correct 137 ms 390356 KB Output is correct
16 Correct 133 ms 390736 KB Output is correct
17 Correct 146 ms 390836 KB Output is correct
18 Correct 145 ms 390480 KB Output is correct
19 Correct 135 ms 390740 KB Output is correct
20 Correct 133 ms 390780 KB Output is correct
21 Correct 139 ms 390740 KB Output is correct
22 Correct 137 ms 390480 KB Output is correct
23 Correct 150 ms 390668 KB Output is correct
24 Correct 129 ms 390736 KB Output is correct
25 Correct 150 ms 390736 KB Output is correct
26 Correct 144 ms 390540 KB Output is correct
27 Correct 144 ms 390732 KB Output is correct
28 Correct 144 ms 390696 KB Output is correct
29 Correct 143 ms 390544 KB Output is correct
30 Correct 146 ms 390416 KB Output is correct
31 Correct 228 ms 397508 KB Output is correct
32 Correct 242 ms 397524 KB Output is correct
33 Correct 171 ms 392788 KB Output is correct
34 Correct 277 ms 395104 KB Output is correct
35 Correct 323 ms 397536 KB Output is correct
36 Correct 262 ms 397136 KB Output is correct
37 Correct 193 ms 393300 KB Output is correct
38 Correct 272 ms 397396 KB Output is correct
39 Correct 227 ms 397656 KB Output is correct
40 Correct 266 ms 395604 KB Output is correct
41 Correct 271 ms 396168 KB Output is correct
42 Correct 312 ms 396936 KB Output is correct
43 Correct 244 ms 395380 KB Output is correct
44 Correct 219 ms 394792 KB Output is correct
45 Correct 180 ms 393296 KB Output is correct
46 Correct 128 ms 390484 KB Output is correct
47 Correct 151 ms 390324 KB Output is correct
48 Correct 151 ms 390544 KB Output is correct
49 Correct 142 ms 390484 KB Output is correct
50 Correct 135 ms 390476 KB Output is correct
51 Correct 137 ms 390480 KB Output is correct
52 Correct 141 ms 390300 KB Output is correct
53 Correct 136 ms 390472 KB Output is correct
54 Correct 150 ms 390392 KB Output is correct
55 Correct 137 ms 390484 KB Output is correct
56 Correct 136 ms 390480 KB Output is correct
57 Correct 134 ms 390480 KB Output is correct
58 Correct 155 ms 390368 KB Output is correct
59 Correct 136 ms 390496 KB Output is correct
60 Correct 128 ms 390428 KB Output is correct
61 Correct 166 ms 390772 KB Output is correct
62 Correct 158 ms 390740 KB Output is correct
63 Correct 143 ms 390424 KB Output is correct
64 Correct 147 ms 390656 KB Output is correct
65 Correct 156 ms 390740 KB Output is correct
66 Correct 144 ms 390484 KB Output is correct
67 Correct 150 ms 390724 KB Output is correct
68 Correct 154 ms 390736 KB Output is correct
69 Correct 160 ms 390736 KB Output is correct
70 Correct 157 ms 390740 KB Output is correct
71 Correct 176 ms 390740 KB Output is correct
72 Correct 159 ms 390740 KB Output is correct
73 Correct 155 ms 390532 KB Output is correct
74 Correct 150 ms 390740 KB Output is correct
75 Correct 150 ms 390740 KB Output is correct
76 Correct 606 ms 398676 KB Output is correct
77 Correct 639 ms 398464 KB Output is correct
78 Correct 247 ms 394068 KB Output is correct
79 Runtime error 2910 ms 524292 KB Execution killed with signal 9
80 Halted 0 ms 0 KB -