oj.uz

Submission #941277

# Submission time Handle Problem Language Result Execution time Memory
941277 2024-03-08T12:30:10 Z sleepntsheep Lottery (CEOI18_lot) C
25 / 100
 33 ms 65536 KB 
#include<stdio.h>

#define N 10001
int n,l,q,a[N];
short ans[N][N];
short dp[N][N];

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=1;j<=n;++j)dp[i][j]=(a[i]!=a[j]);
    for(int i=1;i<=n;++i)for(int j=1;j<=n;++j)dp[i][j]+=dp[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[i+l-1][j+l-1]-dp[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

lot.c: In function 'main':
lot.c:10:5: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |     scanf("%d%d",&n,&l);
      |     ^~~~~~~~~~~~~~~~~~~
lot.c:11:26: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |     for(int i=1;i<=n;++i)scanf("%d",a+i);
      |                          ^~~~~~~~~~~~~~~
lot.c:22:5: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |     scanf("%d",&q);
      |     ^~~~~~~~~~~~~~
lot.c:25:9: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |         scanf("%d",&u);
      |         ^~~~~~~~~~~~~~

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 6748 KB Output is correct
3 Correct 1 ms 6832 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 1 ms 6748 KB Output is correct
6 Correct 1 ms 6744 KB Output is correct
7 Correct 2 ms 6744 KB Output is correct
8 Correct 4 ms 13148 KB Output is correct
9 Correct 3 ms 13148 KB Output is correct
10 Correct 3 ms 14940 KB Output is correct
11 Correct 4 ms 14940 KB Output is correct
12 Correct 3 ms 14940 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 6748 KB Output is correct
3 Correct 1 ms 6832 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 1 ms 6748 KB Output is correct
6 Correct 1 ms 6744 KB Output is correct
7 Correct 2 ms 6744 KB Output is correct
8 Correct 4 ms 13148 KB Output is correct
9 Correct 3 ms 13148 KB Output is correct
10 Correct 3 ms 14940 KB Output is correct
11 Correct 4 ms 14940 KB Output is correct
12 Correct 3 ms 14940 KB Output is correct
13 Runtime error 25 ms 65536 KB Execution killed with signal 9
14 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 33 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 33 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 6748 KB Output is correct
3 Correct 1 ms 6832 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 1 ms 6748 KB Output is correct
6 Correct 1 ms 6744 KB Output is correct
7 Correct 2 ms 6744 KB Output is correct
8 Correct 4 ms 13148 KB Output is correct
9 Correct 3 ms 13148 KB Output is correct
10 Correct 3 ms 14940 KB Output is correct
11 Correct 4 ms 14940 KB Output is correct
12 Correct 3 ms 14940 KB Output is correct
13 Runtime error 25 ms 65536 KB Execution killed with signal 9
14 Halted 0 ms 0 KB -