Submission #1179693

#	Time	Username	Problem	Language	Result	Execution time	Memory
1179693		ByeWorld	Lottery (CEOI18_lot)	C++20	0 / 100	2 ms	324 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 = 1e4+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];
map<vector<int>, int> m;

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];
	for(int i=1; i+l-1<=n; i++){
		vector<int>vec;
		for(int j=i; j<=i+l-1; j++) vec.pb(a[j]);
		m[vec]++;
	}
	int q; cin>>q;
	while(q--){
		int x; cin>>x;
		for(int i=1; i+l-1<=n; i++){
			vector<int>vec;
			for(int j=i; j<=i+l-1; j++) vec.pb(a[j]);
			cout << m[vec] << ' ';
		}
		cout << '\n';
	}
}

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