제출 #1182448

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1182448		ByeWorld	Lottery (CEOI18_lot)	C++20	45 / 100	39 ms	2120 KiB

lot

#include <bits/stdc++.h>
#pragma GCC optimize("O3")
// #define int long long
#define ll long long
#define pb push_back
#define fi first
#define se second
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
#define ld long double
using namespace std;
typedef pair<int,int> pii;
typedef pair<int,pii> ipii;
const int MAXN = 5e3+10;
const int MAXA = 1e9;
const int INF = 2e9+100;
const int SQRT = 500;
const int LOG = 19;
const int MOD = 998244353;
void chmn(auto &a, auto b){ a = min(a, b); }
void chmx(auto &a, auto b){ a = max(a, b); }
int sum(int a, int b){ a %= MOD; b %= MOD; return (a+b)%MOD; }
void chsum(int &a, int b){ a %= MOD; b %= MOD; a = (a+b)%MOD; }
void chsub(int &a, int b){ a %= MOD; b %= MOD; a = (a+MOD-b)%MOD; }
int mul(int a, int b){ a %= MOD; b %= MOD; return a*b%MOD;}
void chmul(int &a, int b){ a = a*b%MOD; }
int expo(int a, int b){
	if(b==0) return 1;
	int te = expo(a, b/2); te = mul(te, te);
	return (b%2 ? mul(te, a) : te);
}

int n, l;
int a[MAXN], que[110];
int dif[MAXN], ans[MAXN][110], res[MAXN][110];

signed main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>n>>l;
	for(int i=1; i<=n; i++) cin>>a[i];
	int Q; cin>>Q;
	vector<pii>vec; vec.pb({-1,-1});
	for(int P=1; P<=Q; P++){
		cin>>que[P]; // bedanya x
		vec.pb({que[P], P});
	}
	sort(vec.begin(), vec.end());

	for(int jump=-n+1; jump<=n-1; jump++){ // lompatnya brp
		if(jump==0) continue; 
		for(int i=0; i<=n; i++) dif[i] = 0;

		for(int i=1; i<=n; i++){
			int j = i+jump;
			if(j<=0 || j>n || a[i] != a[j]) continue;
			dif[max(1,i-l+1)]++; dif[i+1]--; // yg start di
			// if(jump==1) cout << max(1,i-l+1) << ' '<< i+1 <<" staen\n";
		}
		for(int i=1; i<=n; i++) dif[i] += dif[i-1];
		for(int i=1; i<=n; i++){ // i sm i+jump, samanya = dif[i]
			int j = i+jump;
			if(j<=0 || j+l-1>n) continue;
			int beda = l-dif[i];
			// cout << i << ' ' << jump<<' '<< beda << " val\n";
			int id = lower_bound(vec.begin(), vec.end(), pii(beda, -1))
				-vec.begin();
			ans[i][id]++;
		}
	}
	for(int i=1; i<=n-l+1; i++){
		for(int P=1; P<=Q; P++)
			ans[i][P] += ans[i][P-1]; 
		for(int P=Q; P>=1; P--)
			res[i][vec[P].se] = ans[i][P]; 
	}

	for(int P=1; P<=Q; P++){
		for(int i=1; i<=n-l+1; i++)
			cout << res[i][P] << ' ';
		cout << '\n';
	}
}

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