Submission #126075

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
126075	2019-07-07T02:17:53 Z	briansu	Lottery (CEOI18_lot)	C++14	20 / 100	8 ms	1144 KB

lot

#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;
}

Subtask #1

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	504 KB	Output is correct
2	Incorrect	2 ms	380 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	504 KB	Output is correct
2	Incorrect	2 ms	380 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #3

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	504 KB	Output is correct
2	Correct	4 ms	632 KB	Output is correct
3	Correct	6 ms	632 KB	Output is correct
4	Correct	6 ms	888 KB	Output is correct
5	Correct	6 ms	888 KB	Output is correct
6	Correct	8 ms	1144 KB	Output is correct
7	Correct	4 ms	632 KB	Output is correct
8	Correct	4 ms	504 KB	Output is correct
9	Correct	5 ms	632 KB	Output is correct
10	Correct	5 ms	636 KB	Output is correct
11	Correct	3 ms	504 KB	Output is correct
12	Correct	7 ms	888 KB	Output is correct
13	Correct	7 ms	888 KB	Output is correct
14	Correct	7 ms	1016 KB	Output is correct

Subtask #4

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	504 KB	Output is correct
2	Correct	4 ms	632 KB	Output is correct
3	Correct	6 ms	632 KB	Output is correct
4	Correct	6 ms	888 KB	Output is correct
5	Correct	6 ms	888 KB	Output is correct
6	Correct	8 ms	1144 KB	Output is correct
7	Correct	4 ms	632 KB	Output is correct
8	Correct	4 ms	504 KB	Output is correct
9	Correct	5 ms	632 KB	Output is correct
10	Correct	5 ms	636 KB	Output is correct
11	Correct	3 ms	504 KB	Output is correct
12	Correct	7 ms	888 KB	Output is correct
13	Correct	7 ms	888 KB	Output is correct
14	Correct	7 ms	1016 KB	Output is correct
15	Incorrect	8 ms	1144 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #5

0 / 20.0

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