# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1060290 | aymanrs | Sličnost (COI23_slicnost) | C++17 | 3052 ms | 2392 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>
using namespace std;
void ans(int n, int a[],int b[], int k){
bool s[n+1] = {false};
for(int i = 0;i < k;i++) s[a[i]] = true;
int tans = -1, co = 0;
for(int i = 0;i+k <= n;i++){
if(i) {
s[a[i-1]]=false;
s[a[i+k-1]] = true;
}
int t = 0;
for(int j = 0;j < k;j++) t += s[b[j]];
if(t>tans){
tans = t;co=1;
} else if(t == tans) co++;
for(int j = 1;j+k <= n;j++){
t -= s[b[j-1]];
t += s[b[j+k-1]];
if(t>tans){
tans = t;co=1;
} else if(t == tans) co++;
}
}
cout << tans << ' ' << co << '\n';
}
void solve(){
int n, k ,q;cin >> n >> k >> q;
int a[n],b[n];
for(int i = 0;i < n;i++) cin >> a[i];
# | 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... |