Submission #1386420
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; const ll maxx = 1e5 + 20; ll a[maxx], n, ans; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n; for(ll i = 0; i < n; i++) cin >> a[i]; for(ll i = 0; i < n; i++) { ans += (a[i] / 2ll); a[i] %= 2; if (!a[i]) continue; if (i == n-1 || !a[i+1]) continue; ans++; a[i+1]--; } cout << ans; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Simplified mahjong |
User | Behnood |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 437 Byte |
Status | AC |
Exec Time | 13 ms |
Memory | 1024 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 | 11 ms | 1024 KB |
02.txt | AC | 12 ms | 1024 KB |
03.txt | AC | 11 ms | 1024 KB |
04.txt | AC | 10 ms | 1024 KB |
05.txt | AC | 10 ms | 1024 KB |
06.txt | AC | 10 ms | 1024 KB |
07.txt | AC | 11 ms | 1024 KB |
08.txt | AC | 11 ms | 1024 KB |
09.txt | AC | 11 ms | 1024 KB |
10.txt | AC | 12 ms | 1024 KB |
11.txt | AC | 7 ms | 1024 KB |
12.txt | AC | 12 ms | 1024 KB |
13.txt | AC | 11 ms | 1024 KB |
14.txt | AC | 11 ms | 1024 KB |
15.txt | AC | 7 ms | 1024 KB |
16.txt | AC | 13 ms | 1024 KB |
17.txt | AC | 12 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 |