Submission #844568
Source Code Expand
Copy
#include <bits/stdc++.h> using namespace std; typedef pair<int, int> PII; typedef long long ll; #define fi first #define se second #define mp make_pair #define pb push_back #define pct __builtin_popcount #define N 100010 int n, a[N]; ll S; int main () { cin >> n; for (int i = 0; i < n; i ++) cin >> a[i]; int la = 0; for (int i = 0; i < n; i ++) { if (la > 0 && a[i] > 0) { la --; a[i] --; S ++; } S += a[i]/2; a[i] %= 2; la = a[i]; } cout << S << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Simplified mahjong |
User | sevenkplus |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 529 Byte |
Status | AC |
Exec Time | 90 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 | 83 ms | 640 KB |
02.txt | AC | 88 ms | 640 KB |
03.txt | AC | 82 ms | 640 KB |
04.txt | AC | 63 ms | 640 KB |
05.txt | AC | 64 ms | 640 KB |
06.txt | AC | 68 ms | 640 KB |
07.txt | AC | 78 ms | 640 KB |
08.txt | AC | 86 ms | 640 KB |
09.txt | AC | 87 ms | 640 KB |
10.txt | AC | 83 ms | 640 KB |
11.txt | AC | 43 ms | 640 KB |
12.txt | AC | 90 ms | 640 KB |
13.txt | AC | 88 ms | 640 KB |
14.txt | AC | 85 ms | 640 KB |
15.txt | AC | 42 ms | 640 KB |
16.txt | AC | 83 ms | 640 KB |
17.txt | AC | 82 ms | 640 KB |
18.txt | AC | 4 ms | 256 KB |
19.txt | AC | 4 ms | 256 KB |
20.txt | AC | 4 ms | 256 KB |
21.txt | AC | 4 ms | 256 KB |
22.txt | AC | 4 ms | 256 KB |
s1.txt | AC | 4 ms | 256 KB |
s2.txt | AC | 4 ms | 256 KB |