# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
217519 | DystoriaX | Lottery (CEOI18_lot) | C++14 | 63 ms | 16248 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;
int n, l;
int a[2010], b[2010];
int cnt[2010][2010];
int q;
int main(){
scanf("%d%d", &n, &l);
for(int i = 1; i <= n; i++) scanf("%d", &a[i]), b[i] = a[i];
for(int d = 1; d < n - l + 1; d++){
int diff = 0;
for(int j = 1; j <= l; j++){
if(a[j] != a[j + d]) diff++;
}
cnt[diff][1]++;
cnt[diff][d + 1]++;
for(int i = 2; i + l + d - 1 <= n; i++){
if(a[i - 1] != a[i + d - 1]) diff--;
if(a[i + l - 1] != a[i + l - 1 + d]) diff++;
// cout << "Comparing " << i + l - 1 << " with " << i + l + d -
cnt[diff][i]++;
cnt[diff][i + d]++;
}
}
for(int i = 1; i <= n; i++){
for(int k = 1; k <= n; k++)
cnt[k][i] += cnt[k - 1][i];
}
scanf("%d", &q);
while(q--){
int k; scanf("%d", &k);
for(int i = 1; i <= n - l + 1; i++) printf("%d ", cnt[k][i]);
printf("\n");
}
return 0;
}
Compilation message (stderr)
# | 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... |