oj.uz

Submission #791765

# Submission time Handle Problem Language Result Execution time Memory
791765 2023-07-24T09:41:29 Z 이종영(#10079) Sličnost (COI23_slicnost) C++17
67 / 100
 508 ms 524288 KB 
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
using ll=long long;
using pll=array<ll,2>;
const ll inf=1e18;
const int N=1e5+5,M=5e7+5;
pll mrg(pll L,pll R){
	if(L[0]<R[0]) swap(L,R);
	if(L[0]==R[0]) return {L[0],L[1]+R[1]};
	return L;
}
struct node{
	pll v={0,0}; int d=0;
	int l=0,r=0;
}T[M]; int C=1;
void init(int nd,int l,int r){
	T[nd].v={0,r-l+1};
	T[nd].d=0;
	if(l==r) return;
	int m=(l+r)>>1;
	T[nd].l=++C;
	T[nd].r=++C;
	init(T[nd].l,l,m); init(T[nd].r,m+1,r);
}
void upd(int n1,int n2,int l,int r,int s,int e,int v){
	T[n2]=T[n1];
	if(r<s||e<l) return;
	if(s<=l&&r<=e){
		T[n2].v[0]+=v;
		T[n2].d+=v;
		return;
	}
	int m=(l+r)>>1;
	T[n2].l=++C;
	T[n2].r=++C;
	upd(T[n1].l,T[n2].l,l,m,s,e,v); upd(T[n1].r,T[n2].r,m+1,r,s,e,v);
	T[n2].v=mrg(T[T[n2].l].v,T[T[n2].r].v);
	T[n2].v[0]+=T[n2].d;
}
int n,k,q,a[N],b[N],invb[N],t[N];
int root[N];
map<int,ll> mp;
int main(){
	ios::sync_with_stdio(false); cin.tie(0);
	cin>>n>>k>>q;
	for(int i=1;i<=n;i++) cin>>a[i];
	for(int i=1;i<=n;i++){
		cin>>b[i];
		invb[b[i]]=i;
	}
	root[0]=1;
	init(1,1,n-k+1);
	for(int x=1;x<=n-k+1;x++){
		root[x]=++C;
		T[root[x]]=T[root[x-1]];
		if(x==1){
			for(int i=1;i<=k;i++){
				int j=invb[a[i]];
				int nroot=++C;
				upd(root[x],nroot,1,n-k+1,max(1,j-k+1),min(j,n-k+1),1);
				root[x]=nroot;
			}
		} else{
			int j=invb[a[x+k-1]];
			int nroot=++C;
			upd(root[x],nroot,1,n-k+1,max(1,j-k+1),min(j,n-k+1),1);
			root[x]=nroot;
			{
				int j=invb[a[x-1]];
				int nroot=++C;
				upd(root[x],nroot,1,n-k+1,max(1,j-k+1),min(j,n-k+1),-1);
				root[x]=nroot;
			}
		}
		mp[T[root[x]].v[0]]+=T[root[x]].v[1];
	}
	{
		pair<int,ll> ans=*mp.rbegin();
		cout<<ans.first<<" "<<ans.second<<"\n";
	}
	for(int i=1;i<=q;i++){
		cin>>t[i];
		if(k<=t[i]){
			mp[T[root[t[i]-k+1]].v[0]]-=T[root[t[i]-k+1]].v[1];
			int nroot=++C,j=invb[a[t[i]]];
			upd(root[t[i]-k+1],nroot,1,n-k+1,max(1,j-k+1),min(j,n-k+1),-1);
			root[t[i]-k+1]=nroot;
			nroot=++C; j=invb[a[t[i]+1]];
			upd(root[t[i]-k+1],nroot,1,n-k+1,max(1,j-k+1),min(j,n-k+1),1);
			root[t[i]-k+1]=nroot;
			mp[T[root[t[i]-k+1]].v[0]]+=T[root[t[i]-k+1]].v[1];
		}
		if(t[i]<=n-k){
			mp[T[root[t[i]+1]].v[0]]-=T[root[t[i]+1]].v[1];
			int nroot=++C,j=invb[a[t[i]]];
			upd(root[t[i]+1],nroot,1,n-k+1,max(1,j-k+1),min(j,n-k+1),1);
			root[t[i]+1]=nroot;
			nroot=++C; j=invb[a[t[i]+1]];
			upd(root[t[i]+1],nroot,1,n-k+1,max(1,j-k+1),min(j,n-k+1),-1);
			root[t[i]+1]=nroot;
			mp[T[root[t[i]+1]].v[0]]+=T[root[t[i]+1]].v[1];
		}
		swap(a[t[i]],a[t[i]+1]);
		{
			pair<int,ll> ans=*mp.rbegin();
			while(ans.second==0){
				mp.erase(ans.first);
				ans=*mp.rbegin();
			}
			cout<<ans.first<<" "<<ans.second<<"\n";
		}
	}
	return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 5 ms 8660 KB Output is correct
17 Correct 5 ms 8916 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 4 ms 5588 KB Output is correct
20 Correct 8 ms 11860 KB Output is correct
21 Correct 7 ms 11860 KB Output is correct
22 Correct 1 ms 852 KB Output is correct
23 Correct 8 ms 11344 KB Output is correct
24 Correct 7 ms 11604 KB Output is correct
25 Correct 6 ms 7380 KB Output is correct
26 Correct 8 ms 8660 KB Output is correct
27 Correct 11 ms 11572 KB Output is correct
28 Correct 5 ms 6236 KB Output is correct
29 Correct 3 ms 4180 KB Output is correct
30 Correct 2 ms 980 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 5 ms 8660 KB Output is correct
17 Correct 5 ms 8916 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 4 ms 5588 KB Output is correct
20 Correct 8 ms 11860 KB Output is correct
21 Correct 7 ms 11860 KB Output is correct
22 Correct 1 ms 852 KB Output is correct
23 Correct 8 ms 11344 KB Output is correct
24 Correct 7 ms 11604 KB Output is correct
25 Correct 6 ms 7380 KB Output is correct
26 Correct 8 ms 8660 KB Output is correct
27 Correct 11 ms 11572 KB Output is correct
28 Correct 5 ms 6236 KB Output is correct
29 Correct 3 ms 4180 KB Output is correct
30 Correct 2 ms 980 KB Output is correct
31 Correct 157 ms 221004 KB Output is correct
32 Correct 172 ms 227496 KB Output is correct
33 Correct 14 ms 4436 KB Output is correct
34 Correct 133 ms 145544 KB Output is correct
35 Correct 279 ms 315980 KB Output is correct
36 Correct 186 ms 328568 KB Output is correct
37 Correct 20 ms 16424 KB Output is correct
38 Correct 257 ms 301068 KB Output is correct
39 Correct 207 ms 313888 KB Output is correct
40 Correct 199 ms 194048 KB Output is correct
41 Correct 197 ms 231448 KB Output is correct
42 Correct 278 ms 320396 KB Output is correct
43 Correct 135 ms 162644 KB Output is correct
44 Correct 95 ms 106448 KB Output is correct
45 Correct 27 ms 17784 KB Output is correct

Subtask #4
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 468 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 0 ms 468 KB Output is correct
26 Correct 1 ms 596 KB Output is correct
27 Correct 1 ms 596 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 596 KB Output is correct
30 Correct 0 ms 340 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 5 ms 8660 KB Output is correct
17 Correct 5 ms 8916 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 4 ms 5588 KB Output is correct
20 Correct 8 ms 11860 KB Output is correct
21 Correct 7 ms 11860 KB Output is correct
22 Correct 1 ms 852 KB Output is correct
23 Correct 8 ms 11344 KB Output is correct
24 Correct 7 ms 11604 KB Output is correct
25 Correct 6 ms 7380 KB Output is correct
26 Correct 8 ms 8660 KB Output is correct
27 Correct 11 ms 11572 KB Output is correct
28 Correct 5 ms 6236 KB Output is correct
29 Correct 3 ms 4180 KB Output is correct
30 Correct 2 ms 980 KB Output is correct
31 Correct 1 ms 596 KB Output is correct
32 Correct 1 ms 596 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 0 ms 468 KB Output is correct
35 Correct 1 ms 596 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 1 ms 596 KB Output is correct
39 Correct 1 ms 596 KB Output is correct
40 Correct 0 ms 468 KB Output is correct
41 Correct 1 ms 596 KB Output is correct
42 Correct 1 ms 596 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 0 ms 596 KB Output is correct
45 Correct 0 ms 340 KB Output is correct
46 Correct 18 ms 24404 KB Output is correct
47 Correct 20 ms 25812 KB Output is correct
48 Correct 2 ms 596 KB Output is correct
49 Correct 10 ms 12116 KB Output is correct
50 Correct 29 ms 33656 KB Output is correct
51 Correct 3 ms 2900 KB Output is correct
52 Correct 18 ms 22052 KB Output is correct
53 Correct 28 ms 32340 KB Output is correct
54 Correct 24 ms 32540 KB Output is correct
55 Correct 9 ms 12116 KB Output is correct
56 Correct 36 ms 33392 KB Output is correct
57 Correct 39 ms 32496 KB Output is correct
58 Correct 5 ms 4308 KB Output is correct
59 Correct 23 ms 25128 KB Output is correct
60 Correct 4 ms 3540 KB Output is correct

Subtask #6
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 5 ms 8660 KB Output is correct
17 Correct 5 ms 8916 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 4 ms 5588 KB Output is correct
20 Correct 8 ms 11860 KB Output is correct
21 Correct 7 ms 11860 KB Output is correct
22 Correct 1 ms 852 KB Output is correct
23 Correct 8 ms 11344 KB Output is correct
24 Correct 7 ms 11604 KB Output is correct
25 Correct 6 ms 7380 KB Output is correct
26 Correct 8 ms 8660 KB Output is correct
27 Correct 11 ms 11572 KB Output is correct
28 Correct 5 ms 6236 KB Output is correct
29 Correct 3 ms 4180 KB Output is correct
30 Correct 2 ms 980 KB Output is correct
31 Correct 157 ms 221004 KB Output is correct
32 Correct 172 ms 227496 KB Output is correct
33 Correct 14 ms 4436 KB Output is correct
34 Correct 133 ms 145544 KB Output is correct
35 Correct 279 ms 315980 KB Output is correct
36 Correct 186 ms 328568 KB Output is correct
37 Correct 20 ms 16424 KB Output is correct
38 Correct 257 ms 301068 KB Output is correct
39 Correct 207 ms 313888 KB Output is correct
40 Correct 199 ms 194048 KB Output is correct
41 Correct 197 ms 231448 KB Output is correct
42 Correct 278 ms 320396 KB Output is correct
43 Correct 135 ms 162644 KB Output is correct
44 Correct 95 ms 106448 KB Output is correct
45 Correct 27 ms 17784 KB Output is correct
46 Correct 1 ms 596 KB Output is correct
47 Correct 1 ms 596 KB Output is correct
48 Correct 0 ms 340 KB Output is correct
49 Correct 0 ms 468 KB Output is correct
50 Correct 1 ms 596 KB Output is correct
51 Correct 0 ms 340 KB Output is correct
52 Correct 1 ms 468 KB Output is correct
53 Correct 1 ms 596 KB Output is correct
54 Correct 1 ms 596 KB Output is correct
55 Correct 0 ms 468 KB Output is correct
56 Correct 1 ms 596 KB Output is correct
57 Correct 1 ms 596 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 0 ms 596 KB Output is correct
60 Correct 0 ms 340 KB Output is correct
61 Correct 18 ms 24404 KB Output is correct
62 Correct 20 ms 25812 KB Output is correct
63 Correct 2 ms 596 KB Output is correct
64 Correct 10 ms 12116 KB Output is correct
65 Correct 29 ms 33656 KB Output is correct
66 Correct 3 ms 2900 KB Output is correct
67 Correct 18 ms 22052 KB Output is correct
68 Correct 28 ms 32340 KB Output is correct
69 Correct 24 ms 32540 KB Output is correct
70 Correct 9 ms 12116 KB Output is correct
71 Correct 36 ms 33392 KB Output is correct
72 Correct 39 ms 32496 KB Output is correct
73 Correct 5 ms 4308 KB Output is correct
74 Correct 23 ms 25128 KB Output is correct
75 Correct 4 ms 3540 KB Output is correct
76 Runtime error 508 ms 524288 KB Execution killed with signal 9
77 Halted 0 ms 0 KB -