Submission #1319726

#TimeUsernameProblemLanguageResultExecution timeMemory
1319726WH8Sličnost (COI23_slicnost)C++17
7 / 100
3089 ms472 KiB
#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++)cin>>b[i]; map<int,int> mappa; for(int i=1;i<=n-k+1;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-k+1;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<<'\n'; while(q--){ int a,b;cin>>a>>b; cout<<l<<" "<<c<<'\n'; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...