#include <bits/stdc++.h>
using namespace std;
int main()
{
int l, n;
cin >> n >> l;
vector<int> a(n);
vector<__int128_t> hashe(n-l+1);
for(auto &i:a) cin >> i;
__int128_t almoptrime = 1;
almoptrime<<=126;
almoptrime-=1;
for(int i = 0; i < n-l+1; i++)
{
__int128_t has = 0;
for(int llll = 0; llll < l; llll++)
{
has*=1e3+7;
has+=a[i+llll];
has%=almoptrime;
}
hashe[i]=has;
}
int q;
cin >> q;
while(q--)
{
int k;
cin >> k;
for(int i = 0; i < n-l+1; i++)
{
int ans = 0;
for(int j = 0; j < n-l+1; j++)
{
if (i==j) continue;
if(hashe[i]==hashe[j]) ans++;
}
cout << ans << ' ';
}
cout << '\n';
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
88 ms |
648 KB |
Output is correct |
2 |
Correct |
81 ms |
600 KB |
Output is correct |
3 |
Correct |
85 ms |
632 KB |
Output is correct |
4 |
Incorrect |
166 ms |
632 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
88 ms |
648 KB |
Output is correct |
2 |
Correct |
81 ms |
600 KB |
Output is correct |
3 |
Correct |
85 ms |
632 KB |
Output is correct |
4 |
Incorrect |
166 ms |
632 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |