제출 #309104

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
309104		shivensinha4	Lottery (CEOI18_lot)	C++17	0 / 100	3077 ms	1188 KiB

lot

#include <bits/stdc++.h> 
using namespace std; 
#define for_(i, s, e) for (int i = s; i < (int) e; i++)
#define for__(i, s, e) for (ll i = s; i < e; i++)
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
#define endl '\n'

const int MXN = 10000, MXQ = 100;
int ans[MXQ+1][MXN+1], nums[MXN+1], match[MXN+1], freq[MXN+3];
ii qr[MXQ+1];
vi pos[MXN+1];

int main() {
	#ifdef shiven
	freopen("test.in", "r", stdin);
	#endif
	
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	int n, l; cin >> n >> l;
	vector<ii> val(n);
	for_(i, 0, n) {
		cin >> nums[i];
		val[i] = {nums[i], i};
	}
	
	sort(val.begin(), val.end());
	int pt = -1;
	for_(i, 0, n) {
		if (i > 0 and val[i].first == val[i-1].first) nums[val[i].second] = pt;
		else nums[val[i].second] = ++pt;
	}
	
	for_(i, 0, n) pos[nums[i]].push_back(i);
	
	int q; cin >> q;
	for_(i, 0, q) {
		cin >> qr[i].first;
		qr[i].second = i;
	}
	
	sort(qr, qr+q);
	
	for_(i, 0, n-l+1) {
		memset(match, 0, sizeof(match)); memset(freq, 0, sizeof(freq));
		for_(j, 0, l) for (auto p: pos[nums[i+j]]) if (p >= j and p != i+j) match[p-j] += 1;
		for_(j, 0, n-l+1) if (i != j) {
			int pt = lower_bound(qr, qr+q, (ii) {l-match[j], -1})-qr;
			if (pt != q) ans[pt][i] += 1;
		}
	}
	
	for_(qq, 1, q) for_(i, 0, n-l+1) ans[qr[qq].second][i] += ans[qr[qq-1].second][i];
	
	for_(i, 0, q) {
		for_(j, 0, n-l+1) cout << ans[i][j] << " ";
		cout << endl;
	}
	
	cout << endl;

	return 0;
}

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