oj.uz

Submission #145100

# Submission time Handle Problem Language Result Execution time Memory
145100 2019-08-18T18:55:20 Z JeanAji Lottery (CEOI18_lot) C++14
0 / 100
 3000 ms 776 KB 
#include <bits/stdc++.h>

using namespace std;
long long  n,l,ans[100000],a[100000],q;
int main()
{
    int o;
    cin>>n>>l;
    for (int i=0;i<n;i++) cin>>a[i];
    cin>>q;
    cin>>o;

    for (int i=0;i<n-l+1;i++)
    {
        for (int j=0;j<n-l+1;j++)
        {
            o=1;
            if (i==j) continue;
            for (int k=0;k<l;k++)
            {
                if (a[k+i]!=a[j+k])
                {
                    o=0;
                    break;
                }
            }
            if (o==1)
            {
                ans[i]++;
            }
        }
    }
    for (int i=0;i<n-l+1;i++) cout<<ans[i]<<" ";
    return 0;
}

Subtask #1
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Incorrect 2 ms 248 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Incorrect 2 ms 248 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 857 ms 760 KB Output is correct
2 Correct 914 ms 760 KB Output is correct
3 Correct 320 ms 776 KB Output is correct
4 Correct 218 ms 728 KB Output is correct
5 Execution timed out 3033 ms 504 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 857 ms 760 KB Output is correct
2 Correct 914 ms 760 KB Output is correct
3 Correct 320 ms 776 KB Output is correct
4 Correct 218 ms 728 KB Output is correct
5 Execution timed out 3033 ms 504 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Incorrect 2 ms 248 KB Output isn't correct
3 Halted 0 ms 0 KB -