Submission #844633


Source Code Expand

Copy
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#define PB push_back
#define MP make_pair
#define sz(v) (in((v).size()))
#define forn(i,n) for(in i=0;i<(n);++i)
#define forv(i,v) forn(i,sz(v))
#define fors(i,s) for(auto i=(s).begin();i!=(s).end();++i)
#define all(v) (v).begin(),(v).end()
using namespace std;
typedef long long in;
typedef vector<in> VI;
typedef vector<VI> VVI;
VI a;
int main(){
  ios::sync_with_stdio(0);
  cin.tie(0);
  in n;
  cin>>n;
  a.resize(n+3,0);
  forn(i,n)
    cin>>a[i+1];
  in sm=0;
  forn(i,sz(a)-1){
    sm+=a[i]/2;
    a[i]%=2;
    if(a[i] && a[i+1]){
      --a[i];
      --a[i+1];
      ++sm;
    }
  }
  cout<<sm<<endl;
  return 0;
}

Submission Info

Submission Time
Task B - Simplified mahjong
User w4yneb0t
Language C++14 (GCC 5.4.1)
Score 400
Code Size 781 Byte
Status AC
Exec Time 25 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 24 ms 1024 KB
02.txt AC 24 ms 1024 KB
03.txt AC 25 ms 1024 KB
04.txt AC 20 ms 1024 KB
05.txt AC 21 ms 1024 KB
06.txt AC 21 ms 1024 KB
07.txt AC 23 ms 1024 KB
08.txt AC 23 ms 1024 KB
09.txt AC 24 ms 1024 KB
10.txt AC 24 ms 1024 KB
11.txt AC 16 ms 1024 KB
12.txt AC 25 ms 1024 KB
13.txt AC 23 ms 1024 KB
14.txt AC 23 ms 1024 KB
15.txt AC 15 ms 1024 KB
16.txt AC 24 ms 1024 KB
17.txt AC 24 ms 1024 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