Submission #1594917


Source Code Expand

#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>

#define REP(i, m, n) for(int i=int(m);i<int(n);i++)
#define EACH(i, c) for (auto &(i): c)
#define all(c) begin(c),end(c)
#define EXIST(s, e) ((s).find(e)!=(s).end())
#define SORT(c) sort(begin(c),end(c))
#define pb emplace_back
#define MP make_pair
#define SZ(a) int((a).size())

//#define LOCAL 1
#ifdef LOCAL
#define DEBUG(s) cout << (s) << endl
#define dump(x)  cerr << #x << " = " << (x) << endl
#define BR cout << endl;
#else
#define DEBUG(s) do{}while(0)
#define dump(x) do{}while(0)
#define BR
#endif


//改造
typedef long long int ll;
using namespace std;


//ここから編集する


int main() {
    int N;
    cin >> N;
    vector<ll> a(N);
    REP(i, 0, N) {
        cin >> a[i];
    }
    ll pa = 0;

    REP(i, 0, N) {
        ll tmp = a[i] / 2;
        pa += tmp;
        a[i] -= (2 * tmp);
        if(i < N - 1){
            if(a[i] == 1 && a[i+1] > 0){
                a[i]--;
                a[i+1]--;
                pa++;
            }
        }
    }

    cout << pa << endl;
    return 0;

}

Submission Info

Submission Time
Task B - Simplified mahjong
User homesentinel
Language C++14 (GCC 5.4.1)
Score 400
Code Size 1698 Byte
Status AC
Exec Time 44 ms
Memory 1024 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 1024 KB
02.txt AC 40 ms 1024 KB
03.txt AC 40 ms 1024 KB
04.txt AC 29 ms 1024 KB
05.txt AC 29 ms 1024 KB
06.txt AC 29 ms 1024 KB
07.txt AC 36 ms 1024 KB
08.txt AC 36 ms 1024 KB
09.txt AC 40 ms 1024 KB
10.txt AC 40 ms 1024 KB
11.txt AC 17 ms 1024 KB
12.txt AC 44 ms 1024 KB
13.txt AC 40 ms 1024 KB
14.txt AC 40 ms 1024 KB
15.txt AC 17 ms 1024 KB
16.txt AC 41 ms 1024 KB
17.txt AC 40 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