제출 #362865

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
362865		Nimbostratus	Lottery (CEOI18_lot)	C++17	45 / 100	352 ms	1260 KiB

lot

#include <bits/stdc++.h>
using namespace std;
#define eb emplace_back
#define pb push_back
#define ppb pop_back
#define ub upper_bound
#define lb lower_bound
#define bs binary_search
#define cl(a,s) memset((a),0,sizeof((a)[0])*(s))
#define all(x) (x).begin() , (x).end()
#define fi first
#define se second
#define int int
using pii = pair<int,int>;
using ll = long long;
const int maxn = 2005;
const int maxq = 105;
const int inf = 1e9;
const int mod = 1e9+7;

int n,a[maxn],l,q;
int ans[maxn][maxq];
int k[maxq];

int dist(int ind1 ,int ind2) {
	int cnt = 0;
	for(int i=ind1;i<=ind1+l-1;i++)
		if(a[i] != a[ind2+i-ind1])
			cnt++;
	return cnt;
}

int32_t main () {
	//freopen("in","r",stdin); freopen("out","w",stdout);
	ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0);
	cin >> n >> l;
	for(int i=1;i<=n;i++) cin >> a[i];
	cin >> q;
	for(int i=1;i<=q;i++) cin >> k[i];
	for(int i=1;i+l-1<=n;i++)
		for(int j=i+1;j+l-1<=n;j++) {
			int res = dist(i,j);
			for(int m=q;m>=1;m--) {
				if(res > k[m]) continue;
				ans[i][m]++;
				ans[j][m]++;
			}
		}	
	for(int i=1;i<=q;i++,cout << endl)
		for(int j=1;j+l-1<=n;j++)
			cout << ans[j][i] << " ";
}	
	

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