Submission #1679099
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define FOR(i, n) for(int i = 0; i < (n); i++) #define MEM(a, x) memset(a, x, sizeof(a)) #define ALL(a) a.begin(), a.end() #define UNIQUE(a) a.erase(unique(ALL(a)), a.end()) typedef long long ll; int n; ll a[100005]; int main(int argc, char const *argv[]) { ios_base::sync_with_stdio(false); cin >> n; ll cnt = 0, last = 0; FOR(i, n) { cin >> a[i]; cnt += a[i]/2; a[i] %= 2; if (last == 1 && a[i] == 1) { cnt++; last = 0; } } cout << cnt << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Simplified mahjong |
User | moguta |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 555 Byte |
Status | WA |
Exec Time | 12 ms |
Memory | 1024 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 400 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, s1.txt, s2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | WA | 11 ms | 1024 KB |
02.txt | WA | 12 ms | 1024 KB |
03.txt | WA | 12 ms | 1024 KB |
04.txt | WA | 10 ms | 1024 KB |
05.txt | WA | 10 ms | 1024 KB |
06.txt | WA | 10 ms | 1024 KB |
07.txt | WA | 11 ms | 1024 KB |
08.txt | WA | 11 ms | 1024 KB |
09.txt | WA | 11 ms | 1024 KB |
10.txt | WA | 12 ms | 1024 KB |
11.txt | AC | 8 ms | 1024 KB |
12.txt | AC | 12 ms | 1024 KB |
13.txt | WA | 11 ms | 1024 KB |
14.txt | WA | 11 ms | 1024 KB |
15.txt | AC | 7 ms | 1024 KB |
16.txt | WA | 11 ms | 1024 KB |
17.txt | WA | 11 ms | 1024 KB |
18.txt | AC | 1 ms | 256 KB |
19.txt | AC | 1 ms | 256 KB |
20.txt | AC | 1 ms | 256 KB |
21.txt | AC | 1 ms | 256 KB |
22.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |