Submission #1408749
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long lint; typedef pair<int, int> ii; int MOD = 1e9 + 7; int INF = 0x3f3f3f3f; // ll INF = 1e18; int n, p, a[55]; lint dp[55][2]={}; int solve(){ cin >> n >> p; for(int i=1;i<=n;i++) cin >> a[i]; dp[0][0]++; for(int i=1;i<=n;i++){ if(a[i] & 1){ dp[i][0] += dp[i-1][1]; dp[i][1] += dp[i-1][0]; }else{ dp[i][0] += dp[i-1][0]; dp[i][1] += dp[i-1][1]; } dp[i][0] += dp[i-1][0]; dp[i][1] += dp[i-1][1]; } cout << dp[n][p] << endl; return 0; } int main(){ ios::sync_with_stdio(0); // int t; cin >> t; while(t--) solve(); // cout << (solve() ? "YES" : "NO") << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Biscuits |
User | STommydx |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 709 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt, sample3.txt, sample4.txt |
All | sample1.txt, sample2.txt, sample3.txt, sample4.txt, in1.txt, in2.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, sample1.txt, sample2.txt, sample3.txt, sample4.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in1.txt | AC | 1 ms | 256 KB |
in2.txt | AC | 1 ms | 256 KB |
in3.txt | AC | 1 ms | 256 KB |
in4.txt | AC | 1 ms | 256 KB |
in5.txt | AC | 1 ms | 256 KB |
in6.txt | AC | 1 ms | 256 KB |
in7.txt | AC | 1 ms | 256 KB |
in8.txt | AC | 1 ms | 256 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |
sample4.txt | AC | 1 ms | 256 KB |