oj.uz

Submission #1001552

# Submission time Handle Problem Language Result Execution time Memory
1001552 2024-06-19T05:42:34 Z amirhoseinfar1385 Sličnost (COI23_slicnost) C++17
34 / 100
 197 ms 153680 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)*maxn*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 47 ms 146260 KB Output is correct
2 Correct 48 ms 146256 KB Output is correct
3 Correct 48 ms 146256 KB Output is correct
4 Correct 64 ms 146336 KB Output is correct
5 Correct 50 ms 146256 KB Output is correct
6 Correct 47 ms 146456 KB Output is correct
7 Correct 47 ms 146260 KB Output is correct
8 Correct 49 ms 146260 KB Output is correct
9 Correct 59 ms 146312 KB Output is correct
10 Correct 48 ms 146296 KB Output is correct
11 Correct 50 ms 146260 KB Output is correct
12 Correct 47 ms 146256 KB Output is correct
13 Correct 47 ms 146428 KB Output is correct
14 Correct 55 ms 146256 KB Output is correct
15 Correct 51 ms 146256 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 146260 KB Output is correct
2 Correct 48 ms 146256 KB Output is correct
3 Correct 48 ms 146256 KB Output is correct
4 Correct 64 ms 146336 KB Output is correct
5 Correct 50 ms 146256 KB Output is correct
6 Correct 47 ms 146456 KB Output is correct
7 Correct 47 ms 146260 KB Output is correct
8 Correct 49 ms 146260 KB Output is correct
9 Correct 59 ms 146312 KB Output is correct
10 Correct 48 ms 146296 KB Output is correct
11 Correct 50 ms 146260 KB Output is correct
12 Correct 47 ms 146256 KB Output is correct
13 Correct 47 ms 146428 KB Output is correct
14 Correct 55 ms 146256 KB Output is correct
15 Correct 51 ms 146256 KB Output is correct
16 Correct 49 ms 146768 KB Output is correct
17 Correct 52 ms 146772 KB Output is correct
18 Correct 46 ms 146436 KB Output is correct
19 Correct 52 ms 146548 KB Output is correct
20 Correct 62 ms 146768 KB Output is correct
21 Correct 67 ms 146760 KB Output is correct
22 Correct 63 ms 146516 KB Output is correct
23 Correct 54 ms 146768 KB Output is correct
24 Correct 49 ms 146772 KB Output is correct
25 Correct 56 ms 146516 KB Output is correct
26 Correct 54 ms 146680 KB Output is correct
27 Correct 66 ms 146644 KB Output is correct
28 Correct 50 ms 146512 KB Output is correct
29 Correct 52 ms 146516 KB Output is correct
30 Correct 52 ms 146512 KB Output is correct

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 146260 KB Output is correct
2 Correct 48 ms 146256 KB Output is correct
3 Correct 48 ms 146256 KB Output is correct
4 Correct 64 ms 146336 KB Output is correct
5 Correct 50 ms 146256 KB Output is correct
6 Correct 47 ms 146456 KB Output is correct
7 Correct 47 ms 146260 KB Output is correct
8 Correct 49 ms 146260 KB Output is correct
9 Correct 59 ms 146312 KB Output is correct
10 Correct 48 ms 146296 KB Output is correct
11 Correct 50 ms 146260 KB Output is correct
12 Correct 47 ms 146256 KB Output is correct
13 Correct 47 ms 146428 KB Output is correct
14 Correct 55 ms 146256 KB Output is correct
15 Correct 51 ms 146256 KB Output is correct
16 Correct 49 ms 146768 KB Output is correct
17 Correct 52 ms 146772 KB Output is correct
18 Correct 46 ms 146436 KB Output is correct
19 Correct 52 ms 146548 KB Output is correct
20 Correct 62 ms 146768 KB Output is correct
21 Correct 67 ms 146760 KB Output is correct
22 Correct 63 ms 146516 KB Output is correct
23 Correct 54 ms 146768 KB Output is correct
24 Correct 49 ms 146772 KB Output is correct
25 Correct 56 ms 146516 KB Output is correct
26 Correct 54 ms 146680 KB Output is correct
27 Correct 66 ms 146644 KB Output is correct
28 Correct 50 ms 146512 KB Output is correct
29 Correct 52 ms 146516 KB Output is correct
30 Correct 52 ms 146512 KB Output is correct
31 Correct 129 ms 153496 KB Output is correct
32 Correct 123 ms 153680 KB Output is correct
33 Correct 83 ms 148912 KB Output is correct
34 Correct 148 ms 151360 KB Output is correct
35 Correct 197 ms 153680 KB Output is correct
36 Incorrect 138 ms 153168 KB Output isn't correct
37 Halted 0 ms 0 KB -

Subtask #4
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 146260 KB Output is correct
2 Correct 48 ms 146256 KB Output is correct
3 Correct 48 ms 146256 KB Output is correct
4 Correct 64 ms 146336 KB Output is correct
5 Correct 50 ms 146256 KB Output is correct
6 Correct 47 ms 146456 KB Output is correct
7 Correct 47 ms 146260 KB Output is correct
8 Correct 49 ms 146260 KB Output is correct
9 Correct 59 ms 146312 KB Output is correct
10 Correct 48 ms 146296 KB Output is correct
11 Correct 50 ms 146260 KB Output is correct
12 Correct 47 ms 146256 KB Output is correct
13 Correct 47 ms 146428 KB Output is correct
14 Correct 55 ms 146256 KB Output is correct
15 Correct 51 ms 146256 KB Output is correct
16 Correct 47 ms 146256 KB Output is correct
17 Correct 54 ms 146256 KB Output is correct
18 Correct 48 ms 146256 KB Output is correct
19 Correct 45 ms 146396 KB Output is correct
20 Correct 47 ms 146260 KB Output is correct
21 Correct 46 ms 146260 KB Output is correct
22 Correct 46 ms 146256 KB Output is correct
23 Correct 49 ms 146444 KB Output is correct
24 Correct 48 ms 146256 KB Output is correct
25 Correct 69 ms 146280 KB Output is correct
26 Correct 47 ms 146260 KB Output is correct
27 Correct 48 ms 146260 KB Output is correct
28 Correct 55 ms 146260 KB Output is correct
29 Correct 48 ms 146260 KB Output is correct
30 Correct 50 ms 146252 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 146260 KB Output is correct
2 Correct 48 ms 146256 KB Output is correct
3 Correct 48 ms 146256 KB Output is correct
4 Correct 64 ms 146336 KB Output is correct
5 Correct 50 ms 146256 KB Output is correct
6 Correct 47 ms 146456 KB Output is correct
7 Correct 47 ms 146260 KB Output is correct
8 Correct 49 ms 146260 KB Output is correct
9 Correct 59 ms 146312 KB Output is correct
10 Correct 48 ms 146296 KB Output is correct
11 Correct 50 ms 146260 KB Output is correct
12 Correct 47 ms 146256 KB Output is correct
13 Correct 47 ms 146428 KB Output is correct
14 Correct 55 ms 146256 KB Output is correct
15 Correct 51 ms 146256 KB Output is correct
16 Correct 49 ms 146768 KB Output is correct
17 Correct 52 ms 146772 KB Output is correct
18 Correct 46 ms 146436 KB Output is correct
19 Correct 52 ms 146548 KB Output is correct
20 Correct 62 ms 146768 KB Output is correct
21 Correct 67 ms 146760 KB Output is correct
22 Correct 63 ms 146516 KB Output is correct
23 Correct 54 ms 146768 KB Output is correct
24 Correct 49 ms 146772 KB Output is correct
25 Correct 56 ms 146516 KB Output is correct
26 Correct 54 ms 146680 KB Output is correct
27 Correct 66 ms 146644 KB Output is correct
28 Correct 50 ms 146512 KB Output is correct
29 Correct 52 ms 146516 KB Output is correct
30 Correct 52 ms 146512 KB Output is correct
31 Correct 47 ms 146256 KB Output is correct
32 Correct 54 ms 146256 KB Output is correct
33 Correct 48 ms 146256 KB Output is correct
34 Correct 45 ms 146396 KB Output is correct
35 Correct 47 ms 146260 KB Output is correct
36 Correct 46 ms 146260 KB Output is correct
37 Correct 46 ms 146256 KB Output is correct
38 Correct 49 ms 146444 KB Output is correct
39 Correct 48 ms 146256 KB Output is correct
40 Correct 69 ms 146280 KB Output is correct
41 Correct 47 ms 146260 KB Output is correct
42 Correct 48 ms 146260 KB Output is correct
43 Correct 55 ms 146260 KB Output is correct
44 Correct 48 ms 146260 KB Output is correct
45 Correct 50 ms 146252 KB Output is correct
46 Correct 59 ms 146840 KB Output is correct
47 Correct 64 ms 146724 KB Output is correct
48 Correct 52 ms 146576 KB Output is correct
49 Correct 63 ms 146772 KB Output is correct
50 Correct 75 ms 146880 KB Output is correct
51 Correct 62 ms 146556 KB Output is correct
52 Correct 68 ms 146756 KB Output is correct
53 Correct 70 ms 146884 KB Output is correct
54 Correct 66 ms 146800 KB Output is correct
55 Correct 55 ms 146772 KB Output is correct
56 Correct 67 ms 146904 KB Output is correct
57 Correct 67 ms 146836 KB Output is correct
58 Correct 61 ms 146504 KB Output is correct
59 Correct 72 ms 146740 KB Output is correct
60 Correct 71 ms 146592 KB Output is correct

Subtask #6
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 146260 KB Output is correct
2 Correct 48 ms 146256 KB Output is correct
3 Correct 48 ms 146256 KB Output is correct
4 Correct 64 ms 146336 KB Output is correct
5 Correct 50 ms 146256 KB Output is correct
6 Correct 47 ms 146456 KB Output is correct
7 Correct 47 ms 146260 KB Output is correct
8 Correct 49 ms 146260 KB Output is correct
9 Correct 59 ms 146312 KB Output is correct
10 Correct 48 ms 146296 KB Output is correct
11 Correct 50 ms 146260 KB Output is correct
12 Correct 47 ms 146256 KB Output is correct
13 Correct 47 ms 146428 KB Output is correct
14 Correct 55 ms 146256 KB Output is correct
15 Correct 51 ms 146256 KB Output is correct
16 Correct 49 ms 146768 KB Output is correct
17 Correct 52 ms 146772 KB Output is correct
18 Correct 46 ms 146436 KB Output is correct
19 Correct 52 ms 146548 KB Output is correct
20 Correct 62 ms 146768 KB Output is correct
21 Correct 67 ms 146760 KB Output is correct
22 Correct 63 ms 146516 KB Output is correct
23 Correct 54 ms 146768 KB Output is correct
24 Correct 49 ms 146772 KB Output is correct
25 Correct 56 ms 146516 KB Output is correct
26 Correct 54 ms 146680 KB Output is correct
27 Correct 66 ms 146644 KB Output is correct
28 Correct 50 ms 146512 KB Output is correct
29 Correct 52 ms 146516 KB Output is correct
30 Correct 52 ms 146512 KB Output is correct
31 Correct 129 ms 153496 KB Output is correct
32 Correct 123 ms 153680 KB Output is correct
33 Correct 83 ms 148912 KB Output is correct
34 Correct 148 ms 151360 KB Output is correct
35 Correct 197 ms 153680 KB Output is correct
36 Incorrect 138 ms 153168 KB Output isn't correct
37 Halted 0 ms 0 KB -