제출 #1319718

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1319718		WH8	Sličnost (COI23_slicnost)	C++17	0 / 100	0 ms	332 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pll pair<int, int>
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define ld long double
#define sz(x) static_cast<int>((x).size())
#define i5 tuple<int,int,int,int,int>
#define all(x) x.begin(), x.end()
#define iii tuple<int,int,int>
#define eb emplace_back

int n,k,q;
signed main(){
	cin>>n>>k>>q;
	vector<int> a(n+1,0), b(n+1, 0);
	for(int i=1;i<=n;i++)cin>>a[i];
	for(int i=1;i<=n;i++){
		int c;cin>>c;
		b[i]=c;
	}
	map<int,int> mappa;
	for(int i=1;i<=n;i++){
		vector<bool> ina(n+1, 0);
		for(int z=i;z<i+k;z++)ina[a[z]]=true;
		for(int j=1;j<=n;j++){
			int csm=0;
			for(int z=j;z<j+k;z++){
				if(ina[b[z]])csm++;
			}
			mappa[csm]++;
		}
	}
	auto [l, c] = *(prev(mappa.end()));
	cout<<l<<" "<<c/2<<'\n';
	while(q--){
		int a,b;cin>>a>>b;
		cout<<l<<" "<<c/2<<'\n';
	}
}

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