Submission #844865


Source Code Expand

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

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

#define forn(i, a, n) for (int i = a; i < n; ++i)
#define ford(i, a, n) for (int i = n - 1; i >= a; --i)
#define fore(i, a, n) for (int i = a; i <= n; ++i)
#define all(a) (a).begin(), (a).end()
#define fs first
#define sn second
#define trace(a)\
	for (auto i : a) cerr << i << ' ';\
	cerr << '\n'
#define eb emplace_back

#ifndef M_PI
const ld M_PI = acos(-1.0);
#endif

const ld eps = 1e-9;
const int INF = 2000000000;
const ll LINF = 1ll * INF * INF;
const ll MOD = 1000000007;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n;
	cin >> n;
	ll s = 0, ans = 0;
	forn(i, 0, n) {
		int x;
		cin >> x;
		if (x == 0) {
			ans += s / 2;
			s = 0;
		} else s += x;
	}
	ans += s / 2;
	cout << ans << '\n';
	return 0;
}

Submission Info

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