oj.uz

답안 #1001522

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1001522 2024-06-19T05:22:05 Z amirhoseinfar1385 Sličnost (COI23_slicnost) C++17
34 / 100
 156 ms 183376 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;
 
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

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 88656 KB Output is correct
2 Correct 30 ms 88668 KB Output is correct
3 Correct 28 ms 88656 KB Output is correct
4 Correct 27 ms 88660 KB Output is correct
5 Correct 28 ms 88660 KB Output is correct
6 Correct 31 ms 88668 KB Output is correct
7 Correct 28 ms 88664 KB Output is correct
8 Correct 28 ms 88676 KB Output is correct
9 Correct 27 ms 88660 KB Output is correct
10 Correct 28 ms 88656 KB Output is correct
11 Correct 28 ms 88848 KB Output is correct
12 Correct 29 ms 88664 KB Output is correct
13 Correct 27 ms 88664 KB Output is correct
14 Correct 29 ms 88660 KB Output is correct
15 Correct 27 ms 88668 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 88656 KB Output is correct
2 Correct 30 ms 88668 KB Output is correct
3 Correct 28 ms 88656 KB Output is correct
4 Correct 27 ms 88660 KB Output is correct
5 Correct 28 ms 88660 KB Output is correct
6 Correct 31 ms 88668 KB Output is correct
7 Correct 28 ms 88664 KB Output is correct
8 Correct 28 ms 88676 KB Output is correct
9 Correct 27 ms 88660 KB Output is correct
10 Correct 28 ms 88656 KB Output is correct
11 Correct 28 ms 88848 KB Output is correct
12 Correct 29 ms 88664 KB Output is correct
13 Correct 27 ms 88664 KB Output is correct
14 Correct 29 ms 88660 KB Output is correct
15 Correct 27 ms 88668 KB Output is correct
16 Correct 31 ms 88916 KB Output is correct
17 Correct 32 ms 89092 KB Output is correct
18 Correct 31 ms 88656 KB Output is correct
19 Correct 32 ms 88924 KB Output is correct
20 Correct 34 ms 88896 KB Output is correct
21 Correct 35 ms 88916 KB Output is correct
22 Correct 41 ms 87632 KB Output is correct
23 Correct 38 ms 87900 KB Output is correct
24 Correct 32 ms 87912 KB Output is correct
25 Correct 33 ms 87892 KB Output is correct
26 Correct 34 ms 87892 KB Output is correct
27 Correct 35 ms 87892 KB Output is correct
28 Correct 33 ms 87900 KB Output is correct
29 Correct 41 ms 87772 KB Output is correct
30 Correct 33 ms 87632 KB Output is correct

Subtask #3
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 88656 KB Output is correct
2 Correct 30 ms 88668 KB Output is correct
3 Correct 28 ms 88656 KB Output is correct
4 Correct 27 ms 88660 KB Output is correct
5 Correct 28 ms 88660 KB Output is correct
6 Correct 31 ms 88668 KB Output is correct
7 Correct 28 ms 88664 KB Output is correct
8 Correct 28 ms 88676 KB Output is correct
9 Correct 27 ms 88660 KB Output is correct
10 Correct 28 ms 88656 KB Output is correct
11 Correct 28 ms 88848 KB Output is correct
12 Correct 29 ms 88664 KB Output is correct
13 Correct 27 ms 88664 KB Output is correct
14 Correct 29 ms 88660 KB Output is correct
15 Correct 27 ms 88668 KB Output is correct
16 Correct 31 ms 88916 KB Output is correct
17 Correct 32 ms 89092 KB Output is correct
18 Correct 31 ms 88656 KB Output is correct
19 Correct 32 ms 88924 KB Output is correct
20 Correct 34 ms 88896 KB Output is correct
21 Correct 35 ms 88916 KB Output is correct
22 Correct 41 ms 87632 KB Output is correct
23 Correct 38 ms 87900 KB Output is correct
24 Correct 32 ms 87912 KB Output is correct
25 Correct 33 ms 87892 KB Output is correct
26 Correct 34 ms 87892 KB Output is correct
27 Correct 35 ms 87892 KB Output is correct
28 Correct 33 ms 87900 KB Output is correct
29 Correct 41 ms 87772 KB Output is correct
30 Correct 33 ms 87632 KB Output is correct
31 Correct 120 ms 94800 KB Output is correct
32 Correct 128 ms 94804 KB Output is correct
33 Correct 63 ms 90084 KB Output is correct
34 Runtime error 156 ms 183376 KB Execution killed with signal 11
35 Halted 0 ms 0 KB -

Subtask #4
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 88656 KB Output is correct
2 Correct 30 ms 88668 KB Output is correct
3 Correct 28 ms 88656 KB Output is correct
4 Correct 27 ms 88660 KB Output is correct
5 Correct 28 ms 88660 KB Output is correct
6 Correct 31 ms 88668 KB Output is correct
7 Correct 28 ms 88664 KB Output is correct
8 Correct 28 ms 88676 KB Output is correct
9 Correct 27 ms 88660 KB Output is correct
10 Correct 28 ms 88656 KB Output is correct
11 Correct 28 ms 88848 KB Output is correct
12 Correct 29 ms 88664 KB Output is correct
13 Correct 27 ms 88664 KB Output is correct
14 Correct 29 ms 88660 KB Output is correct
15 Correct 27 ms 88668 KB Output is correct
16 Correct 29 ms 87644 KB Output is correct
17 Correct 30 ms 87644 KB Output is correct
18 Correct 29 ms 87644 KB Output is correct
19 Correct 30 ms 87632 KB Output is correct
20 Correct 29 ms 87472 KB Output is correct
21 Correct 28 ms 87644 KB Output is correct
22 Correct 30 ms 87484 KB Output is correct
23 Correct 35 ms 87644 KB Output is correct
24 Correct 30 ms 87640 KB Output is correct
25 Correct 31 ms 87536 KB Output is correct
26 Correct 31 ms 87636 KB Output is correct
27 Correct 29 ms 87680 KB Output is correct
28 Correct 29 ms 87624 KB Output is correct
29 Correct 30 ms 87548 KB Output is correct
30 Correct 29 ms 87644 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 88656 KB Output is correct
2 Correct 30 ms 88668 KB Output is correct
3 Correct 28 ms 88656 KB Output is correct
4 Correct 27 ms 88660 KB Output is correct
5 Correct 28 ms 88660 KB Output is correct
6 Correct 31 ms 88668 KB Output is correct
7 Correct 28 ms 88664 KB Output is correct
8 Correct 28 ms 88676 KB Output is correct
9 Correct 27 ms 88660 KB Output is correct
10 Correct 28 ms 88656 KB Output is correct
11 Correct 28 ms 88848 KB Output is correct
12 Correct 29 ms 88664 KB Output is correct
13 Correct 27 ms 88664 KB Output is correct
14 Correct 29 ms 88660 KB Output is correct
15 Correct 27 ms 88668 KB Output is correct
16 Correct 31 ms 88916 KB Output is correct
17 Correct 32 ms 89092 KB Output is correct
18 Correct 31 ms 88656 KB Output is correct
19 Correct 32 ms 88924 KB Output is correct
20 Correct 34 ms 88896 KB Output is correct
21 Correct 35 ms 88916 KB Output is correct
22 Correct 41 ms 87632 KB Output is correct
23 Correct 38 ms 87900 KB Output is correct
24 Correct 32 ms 87912 KB Output is correct
25 Correct 33 ms 87892 KB Output is correct
26 Correct 34 ms 87892 KB Output is correct
27 Correct 35 ms 87892 KB Output is correct
28 Correct 33 ms 87900 KB Output is correct
29 Correct 41 ms 87772 KB Output is correct
30 Correct 33 ms 87632 KB Output is correct
31 Correct 29 ms 87644 KB Output is correct
32 Correct 30 ms 87644 KB Output is correct
33 Correct 29 ms 87644 KB Output is correct
34 Correct 30 ms 87632 KB Output is correct
35 Correct 29 ms 87472 KB Output is correct
36 Correct 28 ms 87644 KB Output is correct
37 Correct 30 ms 87484 KB Output is correct
38 Correct 35 ms 87644 KB Output is correct
39 Correct 30 ms 87640 KB Output is correct
40 Correct 31 ms 87536 KB Output is correct
41 Correct 31 ms 87636 KB Output is correct
42 Correct 29 ms 87680 KB Output is correct
43 Correct 29 ms 87624 KB Output is correct
44 Correct 30 ms 87548 KB Output is correct
45 Correct 29 ms 87644 KB Output is correct
46 Correct 43 ms 87892 KB Output is correct
47 Correct 52 ms 88408 KB Output is correct
48 Correct 36 ms 87592 KB Output is correct
49 Correct 44 ms 87888 KB Output is correct
50 Correct 48 ms 87896 KB Output is correct
51 Correct 37 ms 87636 KB Output is correct
52 Correct 59 ms 87888 KB Output is correct
53 Correct 54 ms 88052 KB Output is correct
54 Correct 47 ms 88072 KB Output is correct
55 Correct 37 ms 87892 KB Output is correct
56 Correct 50 ms 87932 KB Output is correct
57 Correct 49 ms 87900 KB Output is correct
58 Correct 41 ms 87900 KB Output is correct
59 Correct 47 ms 87896 KB Output is correct
60 Correct 50 ms 87896 KB Output is correct

Subtask #6
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 88656 KB Output is correct
2 Correct 30 ms 88668 KB Output is correct
3 Correct 28 ms 88656 KB Output is correct
4 Correct 27 ms 88660 KB Output is correct
5 Correct 28 ms 88660 KB Output is correct
6 Correct 31 ms 88668 KB Output is correct
7 Correct 28 ms 88664 KB Output is correct
8 Correct 28 ms 88676 KB Output is correct
9 Correct 27 ms 88660 KB Output is correct
10 Correct 28 ms 88656 KB Output is correct
11 Correct 28 ms 88848 KB Output is correct
12 Correct 29 ms 88664 KB Output is correct
13 Correct 27 ms 88664 KB Output is correct
14 Correct 29 ms 88660 KB Output is correct
15 Correct 27 ms 88668 KB Output is correct
16 Correct 31 ms 88916 KB Output is correct
17 Correct 32 ms 89092 KB Output is correct
18 Correct 31 ms 88656 KB Output is correct
19 Correct 32 ms 88924 KB Output is correct
20 Correct 34 ms 88896 KB Output is correct
21 Correct 35 ms 88916 KB Output is correct
22 Correct 41 ms 87632 KB Output is correct
23 Correct 38 ms 87900 KB Output is correct
24 Correct 32 ms 87912 KB Output is correct
25 Correct 33 ms 87892 KB Output is correct
26 Correct 34 ms 87892 KB Output is correct
27 Correct 35 ms 87892 KB Output is correct
28 Correct 33 ms 87900 KB Output is correct
29 Correct 41 ms 87772 KB Output is correct
30 Correct 33 ms 87632 KB Output is correct
31 Correct 120 ms 94800 KB Output is correct
32 Correct 128 ms 94804 KB Output is correct
33 Correct 63 ms 90084 KB Output is correct
34 Runtime error 156 ms 183376 KB Execution killed with signal 11
35 Halted 0 ms 0 KB -