# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1114269 | epicci23 | Sličnost (COI23_slicnost) | C++17 | 250 ms | 199112 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
#define int long long
#define all(v) v.begin() , v.end()
#define sz(a) (int)a.size()
using namespace std;
const int N = 5005;
void _(){
int n,k,q;
cin >> n >> k >> q;
int a[n+5],b[n+5];
for(int i=1;i<=n;i++) cin >> a[i];
for(int i=1;i<=n;i++) cin >> b[i];
bitset<N> bs[N];
for(int i=1;i+k-1<=n;i++) for(int j=i;j<=i+k-1;j++) bs[i][a[j]]=1;
int ans[n+5][n+5],tot[n+5];
memset(ans,-1,sizeof(ans));
memset(tot,0,sizeof(tot));
for(int i=1;i+k-1<=n;i++){
int res = 0,p = 0;
while(p<n){
p++;
if(bs[i][b[p]]) res++;
if(p>k && bs[i][b[p-k]]) res--;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |