Submission #1190345
Source Code Expand
#include <iostream> #include <vector> using namespace std; typedef long long ll; int main() { ios_base::sync_with_stdio(0); int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; ++i) cin >> a[i]; ll odp = 0; for (int l = 0; l < n; ) { if (a[l] == 0) { ++l; continue; } int p = l; ll s = 0; while (p < n && a[p] != 0) { s += a[p]; ++p; } --p; odp += s / 2; l = p + 1; } cout << odp; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Simplified mahjong |
User | ArturSocha |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 626 Byte |
Status | AC |
Exec Time | 14 ms |
Memory | 640 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 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 | AC | 12 ms | 640 KB |
02.txt | AC | 12 ms | 640 KB |
03.txt | AC | 12 ms | 640 KB |
04.txt | AC | 11 ms | 640 KB |
05.txt | AC | 11 ms | 640 KB |
06.txt | AC | 10 ms | 640 KB |
07.txt | AC | 11 ms | 640 KB |
08.txt | AC | 11 ms | 640 KB |
09.txt | AC | 12 ms | 640 KB |
10.txt | AC | 12 ms | 640 KB |
11.txt | AC | 8 ms | 640 KB |
12.txt | AC | 14 ms | 640 KB |
13.txt | AC | 12 ms | 640 KB |
14.txt | AC | 11 ms | 640 KB |
15.txt | AC | 8 ms | 640 KB |
16.txt | AC | 12 ms | 640 KB |
17.txt | AC | 12 ms | 640 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 |