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<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ii;
#define REP(i, n) for(int i = 0;i < n;i ++)
#define REP1(i, n) for(int i = 1;i <= n;i ++)
#define FILL(i, n) memset(i, n, sizeof(i))
#define X first
#define Y second
#define pb push_back
#define SZ(_a) ((int)(_a).size())
#define ALL(_a) (_a).begin(), (_a).end()
#ifdef brian
#define IOS()
template<typename T>void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...t> void _do(T &&x, t &&...X){cerr<<x<<", ";_do(X...);}
#define debug(...) {\
fprintf(stderr, "%s - %d (%s) = ", __PRETTY_FUNCTION__, __LINE__, #__VA_ARGS__);\
_do(__VA_ARGS__);\
}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define debug(...)
#define endl '\n'
#endif
const ll MAXn = 1e4 + 5;
const ll INF = ll(1e17);
const ll MOD = 1000000007;
const ll bs = 880301;
map<ll, ll> mp;
ll norm(ll x)
{
if(x < 0)x += MOD;
return x;
}
ll d[MAXn], dt[MAXn];
int main(){
IOS();
ll n, l;
cin>>n>>l;
REP1(i, n)cin>>d[i];
ll pw = 1, tt = 0;
REP1(i, l)pw = pw * bs % MOD;
REP1(i, n)
{
tt = (tt * bs + d[i]) % MOD;
if(i > l)tt = norm((tt - pw * d[i - l]) % MOD);
if(i >= l)dt[i] = tt, mp[tt]++;
}
REP1(i, n)if(i >= l)cout<<mp[dt[i]] - 1<<" ";
cout<<endl;
}
# | 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... |