Submission #126083

#	Time	Username	Problem	Language	Result	Execution time	Memory
126083		briansu	Lottery (CEOI18_lot)	C++14	45 / 100	220 ms	32376 KiB

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 = 2e3 + 5;
const ll INF = ll(1e17);
const ll MOD = 1000000007;
const ll bs = 880301;

int dt[MAXn][MAXn];
int d[MAXn], a[MAXn];

int main(){
	IOS();
	ll n, l;
	cin>>n>>l;
	REP1(i, n)cin>>d[i];
	REP1(i, n)REP1(j, n)if(i + j <= n)dt[i][j] = (d[j] != d[j + i]);
	REP1(i, n)REP1(j, n)dt[i][j] += dt[i][j - 1];
	ll q;
	cin>>q;
	while(q--)
	{
		ll k;
		cin>>k;
		REP1(i, n)a[i] = 0;
		REP1(i, n - l + 1)for(int j = i + 1;j <= n - l + 1;j ++)if(dt[j - i][i + l - 1] - dt[j - i][i - 1] <= k)a[i] ++, a[j]++;
		REP1(i, n - l + 1)cout<<a[i]<<" ";
		cout<<endl;
	}
}

• Subtask 1: 25 / 25
• Subtask 2: 20 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20