# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
145099 |
2019-08-18T18:53:39 Z |
JeanAji |
Lottery (CEOI18_lot) |
C++14 |
|
814 ms |
548 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]++;
ans[j]++;
}
}
}
for (int i=0;i<n-l+1;i++) cout<<ans[i]<<" ";
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
252 KB |
Output is correct |
2 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
252 KB |
Output is correct |
2 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
814 ms |
548 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
814 ms |
548 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
252 KB |
Output is correct |
2 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |