제출 #397436

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
397436		abdzag	Lottery (CEOI18_lot)	C++17	65 / 100	3087 ms	580 KiB

lot

#include<bits/stdc++.h>

#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
#define rrep(i,a,b) for(int i=int(a);i>int(b);i--)
#define all(v) v.begin(),v.end()
#define trav(a,v) for(auto&a:v)
#define  sz(a) a.size()
using namespace std;
const long long inf = 1e15;
typedef long long ll;

int main() {
	cin.sync_with_stdio(false);
	ll n, l;
	cin >> n >> l;
	vector<ll> v(n);
	rep(i, 0, n)cin >> v[i];
	int Q;
	cin >> Q;
	vector<int> q(Q);
	rep(i, 0, Q) {
		cin >> q[i];
	}
	vector<vector<int>> res(Q, vector<int>(n - l + 1, -1));
	vector<int> dist(n - l + 1);
	rep(i, 0, n - l + 1) {
		rep(j, 0, l) {
			if (v[i + j] != v[j])dist[i]++;
		}
	}
	rep(i, 0, Q) {
		rep(j, 0, n - l + 1) {
			res[i][0] += (dist[j] <= q[i]);
		}
	}
	vector<int> dist2(n-l+1);
	rep(i, 1, n - l + 1) {
		rrep(j, n - l, 0) {
			dist[j] = dist[j - 1];
		}
		dist[0] = 0;
		rep(j, 0, l) {
			if (v[j] != v[i + j])dist[0]++;
		}
		rep(j, 0, n - l) {
			dist[j + 1] -= (v[i - 1] != v[j]);
			dist[j + 1] += (v[i + l - 1] != v[j + l]);
		}
		rep(j, 0, n - l + 1)dist2[j] = dist[j];
		sort(all(dist2));
		rep(o, 0, Q) {
			res[o][i] += upper_bound(all(dist2), q[o]) - dist2.begin();
		}
	}
	trav(vec, res) {
		trav(a, vec)cout << a << " ";
		cout << '\n';
	}
	return 0;
}

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