Submission #1190159
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 i = 0; i < n - 1; ++i) { int mini = min(a[i], a[i + 1]); odp += mini; a[i] -= mini; a[i + 1] -= mini; } for (int i = 0; i < n; ++i) odp += a[i] / 2; cout << odp; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Simplified mahjong |
User | ArturSocha |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 522 Byte |
Status | WA |
Exec Time | 12 ms |
Memory | 640 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 | 12 ms | 640 KB |
02.txt | WA | 12 ms | 640 KB |
03.txt | WA | 12 ms | 640 KB |
04.txt | WA | 11 ms | 640 KB |
05.txt | WA | 10 ms | 640 KB |
06.txt | WA | 11 ms | 640 KB |
07.txt | WA | 11 ms | 640 KB |
08.txt | WA | 11 ms | 640 KB |
09.txt | WA | 12 ms | 640 KB |
10.txt | WA | 12 ms | 640 KB |
11.txt | AC | 8 ms | 640 KB |
12.txt | AC | 12 ms | 640 KB |
13.txt | AC | 12 ms | 640 KB |
14.txt | AC | 12 ms | 640 KB |
15.txt | AC | 8 ms | 640 KB |
16.txt | WA | 12 ms | 640 KB |
17.txt | WA | 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 |