Submission #1409297
Source Code Expand
#include <bits/stdc++.h> #define MOD 1000000007 typedef long long ll; using namespace std; const int N = 55; ll dp[N][2]; int n, p; int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n >> p; dp[0][0] = 1; dp[0][1] = 0; ll ans = 0; for(int i = 1; i <= n; i++) { int c; cin >> c; if(c & 1) { dp[i][0] = dp[i - 1][0] + dp[i - 1][1]; dp[i][1] = dp[i - 1][0] + dp[i - 1][1]; } else { dp[i][0] = 2 * dp[i - 1][0]; dp[i][1] = 2 * dp[i - 1][1]; } ans = max(ans, dp[i][p]); } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Biscuits |
User | jebouin |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 677 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 |