Submission #883592

#	Time	Username	Problem	Language	Result	Execution time	Memory
883592		tsumondai	Lottery (CEOI18_lot)	C++14	100 / 100	299 ms	8276 KiB

lot

#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define foru(i, l, r) for(int i = l; i <= r; i++)
#define ford(i, r, l) for(int i = r; i >= l; i--)
#define __TIME  (1.0 * clock() / CLOCKS_PER_SEC)

typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;

const int N = 1e4 + 5;

const int oo = 1e9, mod = 1e9 + 7;

int n, l, a[N], ps[N + 1], ans[N][100 + 1], b[N + 1], q, k[100], k2[100 + 1];

void process() {
	cin >> n >> l;
	foru(i, 0, n - 1) cin >> a[i];
	cin >> q;
	foru(i, 0, q - 1) cin >> k[i], k2[i] = k[i];
	sort(k2, k2 + q);
	k2[q] = l;
	for (int i = 0, p = -1; i <= q; ++i) {
		foru(j, p + 1, k2[i]) b[j] = i;
		p = k2[i];
	}
	foru(i, 1, n - l) {
		foru(j, 0, n - i - 1) ps[j + 1] = ps[j] + (a[j] != a[i + j]);
		foru(j, 0, n - i - l) {
			++ans[j][b[ps[j + l] - ps[j]]];
			++ans[j + i][b[ps[j + l] - ps[j]]];
		}
	}
	foru(i, 0, n - l) for (int j = 0; j < q - 1; ++j) ans[i][j + 1] += ans[i][j];
	foru(i, 0, q - 1) {
		foru(j, 0,  n - l) cout << ans[j][lower_bound(k2, k2 + q, k[i]) - k2] << " ";
		cout << "\n";
	}
	return;
}

signed main() {
	cin.tie(0)->sync_with_stdio(false);
	//freopen(".inp", "r", stdin);
	//freopen(".out", "w", stdout);
	process();
	cerr << "Time elapsed: " << __TIME << " s.\n";
	return 0;
}

// dont stop

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