Submission #2792626

Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair


ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }

const ll MOD=1000000007LL;

ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }
// ll comb(ll n, ll k) { ll v=1; for(ll i=1; i<=k; i++) v = DIV(MUL(v, n-i+1),i); return v; }
//


ll solve(int N, vi& a) {
    ll rem0=-1, rem1=-1;

    rem0 = a[0]/2;
    if (a[0]%2) rem1 = rem0;

    for (int i=1; i<N; ++i) {
#ifdef DEBUG
        // fprintf(stderr, "%d] %lld %lld\n", i-1, rem0, rem1);
#endif
        ll nrem0=-1, nrem1=-1, tmp;
        if (rem0 >= 0) {
            tmp = rem0 + a[i]/2;
            if (a[i] % 2) nrem1 = max(nrem1, tmp);
            else          nrem0 = max(nrem0, tmp);
        }
        if (rem1 >= 0) {
            if (a[i]) {
                tmp = rem1 + 1 + (a[i]-1)/2;
                if ((a[i]-1) % 2) nrem1 = max(nrem1, tmp);
                else              nrem0 = max(nrem0, tmp);
            }
            tmp = rem1 + a[i]/2;
            if (a[i] % 2) nrem1 = max(nrem1, tmp);
            else          nrem0 = max(nrem0, tmp);
        }
        rem0 = nrem0; rem1 = nrem1;
    }
#ifdef DEBUG
    // fprintf(stderr, "%d] %lld %lld\n", N-1, rem0, rem1);
#endif
    return max(rem0, rem1);
}

int main() {
    int N; cin>>N;
    vi a(N); rep(i,N) cin>>a[i];
    cout << solve(N,a) << endl;
    return 0;
}

Submission Info

Submission Time
Task B - Simplified mahjong
User naoya_t
Language C++14 (GCC 5.4.1)
Score 400
Code Size 2812 Byte
Status
Exec Time 44 ms
Memory 640 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 s1.txt, s2.txt
All 400 / 400 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 41 ms 640 KB
02.txt 41 ms 640 KB
03.txt 41 ms 640 KB
04.txt 30 ms 640 KB
05.txt 30 ms 640 KB
06.txt 30 ms 640 KB
07.txt 36 ms 640 KB
08.txt 36 ms 640 KB
09.txt 41 ms 640 KB
10.txt 41 ms 640 KB
11.txt 17 ms 640 KB
12.txt 44 ms 640 KB
13.txt 41 ms 640 KB
14.txt 41 ms 640 KB
15.txt 17 ms 640 KB
16.txt 41 ms 640 KB
17.txt 41 ms 640 KB
18.txt 1 ms 256 KB
19.txt 1 ms 256 KB
20.txt 1 ms 256 KB
21.txt 1 ms 256 KB
22.txt 1 ms 256 KB
s1.txt 1 ms 256 KB
s2.txt 1 ms 256 KB