Submission #1594963
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define INF (1LL << 31 - 1) #define MOD int(1e9+7) #define repi(i,j,n) for(int i = (j); i < (n); ++i) #define rep(i,n) repi(i,0,n) #define fi first #define se second inline void init() { cin.tie(0); ios::sync_with_stdio(false); } long long n, a[100002], ans; int main() { init(); cin >> n; rep(i, n) { cin >> a[i]; } rep(i, n) { ans += a[i] / 2; a[i] /= 2; if (a[i] == 1) { if (a[i + 1] > 0) { a[i]--; ans++; a[i + 1]--; } } } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Simplified mahjong |
User | otyaduke_117 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 704 Byte |
Status | WA |
Exec Time | 11 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 | 11 ms | 1024 KB |
03.txt | WA | 11 ms | 1024 KB |
04.txt | WA | 9 ms | 1024 KB |
05.txt | WA | 10 ms | 1024 KB |
06.txt | WA | 9 ms | 1024 KB |
07.txt | WA | 10 ms | 1024 KB |
08.txt | WA | 10 ms | 1024 KB |
09.txt | WA | 11 ms | 1024 KB |
10.txt | WA | 11 ms | 1024 KB |
11.txt | AC | 7 ms | 1024 KB |
12.txt | AC | 11 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 | WA | 1 ms | 256 KB |