# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
941283 | sleepntsheep | Lottery (CEOI18_lot) | C11 | 31 ms | 65536 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<stdio.h>
#define N 10001
int n,l,q,a[N];
short ans[N][N];
short dp[N*(N+1)/2];
int pos(int x,int y)
{
return (y+1ll)*(y+2)/2+x;
}
int main()
{
scanf("%d%d",&n,&l);
for(int i=1;i<=n;++i)scanf("%d",a+i);
for(int i=1;i<=n;++i)for(int j=i+1;j<=n;++j)dp[pos(i,j)]=(a[i]!=a[j]);
for(int i=1;i<=n;++i)for(int j=i+1;j<=n;++j)dp[pos(i,j)]+=dp[pos(i-1,j-1)];
for(int i=1;i+l-1<=n;++i)for(int j=i+1;j+l-1<=n;++j)
{
int d=dp[pos(i+l-1,j+l-1)]-dp[pos(i-1,j-1)];
ans[i][d]++;
ans[j][d]++;
}
for(int i=1;i<=n;++i)for(int j=1;j<=n;++j)ans[i][j]+=ans[i][j-1];
scanf("%d",&q);
for(int u;q--;)
{
scanf("%d",&u);
for(int i=1;i+l-1<=n;++i)printf("%d ",ans[i][u]);
puts("");
}
}
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... |