oj.uz

Submission #1001615

# Submission time Handle Problem Language Result Execution time Memory
1001615 2024-06-19T06:31:57 Z amirhoseinfar1385 Sličnost (COI23_slicnost) C++17
34 / 100
 264 ms 458576 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*16;
 
struct segmentpersistant{
	struct node{
		int cl,cr;
		unsigned short ted;
		unsigned short 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){
		pair<int,int>ret;
		ret.first=max((int)seg[seg[i].cl].maxa+seg[seg[i].cl].lazy,(int)seg[seg[i].cr].maxa+seg[seg[i].cr].lazy);
		if(ret.first==(int)seg[seg[i].cl].maxa+seg[seg[i].cl].lazy){
			ret.second+=seg[seg[i].cl].ted;
		}
		if(ret.first==(int)seg[seg[i].cr].maxa+seg[seg[i].cl].lazy){
			ret.second+=seg[seg[i].cr].ted;
		}
		return ret;
	}
}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 220 ms 451220 KB Output is correct
2 Correct 173 ms 451156 KB Output is correct
3 Correct 193 ms 451160 KB Output is correct
4 Correct 185 ms 451244 KB Output is correct
5 Correct 209 ms 451156 KB Output is correct
6 Correct 180 ms 451300 KB Output is correct
7 Correct 177 ms 451180 KB Output is correct
8 Correct 218 ms 451312 KB Output is correct
9 Correct 184 ms 451260 KB Output is correct
10 Correct 189 ms 451212 KB Output is correct
11 Correct 192 ms 451412 KB Output is correct
12 Correct 185 ms 451152 KB Output is correct
13 Correct 197 ms 451280 KB Output is correct
14 Correct 185 ms 451152 KB Output is correct
15 Correct 181 ms 451156 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 220 ms 451220 KB Output is correct
2 Correct 173 ms 451156 KB Output is correct
3 Correct 193 ms 451160 KB Output is correct
4 Correct 185 ms 451244 KB Output is correct
5 Correct 209 ms 451156 KB Output is correct
6 Correct 180 ms 451300 KB Output is correct
7 Correct 177 ms 451180 KB Output is correct
8 Correct 218 ms 451312 KB Output is correct
9 Correct 184 ms 451260 KB Output is correct
10 Correct 189 ms 451212 KB Output is correct
11 Correct 192 ms 451412 KB Output is correct
12 Correct 185 ms 451152 KB Output is correct
13 Correct 197 ms 451280 KB Output is correct
14 Correct 185 ms 451152 KB Output is correct
15 Correct 181 ms 451156 KB Output is correct
16 Correct 201 ms 451664 KB Output is correct
17 Correct 206 ms 451560 KB Output is correct
18 Correct 191 ms 451408 KB Output is correct
19 Correct 182 ms 451400 KB Output is correct
20 Correct 186 ms 451628 KB Output is correct
21 Correct 203 ms 451664 KB Output is correct
22 Correct 207 ms 451392 KB Output is correct
23 Correct 196 ms 451624 KB Output is correct
24 Correct 200 ms 451688 KB Output is correct
25 Correct 186 ms 451580 KB Output is correct
26 Correct 206 ms 451564 KB Output is correct
27 Correct 182 ms 451668 KB Output is correct
28 Correct 177 ms 451408 KB Output is correct
29 Correct 182 ms 451464 KB Output is correct
30 Correct 180 ms 451376 KB Output is correct

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 220 ms 451220 KB Output is correct
2 Correct 173 ms 451156 KB Output is correct
3 Correct 193 ms 451160 KB Output is correct
4 Correct 185 ms 451244 KB Output is correct
5 Correct 209 ms 451156 KB Output is correct
6 Correct 180 ms 451300 KB Output is correct
7 Correct 177 ms 451180 KB Output is correct
8 Correct 218 ms 451312 KB Output is correct
9 Correct 184 ms 451260 KB Output is correct
10 Correct 189 ms 451212 KB Output is correct
11 Correct 192 ms 451412 KB Output is correct
12 Correct 185 ms 451152 KB Output is correct
13 Correct 197 ms 451280 KB Output is correct
14 Correct 185 ms 451152 KB Output is correct
15 Correct 181 ms 451156 KB Output is correct
16 Correct 201 ms 451664 KB Output is correct
17 Correct 206 ms 451560 KB Output is correct
18 Correct 191 ms 451408 KB Output is correct
19 Correct 182 ms 451400 KB Output is correct
20 Correct 186 ms 451628 KB Output is correct
21 Correct 203 ms 451664 KB Output is correct
22 Correct 207 ms 451392 KB Output is correct
23 Correct 196 ms 451624 KB Output is correct
24 Correct 200 ms 451688 KB Output is correct
25 Correct 186 ms 451580 KB Output is correct
26 Correct 206 ms 451564 KB Output is correct
27 Correct 182 ms 451668 KB Output is correct
28 Correct 177 ms 451408 KB Output is correct
29 Correct 182 ms 451464 KB Output is correct
30 Correct 180 ms 451376 KB Output is correct
31 Correct 264 ms 458572 KB Output is correct
32 Correct 252 ms 458576 KB Output is correct
33 Incorrect 202 ms 454008 KB Output isn't correct
34 Halted 0 ms 0 KB -

Subtask #4
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 220 ms 451220 KB Output is correct
2 Correct 173 ms 451156 KB Output is correct
3 Correct 193 ms 451160 KB Output is correct
4 Correct 185 ms 451244 KB Output is correct
5 Correct 209 ms 451156 KB Output is correct
6 Correct 180 ms 451300 KB Output is correct
7 Correct 177 ms 451180 KB Output is correct
8 Correct 218 ms 451312 KB Output is correct
9 Correct 184 ms 451260 KB Output is correct
10 Correct 189 ms 451212 KB Output is correct
11 Correct 192 ms 451412 KB Output is correct
12 Correct 185 ms 451152 KB Output is correct
13 Correct 197 ms 451280 KB Output is correct
14 Correct 185 ms 451152 KB Output is correct
15 Correct 181 ms 451156 KB Output is correct
16 Correct 182 ms 451488 KB Output is correct
17 Correct 170 ms 451184 KB Output is correct
18 Correct 170 ms 451152 KB Output is correct
19 Correct 211 ms 451328 KB Output is correct
20 Correct 179 ms 451152 KB Output is correct
21 Correct 187 ms 451384 KB Output is correct
22 Correct 184 ms 451336 KB Output is correct
23 Correct 187 ms 451240 KB Output is correct
24 Correct 183 ms 451152 KB Output is correct
25 Correct 185 ms 451152 KB Output is correct
26 Correct 179 ms 451156 KB Output is correct
27 Correct 182 ms 451152 KB Output is correct
28 Correct 201 ms 451304 KB Output is correct
29 Correct 180 ms 451212 KB Output is correct
30 Correct 217 ms 451152 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 220 ms 451220 KB Output is correct
2 Correct 173 ms 451156 KB Output is correct
3 Correct 193 ms 451160 KB Output is correct
4 Correct 185 ms 451244 KB Output is correct
5 Correct 209 ms 451156 KB Output is correct
6 Correct 180 ms 451300 KB Output is correct
7 Correct 177 ms 451180 KB Output is correct
8 Correct 218 ms 451312 KB Output is correct
9 Correct 184 ms 451260 KB Output is correct
10 Correct 189 ms 451212 KB Output is correct
11 Correct 192 ms 451412 KB Output is correct
12 Correct 185 ms 451152 KB Output is correct
13 Correct 197 ms 451280 KB Output is correct
14 Correct 185 ms 451152 KB Output is correct
15 Correct 181 ms 451156 KB Output is correct
16 Correct 201 ms 451664 KB Output is correct
17 Correct 206 ms 451560 KB Output is correct
18 Correct 191 ms 451408 KB Output is correct
19 Correct 182 ms 451400 KB Output is correct
20 Correct 186 ms 451628 KB Output is correct
21 Correct 203 ms 451664 KB Output is correct
22 Correct 207 ms 451392 KB Output is correct
23 Correct 196 ms 451624 KB Output is correct
24 Correct 200 ms 451688 KB Output is correct
25 Correct 186 ms 451580 KB Output is correct
26 Correct 206 ms 451564 KB Output is correct
27 Correct 182 ms 451668 KB Output is correct
28 Correct 177 ms 451408 KB Output is correct
29 Correct 182 ms 451464 KB Output is correct
30 Correct 180 ms 451376 KB Output is correct
31 Correct 182 ms 451488 KB Output is correct
32 Correct 170 ms 451184 KB Output is correct
33 Correct 170 ms 451152 KB Output is correct
34 Correct 211 ms 451328 KB Output is correct
35 Correct 179 ms 451152 KB Output is correct
36 Correct 187 ms 451384 KB Output is correct
37 Correct 184 ms 451336 KB Output is correct
38 Correct 187 ms 451240 KB Output is correct
39 Correct 183 ms 451152 KB Output is correct
40 Correct 185 ms 451152 KB Output is correct
41 Correct 179 ms 451156 KB Output is correct
42 Correct 182 ms 451152 KB Output is correct
43 Correct 201 ms 451304 KB Output is correct
44 Correct 180 ms 451212 KB Output is correct
45 Correct 217 ms 451152 KB Output is correct
46 Correct 197 ms 451668 KB Output is correct
47 Correct 200 ms 451664 KB Output is correct
48 Correct 183 ms 451412 KB Output is correct
49 Correct 178 ms 451412 KB Output is correct
50 Correct 217 ms 451576 KB Output is correct
51 Correct 196 ms 451412 KB Output is correct
52 Correct 183 ms 451664 KB Output is correct
53 Correct 203 ms 451920 KB Output is correct
54 Correct 190 ms 451920 KB Output is correct
55 Correct 195 ms 451532 KB Output is correct
56 Correct 209 ms 451528 KB Output is correct
57 Correct 206 ms 451668 KB Output is correct
58 Correct 194 ms 451320 KB Output is correct
59 Correct 224 ms 451788 KB Output is correct
60 Correct 184 ms 451412 KB Output is correct

Subtask #6
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 220 ms 451220 KB Output is correct
2 Correct 173 ms 451156 KB Output is correct
3 Correct 193 ms 451160 KB Output is correct
4 Correct 185 ms 451244 KB Output is correct
5 Correct 209 ms 451156 KB Output is correct
6 Correct 180 ms 451300 KB Output is correct
7 Correct 177 ms 451180 KB Output is correct
8 Correct 218 ms 451312 KB Output is correct
9 Correct 184 ms 451260 KB Output is correct
10 Correct 189 ms 451212 KB Output is correct
11 Correct 192 ms 451412 KB Output is correct
12 Correct 185 ms 451152 KB Output is correct
13 Correct 197 ms 451280 KB Output is correct
14 Correct 185 ms 451152 KB Output is correct
15 Correct 181 ms 451156 KB Output is correct
16 Correct 201 ms 451664 KB Output is correct
17 Correct 206 ms 451560 KB Output is correct
18 Correct 191 ms 451408 KB Output is correct
19 Correct 182 ms 451400 KB Output is correct
20 Correct 186 ms 451628 KB Output is correct
21 Correct 203 ms 451664 KB Output is correct
22 Correct 207 ms 451392 KB Output is correct
23 Correct 196 ms 451624 KB Output is correct
24 Correct 200 ms 451688 KB Output is correct
25 Correct 186 ms 451580 KB Output is correct
26 Correct 206 ms 451564 KB Output is correct
27 Correct 182 ms 451668 KB Output is correct
28 Correct 177 ms 451408 KB Output is correct
29 Correct 182 ms 451464 KB Output is correct
30 Correct 180 ms 451376 KB Output is correct
31 Correct 264 ms 458572 KB Output is correct
32 Correct 252 ms 458576 KB Output is correct
33 Incorrect 202 ms 454008 KB Output isn't correct
34 Halted 0 ms 0 KB -