oj.uz

Submission #1001584

# Submission time Handle Problem Language Result Execution time Memory
1001584 2024-06-19T06:16:28 Z amirhoseinfar1385 Sličnost (COI23_slicnost) C++17
67 / 100
 1006 ms 502460 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*14;
 
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){
		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);
		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 154 ms 493548 KB Output is correct
2 Correct 158 ms 493640 KB Output is correct
3 Correct 170 ms 493608 KB Output is correct
4 Correct 155 ms 493648 KB Output is correct
5 Correct 162 ms 493656 KB Output is correct
6 Correct 161 ms 493648 KB Output is correct
7 Correct 157 ms 493656 KB Output is correct
8 Correct 165 ms 493452 KB Output is correct
9 Correct 160 ms 493652 KB Output is correct
10 Correct 167 ms 493656 KB Output is correct
11 Correct 160 ms 493440 KB Output is correct
12 Correct 179 ms 493648 KB Output is correct
13 Correct 169 ms 493648 KB Output is correct
14 Correct 160 ms 493652 KB Output is correct
15 Correct 160 ms 493476 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 154 ms 493548 KB Output is correct
2 Correct 158 ms 493640 KB Output is correct
3 Correct 170 ms 493608 KB Output is correct
4 Correct 155 ms 493648 KB Output is correct
5 Correct 162 ms 493656 KB Output is correct
6 Correct 161 ms 493648 KB Output is correct
7 Correct 157 ms 493656 KB Output is correct
8 Correct 165 ms 493452 KB Output is correct
9 Correct 160 ms 493652 KB Output is correct
10 Correct 167 ms 493656 KB Output is correct
11 Correct 160 ms 493440 KB Output is correct
12 Correct 179 ms 493648 KB Output is correct
13 Correct 169 ms 493648 KB Output is correct
14 Correct 160 ms 493652 KB Output is correct
15 Correct 160 ms 493476 KB Output is correct
16 Correct 169 ms 493888 KB Output is correct
17 Correct 165 ms 493908 KB Output is correct
18 Correct 161 ms 493648 KB Output is correct
19 Correct 161 ms 493904 KB Output is correct
20 Correct 172 ms 494124 KB Output is correct
21 Correct 166 ms 493844 KB Output is correct
22 Correct 196 ms 493648 KB Output is correct
23 Correct 167 ms 493912 KB Output is correct
24 Correct 162 ms 493912 KB Output is correct
25 Correct 161 ms 493728 KB Output is correct
26 Correct 179 ms 493908 KB Output is correct
27 Correct 171 ms 493872 KB Output is correct
28 Correct 165 ms 493740 KB Output is correct
29 Correct 165 ms 493848 KB Output is correct
30 Correct 183 ms 493636 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 154 ms 493548 KB Output is correct
2 Correct 158 ms 493640 KB Output is correct
3 Correct 170 ms 493608 KB Output is correct
4 Correct 155 ms 493648 KB Output is correct
5 Correct 162 ms 493656 KB Output is correct
6 Correct 161 ms 493648 KB Output is correct
7 Correct 157 ms 493656 KB Output is correct
8 Correct 165 ms 493452 KB Output is correct
9 Correct 160 ms 493652 KB Output is correct
10 Correct 167 ms 493656 KB Output is correct
11 Correct 160 ms 493440 KB Output is correct
12 Correct 179 ms 493648 KB Output is correct
13 Correct 169 ms 493648 KB Output is correct
14 Correct 160 ms 493652 KB Output is correct
15 Correct 160 ms 493476 KB Output is correct
16 Correct 169 ms 493888 KB Output is correct
17 Correct 165 ms 493908 KB Output is correct
18 Correct 161 ms 493648 KB Output is correct
19 Correct 161 ms 493904 KB Output is correct
20 Correct 172 ms 494124 KB Output is correct
21 Correct 166 ms 493844 KB Output is correct
22 Correct 196 ms 493648 KB Output is correct
23 Correct 167 ms 493912 KB Output is correct
24 Correct 162 ms 493912 KB Output is correct
25 Correct 161 ms 493728 KB Output is correct
26 Correct 179 ms 493908 KB Output is correct
27 Correct 171 ms 493872 KB Output is correct
28 Correct 165 ms 493740 KB Output is correct
29 Correct 165 ms 493848 KB Output is correct
30 Correct 183 ms 493636 KB Output is correct
31 Correct 268 ms 500820 KB Output is correct
32 Correct 264 ms 500820 KB Output is correct
33 Correct 191 ms 496212 KB Output is correct
34 Correct 265 ms 498516 KB Output is correct
35 Correct 321 ms 500876 KB Output is correct
36 Correct 260 ms 500308 KB Output is correct
37 Correct 191 ms 496544 KB Output is correct
38 Correct 304 ms 500612 KB Output is correct
39 Correct 293 ms 501076 KB Output is correct
40 Correct 285 ms 498908 KB Output is correct
41 Correct 303 ms 499536 KB Output is correct
42 Correct 308 ms 500328 KB Output is correct
43 Correct 275 ms 498592 KB Output is correct
44 Correct 247 ms 498008 KB Output is correct
45 Correct 215 ms 496500 KB Output is correct

Subtask #4
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 154 ms 493548 KB Output is correct
2 Correct 158 ms 493640 KB Output is correct
3 Correct 170 ms 493608 KB Output is correct
4 Correct 155 ms 493648 KB Output is correct
5 Correct 162 ms 493656 KB Output is correct
6 Correct 161 ms 493648 KB Output is correct
7 Correct 157 ms 493656 KB Output is correct
8 Correct 165 ms 493452 KB Output is correct
9 Correct 160 ms 493652 KB Output is correct
10 Correct 167 ms 493656 KB Output is correct
11 Correct 160 ms 493440 KB Output is correct
12 Correct 179 ms 493648 KB Output is correct
13 Correct 169 ms 493648 KB Output is correct
14 Correct 160 ms 493652 KB Output is correct
15 Correct 160 ms 493476 KB Output is correct
16 Correct 162 ms 493648 KB Output is correct
17 Correct 168 ms 493516 KB Output is correct
18 Correct 161 ms 493652 KB Output is correct
19 Correct 158 ms 493572 KB Output is correct
20 Correct 163 ms 493652 KB Output is correct
21 Correct 166 ms 493624 KB Output is correct
22 Correct 167 ms 493652 KB Output is correct
23 Correct 156 ms 493484 KB Output is correct
24 Correct 162 ms 493648 KB Output is correct
25 Correct 164 ms 493652 KB Output is correct
26 Correct 162 ms 493652 KB Output is correct
27 Correct 153 ms 493508 KB Output is correct
28 Correct 163 ms 493772 KB Output is correct
29 Correct 165 ms 493648 KB Output is correct
30 Correct 161 ms 493652 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 154 ms 493548 KB Output is correct
2 Correct 158 ms 493640 KB Output is correct
3 Correct 170 ms 493608 KB Output is correct
4 Correct 155 ms 493648 KB Output is correct
5 Correct 162 ms 493656 KB Output is correct
6 Correct 161 ms 493648 KB Output is correct
7 Correct 157 ms 493656 KB Output is correct
8 Correct 165 ms 493452 KB Output is correct
9 Correct 160 ms 493652 KB Output is correct
10 Correct 167 ms 493656 KB Output is correct
11 Correct 160 ms 493440 KB Output is correct
12 Correct 179 ms 493648 KB Output is correct
13 Correct 169 ms 493648 KB Output is correct
14 Correct 160 ms 493652 KB Output is correct
15 Correct 160 ms 493476 KB Output is correct
16 Correct 169 ms 493888 KB Output is correct
17 Correct 165 ms 493908 KB Output is correct
18 Correct 161 ms 493648 KB Output is correct
19 Correct 161 ms 493904 KB Output is correct
20 Correct 172 ms 494124 KB Output is correct
21 Correct 166 ms 493844 KB Output is correct
22 Correct 196 ms 493648 KB Output is correct
23 Correct 167 ms 493912 KB Output is correct
24 Correct 162 ms 493912 KB Output is correct
25 Correct 161 ms 493728 KB Output is correct
26 Correct 179 ms 493908 KB Output is correct
27 Correct 171 ms 493872 KB Output is correct
28 Correct 165 ms 493740 KB Output is correct
29 Correct 165 ms 493848 KB Output is correct
30 Correct 183 ms 493636 KB Output is correct
31 Correct 162 ms 493648 KB Output is correct
32 Correct 168 ms 493516 KB Output is correct
33 Correct 161 ms 493652 KB Output is correct
34 Correct 158 ms 493572 KB Output is correct
35 Correct 163 ms 493652 KB Output is correct
36 Correct 166 ms 493624 KB Output is correct
37 Correct 167 ms 493652 KB Output is correct
38 Correct 156 ms 493484 KB Output is correct
39 Correct 162 ms 493648 KB Output is correct
40 Correct 164 ms 493652 KB Output is correct
41 Correct 162 ms 493652 KB Output is correct
42 Correct 153 ms 493508 KB Output is correct
43 Correct 163 ms 493772 KB Output is correct
44 Correct 165 ms 493648 KB Output is correct
45 Correct 161 ms 493652 KB Output is correct
46 Correct 181 ms 493904 KB Output is correct
47 Correct 170 ms 493904 KB Output is correct
48 Correct 164 ms 493676 KB Output is correct
49 Correct 170 ms 493908 KB Output is correct
50 Correct 185 ms 493928 KB Output is correct
51 Correct 179 ms 493800 KB Output is correct
52 Correct 176 ms 493868 KB Output is correct
53 Correct 194 ms 493832 KB Output is correct
54 Correct 181 ms 493960 KB Output is correct
55 Correct 164 ms 493908 KB Output is correct
56 Correct 194 ms 493908 KB Output is correct
57 Correct 176 ms 493904 KB Output is correct
58 Correct 167 ms 493648 KB Output is correct
59 Correct 191 ms 493824 KB Output is correct
60 Correct 173 ms 493908 KB Output is correct

Subtask #6
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 154 ms 493548 KB Output is correct
2 Correct 158 ms 493640 KB Output is correct
3 Correct 170 ms 493608 KB Output is correct
4 Correct 155 ms 493648 KB Output is correct
5 Correct 162 ms 493656 KB Output is correct
6 Correct 161 ms 493648 KB Output is correct
7 Correct 157 ms 493656 KB Output is correct
8 Correct 165 ms 493452 KB Output is correct
9 Correct 160 ms 493652 KB Output is correct
10 Correct 167 ms 493656 KB Output is correct
11 Correct 160 ms 493440 KB Output is correct
12 Correct 179 ms 493648 KB Output is correct
13 Correct 169 ms 493648 KB Output is correct
14 Correct 160 ms 493652 KB Output is correct
15 Correct 160 ms 493476 KB Output is correct
16 Correct 169 ms 493888 KB Output is correct
17 Correct 165 ms 493908 KB Output is correct
18 Correct 161 ms 493648 KB Output is correct
19 Correct 161 ms 493904 KB Output is correct
20 Correct 172 ms 494124 KB Output is correct
21 Correct 166 ms 493844 KB Output is correct
22 Correct 196 ms 493648 KB Output is correct
23 Correct 167 ms 493912 KB Output is correct
24 Correct 162 ms 493912 KB Output is correct
25 Correct 161 ms 493728 KB Output is correct
26 Correct 179 ms 493908 KB Output is correct
27 Correct 171 ms 493872 KB Output is correct
28 Correct 165 ms 493740 KB Output is correct
29 Correct 165 ms 493848 KB Output is correct
30 Correct 183 ms 493636 KB Output is correct
31 Correct 268 ms 500820 KB Output is correct
32 Correct 264 ms 500820 KB Output is correct
33 Correct 191 ms 496212 KB Output is correct
34 Correct 265 ms 498516 KB Output is correct
35 Correct 321 ms 500876 KB Output is correct
36 Correct 260 ms 500308 KB Output is correct
37 Correct 191 ms 496544 KB Output is correct
38 Correct 304 ms 500612 KB Output is correct
39 Correct 293 ms 501076 KB Output is correct
40 Correct 285 ms 498908 KB Output is correct
41 Correct 303 ms 499536 KB Output is correct
42 Correct 308 ms 500328 KB Output is correct
43 Correct 275 ms 498592 KB Output is correct
44 Correct 247 ms 498008 KB Output is correct
45 Correct 215 ms 496500 KB Output is correct
46 Correct 162 ms 493648 KB Output is correct
47 Correct 168 ms 493516 KB Output is correct
48 Correct 161 ms 493652 KB Output is correct
49 Correct 158 ms 493572 KB Output is correct
50 Correct 163 ms 493652 KB Output is correct
51 Correct 166 ms 493624 KB Output is correct
52 Correct 167 ms 493652 KB Output is correct
53 Correct 156 ms 493484 KB Output is correct
54 Correct 162 ms 493648 KB Output is correct
55 Correct 164 ms 493652 KB Output is correct
56 Correct 162 ms 493652 KB Output is correct
57 Correct 153 ms 493508 KB Output is correct
58 Correct 163 ms 493772 KB Output is correct
59 Correct 165 ms 493648 KB Output is correct
60 Correct 161 ms 493652 KB Output is correct
61 Correct 181 ms 493904 KB Output is correct
62 Correct 170 ms 493904 KB Output is correct
63 Correct 164 ms 493676 KB Output is correct
64 Correct 170 ms 493908 KB Output is correct
65 Correct 185 ms 493928 KB Output is correct
66 Correct 179 ms 493800 KB Output is correct
67 Correct 176 ms 493868 KB Output is correct
68 Correct 194 ms 493832 KB Output is correct
69 Correct 181 ms 493960 KB Output is correct
70 Correct 164 ms 493908 KB Output is correct
71 Correct 194 ms 493908 KB Output is correct
72 Correct 176 ms 493904 KB Output is correct
73 Correct 167 ms 493648 KB Output is correct
74 Correct 191 ms 493824 KB Output is correct
75 Correct 173 ms 493908 KB Output is correct
76 Correct 638 ms 502096 KB Output is correct
77 Correct 644 ms 501584 KB Output is correct
78 Correct 260 ms 497776 KB Output is correct
79 Correct 693 ms 499932 KB Output is correct
80 Correct 1006 ms 502308 KB Output is correct
81 Correct 350 ms 498444 KB Output is correct
82 Correct 574 ms 501048 KB Output is correct
83 Correct 958 ms 501816 KB Output is correct
84 Correct 743 ms 502460 KB Output is correct
85 Incorrect 438 ms 499692 KB Output isn't correct
86 Halted 0 ms 0 KB -