제출 #918712

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
918712		Abito	Binaria (CCO23_day1problem1)	C++17	10 / 25	1095 ms	289916 KiB

Main

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define ep insert
#define endl '\n'
#define elif else if
#define pow pwr
#define sqrt sqrtt
#define int long long
#define ll long long
#define y1 YONE
#define free freeee
#define lcm llcm
typedef unsigned long long ull;
using namespace std;
const int N=1e6+5,M=1e6+3;
int a[N],n,k,b[N],ans;
map<pair<int,int>,int> dp;
int rec(int i,int mask){
    if (__builtin_popcount(mask)!=b[i]) return 0;
    if (i==n-k+1) return 1;
    if (dp.find({i,mask})!=dp.end()) return dp[{i,mask}];
    return dp[{i,mask}]=(rec(i+1,mask/2)+rec(i+1,mask/2+(1<<(k-1))))%M;
}
int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    cin>>n>>k;
    for (int i=1;i<=n-k+1;i++) cin>>b[i];
    for (int i=0;i<(1<<k);i++) ans=(ans+rec(1,i))%M;
    cout<<ans<<endl;
    return 0;
}

• Subtask 1: 3 / 3
• Subtask 2: 3 / 3
• Subtask 3: 4 / 4
• Subtask 4: 0 / 4
• Subtask 5: 0 / 4
• Subtask 6: 0 / 7