# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1093582 | Luvidi | Sličnost (COI23_slicnost) | C++17 | 3069 ms | 3420 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;
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define fs first
#define sc second
#define pb push_back
const int maxn=1e5;
int n,k,q,a[maxn],b[maxn],idx[maxn];
ll seg[maxn];
void upd(int i,int x){
i=idx[a[i]];
for(int j=max(0,i-(k-1));j<=min(i,n-k);j++){
seg[j]+=x;
}
}
void calc(){
memset(seg,0,sizeof(seg));
pll ans={0,0};
for(int i=0;i<k-1;i++){
upd(i,1);
}
for(int i=0;i<=n-k;i++){
upd(i+k-1,1);
for(int j=0;j<=n-k;j++){
# | 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... |