Submission #1500363
Source Code Expand
#include <bits/stdc++.h>
using namespace std ;
#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) begin(r),end(r)
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout<<#x<<": "<<x<<endl
#define fcout(n) cout<<fixed<<setprecision((n))
#define scout(n) cout<<setw(n)
#define vary(type,name,size,init) vector< type> name(size,init)
#define vvl(v,w,h,init) vector<vector<ll>> v(w,vector<ll>(h,init))
#define mp(a,b) make_pair(a,b)
#define rep(i,n) for(int i = 0; i < (int)(n);++i)
#define REP(i,a,b) for(int i = (a);i < (int)(b);++i)
#define repi(it,array) for(auto it = array.begin(),end = array.end(); it != end;++it)
#define repa(n,array) for(auto &n :(array))
using ll = long long;
using pii = pair<int,int> ;
using pll = pair<ll,ll> ;
const ll mod = 1e9+7;
constexpr ll inf = ((1<<30)-1)*2+1 ;
constexpr double PI = acos(-1.0) ;
double eps = 1e-10 ;
const int dy[] = {-1,0,1,0,1,-1,1,-1};
const int dx[] = {0,-1,0,1,1,-1,-1,1};
inline bool value(int x,int y,int w,int h){
return (x >= 0 && x < w && y >= 0 && y < h);
}
ll v[100003];
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
rep(i,n){
cin >> v[i];
}
ll ans = 0;
rep(i,n){
ans += v[i] / 2;
if(v[i] % 2 && v[i+1] > 0){
v[i+1]--;
++ans;
}
}
std::cout << ans << std::endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
B - Simplified mahjong |
User |
Halksel |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
1452 Byte |
Status |
AC |
Exec Time |
12 ms |
Memory |
1152 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
400 / 400 |
Status |
|
|
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 |
11 ms |
1024 KB |
02.txt |
AC |
11 ms |
1024 KB |
03.txt |
AC |
12 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 |
12 ms |
1152 KB |
10.txt |
AC |
11 ms |
1024 KB |
11.txt |
AC |
7 ms |
1024 KB |
12.txt |
AC |
12 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 |
AC |
11 ms |
1024 KB |
17.txt |
AC |
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 |