Submission #4276580


Source Code Expand

#include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <vector>
#include <cstdio>
#include <bits/stdc++.h>
#include <set>
#include <map>
#include <stdio.h>
#include <stack>
#include <queue>
#include <deque>
#include <numeric>
#include <bits/stdc++.h>
#include <utility>
#include <iomanip>

#define ALL(obj) (obj).begin(), (obj).end()
#define FOR(i,a,b) for(int i = (a); i < (b); i++)
#define RFOR(i,a,b) for(int i = (a); (b) <= i; i--)
#define REP(i,n) for(int i = 0; i < (n); i++)
#define RREP(i,n) for(int i = n; n <= i; i--)
#define ABS(a) ((a < 0) ? ((-1)*(a)) : (a))
#define elif else if
#define MOD 1000000007
#define INF (1<<29)

using namespace std;

#define ld long double
#define ll long long

map <int ,int> mpa,mpb;
typedef pair<ll, ll> P;
priority_queue<P, vector<P>, greater<P>> pque;

int main(){
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  ll N,x;
  cin >> N;
  ll ans=0;
  ll A[100100];
  for(int i=1;i<=N;i++){
    cin >> A[i];
  }
  for(int i=1;i<=N;i++){
    if(A[i]%2==1 && A[i+1]>0){
      A[i]--;
      A[i+1]--;
      ans++;
    }
    ans+=A[i]/2;
  }
  cout << ans << endl;
  return 0;
}

Submission Info

Submission Time
Task B - Simplified mahjong
User arks1225
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1207 Byte
Status WA
Exec Time 11 ms
Memory 1024 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 2
AC × 20
WA × 4
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 AC 11 ms 1024 KB
04.txt AC 10 ms 1024 KB
05.txt AC 10 ms 1024 KB
06.txt AC 10 ms 1024 KB
07.txt AC 11 ms 1024 KB
08.txt AC 11 ms 1024 KB
09.txt AC 11 ms 1024 KB
10.txt AC 11 ms 1024 KB
11.txt AC 7 ms 1024 KB
12.txt AC 11 ms 1024 KB
13.txt AC 11 ms 1024 KB
14.txt AC 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 AC 1 ms 256 KB