답안 #126086

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
126086	2019-07-07T02:53:43 Z	briansu	Lottery (CEOI18_lot)	C++14	45 / 100	40 ms	632 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 = 2e3 + 5;
const ll INF = ll(1e17);
const ll MOD = 1000000007;
const ll bs = 880301;

int dt[MAXn];
int qr[MAXn];

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

int main(){
	IOS();
	ll n, l;
	cin>>n>>l;
	REP1(i, n)cin>>d[i];
	ll q;
	cin>>q;
	REP1(i, q)cin>>qr[i];

	REP1(dif, n)
	{
		REP1(j, n - dif)dt[j] = (d[j] != d[j + dif]) + dt[j-1];
		REP1(t, q)REP1(i, n - l + 1 - dif)if(dt[i + l - 1] - dt[i - 1] <= qr[t])a[t][i] ++, a[t][i + dif] ++;
	}

	REP1(t, q)REP1(i, n - l + 1)cout<<a[t][i]<<" \n"[i == n - l + 1];
}

Subtask #1

25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	372 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	3 ms	376 KB	Output is correct
9	Correct	3 ms	504 KB	Output is correct
10	Correct	4 ms	508 KB	Output is correct
11	Correct	4 ms	556 KB	Output is correct
12	Correct	4 ms	496 KB	Output is correct

Subtask #2

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	372 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	3 ms	376 KB	Output is correct
9	Correct	3 ms	504 KB	Output is correct
10	Correct	4 ms	508 KB	Output is correct
11	Correct	4 ms	556 KB	Output is correct
12	Correct	4 ms	496 KB	Output is correct
13	Correct	26 ms	504 KB	Output is correct
14	Correct	29 ms	504 KB	Output is correct
15	Correct	19 ms	504 KB	Output is correct
16	Correct	40 ms	632 KB	Output is correct
17	Correct	36 ms	504 KB	Output is correct
18	Correct	36 ms	504 KB	Output is correct

Subtask #3

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	3 ms	632 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
2	Halted	0 ms	0 KB	-

Subtask #4

0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	3 ms	632 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	372 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	3 ms	376 KB	Output is correct
9	Correct	3 ms	504 KB	Output is correct
10	Correct	4 ms	508 KB	Output is correct
11	Correct	4 ms	556 KB	Output is correct
12	Correct	4 ms	496 KB	Output is correct
13	Correct	26 ms	504 KB	Output is correct
14	Correct	29 ms	504 KB	Output is correct
15	Correct	19 ms	504 KB	Output is correct
16	Correct	40 ms	632 KB	Output is correct
17	Correct	36 ms	504 KB	Output is correct
18	Correct	36 ms	504 KB	Output is correct
19	Runtime error	3 ms	632 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
20	Halted	0 ms	0 KB	-