Submission #1187461

#	Time	Username	Problem	Language	Result	Execution time	Memory
1187461		vito	Sličnost (COI23_slicnost)	C++20	17 / 100	162 ms	540 KiB

Main

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define F first
#define S second
#define sz(x) int(x.size())
const int MAX=5e3+5;
int n, k, q;
int a[MAX], b[MAX], ib[MAX];
int fen[MAX];
int sum(int x) {
	int ret=0;
	for(; x>=1; x-=x&-x) {
		ret+=fen[x];
	}
	return ret;
}
void upd(int i, int x) {
	for(; i<MAX; i+=i&-i) {
		fen[i]+=x;
	}
}
signed main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.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];
		ib[b[i]]=i;
	}
	vector<int> out(n+5);
	for(int i=1; i<=k; i++) {
		upd(ib[a[i]], 1);
	}
	for(int i=k; i<=n; i++) {
		out[sum(i)-sum(i-k)]++;
	}
	for(int i=k+1; i<=n; i++) {
		upd(ib[a[i]], 1);
		upd(ib[a[i-k]], -1);
		for(int j=k; j<=n; j++) {
			out[sum(j)-sum(j-k)]++;
		}
	}
	for(int i=n; i>=1; i--) {
		if(out[i]>0) {
			cout << i << ' ' << out[i] << '\n';
			break;
		}
	}
	return 0;
}

• Subtask 1: 7 / 7
• Subtask 2: 10 / 10
• Subtask 3: 0 / 33
• Subtask 4: 0 / 7
• Subtask 5: 0 / 10
• Subtask 6: 0 / 33