Submission #988768

#	Time	Username	Problem	Language	Result	Execution time	Memory
988768		HD1	Binaria (CCO23_day1problem1)	C++14	6 / 25	1 ms	372 KiB

Main

//we all are lost trying to be someone
//The best way to predict the future is to create it
#include<bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(0); cin.tie(0);
#define sz(x) ll(x.size())
#define all(x) x.begin(), x.end()
#define pb push_back
#define ff first
#define ss second
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> ii;
typedef pair<ii,ll> tri;
const ll mod=1e6+3;
const ll MAX=1e6;
ll n, k;
ll A[MAX];
void solve(){
    cin>>n>>k;
    for(int i=0; i<n-k+1; i++){
        cin>>A[i];
    }
    ll ans=0;
    for(int i=0; i<(1<<n); i++){
        ll sum=0;
        for(int j=0; j<k; j++){
            if((i>>j)&1)sum++;
        }
        bool xd=false;
        for(int j=k-1; j<n; j++){
            if(A[j-k+1]!=sum){
                xd=true;
                break;
            }
            if((i>>(j-k+1))&1)sum--;
            if((i>>(j+1))&1)sum++;
        }
        if(!xd)ans++;
    }
    cout<<ans<<'\n';
}
int main(){
    fastio;
    solve();
    return 0;
}

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