oj.uz

Submission #791781

# Submission time Handle Problem Language Result Execution time Memory
791781 2023-07-24T09:55:01 Z 이종영(#10079) Sličnost (COI23_slicnost) C++17
67 / 100
 751 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;
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;
	node(){}
}; int C=1;
vector<node> T;
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;
	T.emplace_back();
	T.emplace_back();
	init(T[nd].l,l,m); init(T[nd].r,m+1,r);
}
int upd(int n1,int l,int r,int s,int e,int v){
	if(r<s||e<l) return n1;
	int n2=++C;
	T.emplace_back();
	T[n2]=T[n1];
	if(s<=l&&r<=e){
		T[n2].v[0]+=v;
		T[n2].d+=v;
		return n2;
	}
	int m=(l+r)>>1;
	T[n2].l=upd(T[n1].l,l,m,s,e,v);
	T[n2].r=upd(T[n1].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;
	return n2;
}
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;
	}
	T.emplace_back();
	T.emplace_back();
	root[0]=1;
	init(1,1,n-k+1);
	for(int x=1;x<=n-k+1;x++){
		root[x]=root[x-1];
		if(x==1){
			for(int i=1;i<=k;i++){
				int j=invb[a[i]];
				root[x]=upd(root[x],1,n-k+1,max(1,j-k+1),min(j,n-k+1),1);
			}
		} else{
			int j=invb[a[x+k-1]];
			root[x]=upd(root[x],1,n-k+1,max(1,j-k+1),min(j,n-k+1),1);
			{
				int j=invb[a[x-1]];
				root[x]=upd(root[x],1,n-k+1,max(1,j-k+1),min(j,n-k+1),-1);
			}
		}
		mp[T[root[x]].v[0]]+=T[root[x]].v[1];
	}
	{
		pair<int,ll> ans=*mp.rbegin();
		cout<<ans.first<<" "<<ans.second<<endl;
	}
	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 j=invb[a[t[i]]];
			root[t[i]-k+1]=upd(root[t[i]-k+1],1,n-k+1,max(1,j-k+1),min(j,n-k+1),-1);
			j=invb[a[t[i]+1]];
			root[t[i]-k+1]=upd(root[t[i]-k+1],1,n-k+1,max(1,j-k+1),min(j,n-k+1),1);
			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 j=invb[a[t[i]]];
			root[t[i]+1]=upd(root[t[i]+1],1,n-k+1,max(1,j-k+1),min(j,n-k+1),1);
			j=invb[a[t[i]+1]];
			root[t[i]+1]=upd(root[t[i]+1],1,n-k+1,max(1,j-k+1),min(j,n-k+1),-1);
			mp[T[root[t[i]+1]].v[0]]+=T[root[t[i]+1]].v[1];
		}
		swap(a[t[i]],a[t[i]+1]);
		{
			debug(mp);
			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;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:9:20: warning: statement has no effect [-Wunused-value]
    9 | #define debug(...) 42
      |                    ^~
Main.cpp:110:4: note: in expansion of macro 'debug'
  110 |    debug(mp);
      |    ^~~~~

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 468 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 0 ms 468 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 0 ms 468 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 1 ms 468 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 468 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 0 ms 468 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 0 ms 468 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 1 ms 468 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 6 ms 8748 KB Output is correct
17 Correct 9 ms 8660 KB Output is correct
18 Correct 1 ms 724 KB Output is correct
19 Correct 5 ms 4556 KB Output is correct
20 Correct 9 ms 8648 KB Output is correct
21 Correct 8 ms 8756 KB Output is correct
22 Correct 1 ms 984 KB Output is correct
23 Correct 9 ms 8776 KB Output is correct
24 Correct 8 ms 8776 KB Output is correct
25 Correct 8 ms 8756 KB Output is correct
26 Correct 11 ms 8776 KB Output is correct
27 Correct 9 ms 8648 KB Output is correct
28 Correct 6 ms 8648 KB Output is correct
29 Correct 6 ms 4556 KB Output is correct
30 Correct 1 ms 984 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 468 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 0 ms 468 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 0 ms 468 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 1 ms 468 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 6 ms 8748 KB Output is correct
17 Correct 9 ms 8660 KB Output is correct
18 Correct 1 ms 724 KB Output is correct
19 Correct 5 ms 4556 KB Output is correct
20 Correct 9 ms 8648 KB Output is correct
21 Correct 8 ms 8756 KB Output is correct
22 Correct 1 ms 984 KB Output is correct
23 Correct 9 ms 8776 KB Output is correct
24 Correct 8 ms 8776 KB Output is correct
25 Correct 8 ms 8756 KB Output is correct
26 Correct 11 ms 8776 KB Output is correct
27 Correct 9 ms 8648 KB Output is correct
28 Correct 6 ms 8648 KB Output is correct
29 Correct 6 ms 4556 KB Output is correct
30 Correct 1 ms 984 KB Output is correct
31 Correct 205 ms 133036 KB Output is correct
32 Correct 182 ms 133096 KB Output is correct
33 Correct 14 ms 5708 KB Output is correct
34 Correct 170 ms 133004 KB Output is correct
35 Correct 336 ms 264508 KB Output is correct
36 Correct 298 ms 264424 KB Output is correct
37 Correct 32 ms 17980 KB Output is correct
38 Correct 309 ms 264368 KB Output is correct
39 Correct 244 ms 264420 KB Output is correct
40 Correct 268 ms 264428 KB Output is correct
41 Correct 279 ms 264376 KB Output is correct
42 Correct 360 ms 264384 KB Output is correct
43 Correct 183 ms 132932 KB Output is correct
44 Correct 147 ms 132980 KB Output is correct
45 Correct 32 ms 18048 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 468 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 0 ms 468 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 0 ms 468 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 1 ms 468 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 724 KB Output is correct
17 Correct 1 ms 724 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 724 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 724 KB Output is correct
23 Correct 1 ms 724 KB Output is correct
24 Correct 1 ms 724 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 724 KB Output is correct
27 Correct 1 ms 724 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 724 KB Output is correct
30 Correct 1 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 468 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 0 ms 468 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 0 ms 468 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 1 ms 468 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 6 ms 8748 KB Output is correct
17 Correct 9 ms 8660 KB Output is correct
18 Correct 1 ms 724 KB Output is correct
19 Correct 5 ms 4556 KB Output is correct
20 Correct 9 ms 8648 KB Output is correct
21 Correct 8 ms 8756 KB Output is correct
22 Correct 1 ms 984 KB Output is correct
23 Correct 9 ms 8776 KB Output is correct
24 Correct 8 ms 8776 KB Output is correct
25 Correct 8 ms 8756 KB Output is correct
26 Correct 11 ms 8776 KB Output is correct
27 Correct 9 ms 8648 KB Output is correct
28 Correct 6 ms 8648 KB Output is correct
29 Correct 6 ms 4556 KB Output is correct
30 Correct 1 ms 984 KB Output is correct
31 Correct 1 ms 724 KB Output is correct
32 Correct 1 ms 724 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 724 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 1 ms 724 KB Output is correct
38 Correct 1 ms 724 KB Output is correct
39 Correct 1 ms 724 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 1 ms 724 KB Output is correct
42 Correct 1 ms 724 KB Output is correct
43 Correct 0 ms 340 KB Output is correct
44 Correct 1 ms 724 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 23 ms 16984 KB Output is correct
47 Correct 19 ms 16964 KB Output is correct
48 Correct 2 ms 728 KB Output is correct
49 Correct 15 ms 17028 KB Output is correct
50 Correct 38 ms 33448 KB Output is correct
51 Correct 3 ms 2512 KB Output is correct
52 Correct 18 ms 16916 KB Output is correct
53 Correct 34 ms 33420 KB Output is correct
54 Correct 31 ms 33472 KB Output is correct
55 Correct 9 ms 8776 KB Output is correct
56 Correct 36 ms 33376 KB Output is correct
57 Correct 35 ms 33472 KB Output is correct
58 Correct 5 ms 4684 KB Output is correct
59 Correct 31 ms 33420 KB Output is correct
60 Correct 5 ms 4684 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 468 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 0 ms 468 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 0 ms 468 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 1 ms 468 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 6 ms 8748 KB Output is correct
17 Correct 9 ms 8660 KB Output is correct
18 Correct 1 ms 724 KB Output is correct
19 Correct 5 ms 4556 KB Output is correct
20 Correct 9 ms 8648 KB Output is correct
21 Correct 8 ms 8756 KB Output is correct
22 Correct 1 ms 984 KB Output is correct
23 Correct 9 ms 8776 KB Output is correct
24 Correct 8 ms 8776 KB Output is correct
25 Correct 8 ms 8756 KB Output is correct
26 Correct 11 ms 8776 KB Output is correct
27 Correct 9 ms 8648 KB Output is correct
28 Correct 6 ms 8648 KB Output is correct
29 Correct 6 ms 4556 KB Output is correct
30 Correct 1 ms 984 KB Output is correct
31 Correct 205 ms 133036 KB Output is correct
32 Correct 182 ms 133096 KB Output is correct
33 Correct 14 ms 5708 KB Output is correct
34 Correct 170 ms 133004 KB Output is correct
35 Correct 336 ms 264508 KB Output is correct
36 Correct 298 ms 264424 KB Output is correct
37 Correct 32 ms 17980 KB Output is correct
38 Correct 309 ms 264368 KB Output is correct
39 Correct 244 ms 264420 KB Output is correct
40 Correct 268 ms 264428 KB Output is correct
41 Correct 279 ms 264376 KB Output is correct
42 Correct 360 ms 264384 KB Output is correct
43 Correct 183 ms 132932 KB Output is correct
44 Correct 147 ms 132980 KB Output is correct
45 Correct 32 ms 18048 KB Output is correct
46 Correct 1 ms 724 KB Output is correct
47 Correct 1 ms 724 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 724 KB Output is correct
51 Correct 0 ms 340 KB Output is correct
52 Correct 1 ms 724 KB Output is correct
53 Correct 1 ms 724 KB Output is correct
54 Correct 1 ms 724 KB Output is correct
55 Correct 1 ms 468 KB Output is correct
56 Correct 1 ms 724 KB Output is correct
57 Correct 1 ms 724 KB Output is correct
58 Correct 0 ms 340 KB Output is correct
59 Correct 1 ms 724 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 23 ms 16984 KB Output is correct
62 Correct 19 ms 16964 KB Output is correct
63 Correct 2 ms 728 KB Output is correct
64 Correct 15 ms 17028 KB Output is correct
65 Correct 38 ms 33448 KB Output is correct
66 Correct 3 ms 2512 KB Output is correct
67 Correct 18 ms 16916 KB Output is correct
68 Correct 34 ms 33420 KB Output is correct
69 Correct 31 ms 33472 KB Output is correct
70 Correct 9 ms 8776 KB Output is correct
71 Correct 36 ms 33376 KB Output is correct
72 Correct 35 ms 33472 KB Output is correct
73 Correct 5 ms 4684 KB Output is correct
74 Correct 31 ms 33420 KB Output is correct
75 Correct 5 ms 4684 KB Output is correct
76 Runtime error 751 ms 524288 KB Execution killed with signal 9
77 Halted 0 ms 0 KB -