제출 #988765

#제출 시각아이디문제언어결과실행 시간메모리
988765LeaRouseBinaria (CCO23_day1problem1)C++14
6 / 25
1 ms2908 KiB
//IOI - EGOI - OII 2024 #include<bits/stdc++.h> #define fastio ios_base::sync_with_stdio(0); cin.tie(0); #define ll long long #define ff first #define ss second using namespace std; const int MAX=1e5+5; vector<int>v[MAX]; int vis[MAX]; void go(){ int n,k,ans=0; cin>>n>>k; vector<int>v,v1; for(int i=0;i<=n-k;i++){ int x; cin>>x; v.push_back(x); } for(int i=0;i<(1<<n);i++){ int sum=0; for(int j=0;j<k;j++){ int a=(1<<j)&i; if(a>0) sum++; } v1.clear(); for(int j=0;j<=n-k;j++){ v1.push_back(sum); if(j==n-k) continue; if( ((1<<(j+k))&i)>0 ) sum++; if( ((1<<j)&i)>0 ) sum--; } if(v1==v) ans++; } cout<<ans<<endl; } int main(){ fastio; go(); return 0 ; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...