Submission #1500266


Source Code Expand

#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
#define int long long
#define fi first
#define se second
using namespace std;
typedef pair<int, int> P;

signed main(){
    int n;
    cin >> n;
    vector<int> a(n);
    int ans = 0;
    rep(i, 0, n){
        cin >> a[i];
    }
    a. push_back(0);
    int now = 0;
    rep(i, 0, n + 1){
        if(a[i] == 0){
            ans += now / 2;
            now = 0;
        }else{
            now += a[i];
        }
    }
    cout << ans << endl;
}

Submission Info

Submission Time
Task B - Simplified mahjong
User treeone
Language C++14 (GCC 5.4.1)
Score 400
Code Size 661 Byte
Status AC
Exec Time 44 ms
Memory 1792 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 2
AC × 24
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 40 ms 1792 KB
02.txt AC 41 ms 1792 KB
03.txt AC 40 ms 1792 KB
04.txt AC 30 ms 1792 KB
05.txt AC 30 ms 1792 KB
06.txt AC 30 ms 1792 KB
07.txt AC 36 ms 1792 KB
08.txt AC 36 ms 1792 KB
09.txt AC 40 ms 1792 KB
10.txt AC 40 ms 1792 KB
11.txt AC 17 ms 1792 KB
12.txt AC 44 ms 1792 KB
13.txt AC 41 ms 1792 KB
14.txt AC 41 ms 1792 KB
15.txt AC 18 ms 1792 KB
16.txt AC 41 ms 1792 KB
17.txt AC 40 ms 1792 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