Submission #1408650
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> #include <queue> #include <iomanip> #include <set> #include <map> #include <unordered_set> using namespace std; int n, p; int cnt0 = 0; int cnt1 = 0; int main() { ios_base::sync_with_stdio(0); //freopen("game.in", "r", stdin); //freopen("game.out", "w", stdout); //freopen("input.txt", "r", stdin); //freopen("output.txt", "w", stdout); cin >> n >> p; for (int i = 0; i < n; i++) { int x; cin >> x; if (x & 1) { cnt1++; } else { cnt0++; } } long long ans = 1; for (int i = 0; i < cnt0; i++) { ans = ans * 2; } if (p == 1 && cnt1 == 0) { cout << 0; return 0; } cout << (1LL << cnt0) * (1LL << (max(0, cnt1 - 1))); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Biscuits |
User | Lightless |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 777 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 |